Information Processing Letters
Verifying temporal properties without temporal logic
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stutter-invariant temporal properties are expressible without the next-time operator
Information Processing Letters
Introducing Dynamic Constraints in B
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Specification and Proof of Liveness Properties under Fairness Assumptions in B Event Systems
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Refinement preserves PLTL properties
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Refinement and reachability in event_b
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
A JAG extension for verifying LTL properties on B event systems
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
JAG: JML annotation generation for verifying temporal properties
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
Compositional action system derivation using enforced properties
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Reasoning about liveness properties in event-B
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Matelas: a predicate calculus common formal definition for social networking
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
A JAG extension for verifying LTL properties on B event systems
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
| Hi-index | 0.00 |
This paper proposes a way to verify temporal properties expressed in LTL (Linear Temporal Logic) on B Event Systems. The method consists in generating a B representation of the Büchi automaton associated with the LTL property to verify. We establish the consistency of the generated event system implies the satisfaction of the LTL property on the executions of the original event system. We also characterize the subset of LTL preserved by the B refinement and we propose another refinement relation, with necessary and sufficient condition for preserving any given LTL property.