IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Stutter-invariant temporal properties are expressible without the next-time operator
Information Processing Letters
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Communicating sequential processes
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
A note on a question of Peled and Wilke regarding stutter-invariant LTL
Information Processing Letters
A Stuttering Closed Temporal Logic for Modular Reasoning about Concurrent Programs
ICTL '94 Proceedings of the First International Conference on Temporal Logic
Projection in Temporal Logic Programming
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
A Tableau Method for Interval Temporal Logic with Projection
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Stutter-Invariant Languages, omega-Automata, and Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
The anchored version of the temporal framework
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Reasoning about digital circuits
Reasoning about digital circuits
Compositional Temporal Logic Based on Partial Order
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
A framed temporal logic programming language
Journal of Computer Science and Technology
Framed temporal logic programming
Science of Computer Programming
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Complexity of propositional projection temporal logic with star†
Mathematical Structures in Computer Science
Generalized Russian Cards Problem
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Model checking propositional projection temporal logic based on SPIN
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Propositional projection temporal logic, Büchi automata and ω-regular expressions
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
| Hi-index | 0.01 |
This paper investigates compositional verification with Propositional Projection Temporal Logic (PPTL). To this end, a sublogic Stutter-invariant PPTL (written as PPTLst) is first proposed. As a specification language, PPTLst helps designers get rid of irrelevant detail in compositional verification of a concurrent system since the projection construct of PPTLst allows designers to assert formulas over points of interest through an execution. In this way, modules can be abstracted based on their local properties defined by projection construct, and substitution of modules by the abstracted ones will not affect overall properties of the system. PPTLst is proved to be able to capture all stutter-invariant properties expressive in PPTL. Further, an algorithm translating PPTL formulas to PPTLst ones is also given. And the complexity of the algorithm is accordingly studied. Moreover, an example-automatic gas station, is studied to illustrate compositional verification with PPTLKst.