On the public citation graph
Verification of LTL on B Event Systems
0 signed · 35 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11415787_14openalex-snapshot
Refinement and Reachability in Event_B
inferredcites →https://doi.org/10.1007/11415787_18openalex-snapshot
GeneSyst: A Tool to Reason About Behavioral Aspects of B Event Specifications. Application to Security Properties
inferredcites →https://doi.org/10.1007/11693017_27openalex-snapshot
JAG: JML Annotation Generation for Verifying Temporal Properties
inferredcites →https://doi.org/10.1007/11955757openalex-snapshot
B 2007: formal specification and development in B : 7th International Conference of B Users, Besançon, France, January 17-19, 2007 proceedings
inferredcites →https://doi.org/10.1007/11955757_25openalex-snapshot
A JAG Extension for Verifying LTL Properties on B Event Systems
inferredcites →https://doi.org/10.1007/3-540-44585-4_6openalex-snapshot
Fast LTL to Büchi Automata Translation
inferredcites →https://doi.org/10.1007/3-540-44880-2openalex-snapshot
ZB 2003: Formal Specification and Development in Z and B
inferredcites →https://doi.org/10.1007/3-540-44880-2_24openalex-snapshot
Refinement Preserves PLTL Properties
inferredcites →https://doi.org/10.1007/b135596openalex-snapshot
ZB 2005: Formal Specification and Development in Z and B
inferredcites →https://doi.org/10.1007/bf01211865openalex-snapshot
Safety, liveness and fairness in temporal logic
inferredcites →https://doi.org/10.1007/bfb0053349openalex-snapshot
B’98: Recent Advances in the Development and Use of the B Method
inferredcites →https://doi.org/10.1007/bfb0053357openalex-snapshot
Introducing dynamic constraints in B
inferredcites →https://doi.org/10.1016/0020-0190(86)90132-8openalex-snapshot
Safety without stuttering
inferredcites →https://doi.org/10.1016/s0020-0190(97)00133-6openalex-snapshot
Stutter-invariant temporal properties are expressible without the next-time operator
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1145/59287.62028openalex-snapshot
Verifying temporal properties without temporal logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11955757_25openalex-snapshot
A JAG Extension for Verifying LTL Properties on B Event Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10181-1_14openalex-snapshot
Managing LTL Properties in Event-B Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-11811-1_20openalex-snapshot
Matelas: A Predicate Calculus Common Formal Definition for Social Networking
inferred← citeshttps://doi.org/10.1007/978-3-642-13321-3_9openalex-snapshot
Compositional Action System Derivation Using Enforced Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_31openalex-snapshot
Reasoning about Liveness Properties in Event-B
inferred← citeshttps://doi.org/10.1007/s00165-016-0362-6openalex-snapshot
Verification of EB3 specifications using CADP
inferred← citeshttps://doi.org/10.1007/s00165-016-0376-0openalex-snapshot
Foundations for using linear temporal logic in Event-B refinement
inferred← citeshttps://doi.org/10.1007/s10009-009-0132-3openalex-snapshot
Seven at one stroke: LTL model checking for high-level specifications in B, Z, CSP, and more
inferred← citeshttps://doi.org/10.1007/s10270-015-0504-yopenalex-snapshot
Towards an integrated formal method for verification of liveness properties in distributed systems: with application to population protocols
inferred← citeshttps://doi.org/10.1007/s10270-016-0514-4openalex-snapshot
Refinement-based Validation of Event-B Specifications
inferred← citeshttps://doi.org/10.1016/j.infsof.2015.01.001openalex-snapshot
Facilitating construction of safety cases from formal models in Event-B
inferred← citeshttps://doi.org/10.1109/hase.2011.47openalex-snapshot
Guidelines for Formal Domain Modeling in Event-B
inferred← citeshttps://doi.org/10.1109/ictta.2008.4530351openalex-snapshot
Temporal Refinement in Co-Design
inferred← citeshttps://doi.org/10.1109/issre.2012.11openalex-snapshot
An Assertions-Based Approach to Verifying the Absence Property Pattern
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.