Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
A graphical interval logic for specifying concurrent systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
A graphic environment for temporal reasoning
A graphic environment for temporal reasoning
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
Specification in CTL + Past for verification in CTL
Information and Computation - Special issue on EXPRESS 1997
Composite Propositions: Toward Support for Formal Specification of System Properties
SEW '02 Proceedings of the 27th Annual NASA Goddard Software Engineering Workshop (SEW-27'02)
Elucidation and specification of software properties through patterns and composite propositions to support formal verification techniques
Towards support for software model checking: improving the efficiency of formal specifications
Advances in Software Engineering
Hi-index | 0.00 |
The Specification Pattern System (SPS) and the Property Specification (Prospec) tool assist a user in generating formal specifications in Linear Temporal Logic (LTL), as well as other languages, from property patterns and scopes. Patterns are high-level abstractions that provide descriptions of common properties, and scopes describe the extent of program execution over which the property holds. The purpose of the work presented in this paper is to verify that the generated LTL formulas match the natural language descriptions, timelines, and traces of computation that describe the pattern and scope. The LTL formulas were verified using the Spin model checker on test cases developed using boundary value analysis and equivalence class testing strategies. A test case is an LTL formula and a sequence of Boolean valuations. The LTL formulas were those generated from SPS and Prospec. The Boolean valuations of propositions in the LTL formula are generated by a deterministic, single-threaded Promela program that was run using the software model-checker Spin. For each pattern, a suite of test cases was. The experiments uncovered several errors in both the SPS-generated and the Prospec-generated formulas.