Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
TRIO: A logic language for executable specifications of real-time systems
Journal of Systems and Software - On the role of language in programming
Theoretical Computer Science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A model parametric real-time logic
ACM Transactions on Programming Languages and Systems (TOPLAS)
Object-oriented logical specification of time-critical systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Validating real-time systems by history-checking TRIO specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
Generating test cases for real-time systems from logic specifications
ACM Transactions on Computer Systems (TOCS)
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
From formal models to formally based methods: an industrial experience
ACM Transactions on Software Engineering and Methodology (TOSEM)
Model checking
Generation of Execution Sequences for Modular Time Critical Systems
IEEE Transactions on Software Engineering
A framework architecture for supervision and control systems
ACM Computing Surveys (CSUR)
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Automated deductive requirements analysis of critical systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Symbolic Model Checking
Automated Software Engineering
Checking Safety Properties Using Induction and a SAT-Solver
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
A Finite-Domain Semantics for Testing Temporal Logic Specifications
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Proceedings of the Conference on Logic of Programs
Trio2Promela: A Model Checker for Temporal Metric Specifications
ICSE COMPANION '07 Companion to the proceedings of the 29th International Conference on Software Engineering
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Bounded model checking for past LTL
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Simple is better: efficient bounded model checking for past LTL
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Automated Verification of Dense-Time MTL Specifications Via Discrete-Time Approximation
FM '08 Proceedings of the 15th international symposium on Formal Methods
Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Practical Automated Partial Verification of Multi-paradigm Real-Time Models
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
A Metric Encoding for Bounded Model Checking
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Synthesizing adapters for conversational web-services from their WSDL interface
Proceedings of the 2010 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems
A theory of sampling for continuous-time metric temporal logic
ACM Transactions on Computational Logic (TOCL)
From interaction overview diagrams to temporal logic
MODELS'10 Proceedings of the 2010 international conference on Models in software engineering
Towards the UML-based formal verification of timed systems
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Towards the verification of multi-diagram UML models
Proceedings of the 34th International Conference on Software Engineering
MADES: a tool chain for automated verification of UML models of embedded systems
ECMFA'12 Proceedings of the 8th European conference on Modelling Foundations and Applications
Bounded satisfiability checking of metric temporal logic specifications
ACM Transactions on Software Engineering and Methodology (TOSEM) - In memoriam, fault detection and localization, formal methods, modeling and design
| Hi-index | 0.00 |
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over ω-words, i.e., infinite in the future but finite in the past. However, time with also an infinite past is a useful abstraction in specification. It allows one to ignore the complexity of system initialization in much the same way as system termination may be abstracted away by allowing an infinite future. One can then write specifications that are simpler and more easily understandable, because they do not include the description of the operations (such as configuration or installation) typically performed at system deployment time. The present paper is centered on the problem of satisfiability checking of linear temporal logic (LTL) formulae with past operators. We show that bounded model checking techniques can be adapted to deal with bi-infinite time in temporal logic, without incurring in any performance loss. Our claims are supported by a tool, whose application to a case study shows that satisfiability checking may be feasible also on nontrivial examples of temporal logic specifications.