The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
A graphical interval logic for specifying concurrent systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Oracles for checking temporal properties of concurrent systems
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Interval logics and their decision procedures: part I: an interval logic
Theoretical Computer Science
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
Model checking
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
A Decision Algorithm for Full Propositional Temporal Logic
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Automata Generation for On-the-fly Automatic Verification Using Formulas of an Interval Logic
ACSD '01 Proceedings of the Second International Conference on Application of Concurrency to System Design
| Hi-index | 0.00 |
Future Interval Logic (FIL) and its intuitive graphical representation, Graphical Interval Logic (GIL), can be used as the formal description language of model checking tools to verify hardware and software systems. An interval clearly defines the temporal scope over which properties are evaluated. From interval formulas specifying the temporal behavior of a system we obtain their semantically equivalent Büchi automata, but in such a way that our algorithm can be integrated into an on-the-fly model checking tool. As the property automaton can be generated simultaneously with, and guided by, the construction of the system model, it is possible to detect that a property is violated by constructing only a part of both state spaces. This is the first time that this kind of algorithm has been developed for an interval logic. The relations with other automated verification techniques from linear temporal logic are also discussed. Moreover, an appendix with proof of the correctness of our algorithm is included.