Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal logic for real time systems
Temporal logic for real time systems
Cecil: A Sequencing Constraint Language for Automatic Static Analysis Generation
IEEE Transactions on Software Engineering
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A practical theory of programming
A practical theory of programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Property specification patterns for finite-state verification
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Model Checking
A Stuttering Closed Temporal Logic for Modular Reasoning about Concurrent Programs
ICTL '94 Proceedings of the First International Conference on Temporal Logic
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Events in Linear-Time Properties
RE '99 Proceedings of the 4th IEEE International Symposium on Requirements Engineering
Proving real-time properties of programs with temporal logic
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Tools and rules for the practicing verifier
Tools and rules for the practicing verifier
Correct transformation: From object-based graph grammars to PROMELA
Science of Computer Programming
Verifying fault-tolerant distributed systems using object-based graph grammars
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Specification patterns from research to industry: a case study in service-based applications
Proceedings of the 34th International Conference on Software Engineering
Specification patterns for properties over reachable states of graph grammars
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
| Hi-index | 0.00 |
A pattern-based approach to the presentation, codification and reuse of property specifications for finite-state verification was proposed by Dwyer and his colleagues in [4,3]. The patterns enable nonexperts to read and write formal specifications for realistic systems and facilitate easy conversion of specifications between formalisms, such as LTL, CTL, QRE. In this paper we extend the pattern system with events -- changes of values of variables in the context of LTL.