A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
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
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)
From formal models to formally based methods: an industrial experience
ACM Transactions on Software Engineering and Methodology (TOSEM)
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
Formal Methods for Real-Time Computing
Formal Methods for Real-Time Computing
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
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
ASP-DAC '07 Proceedings of the 2007 Asia and South Pacific Design Automation Conference
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
A Metric Encoding for Bounded Model Checking
FM '09 Proceedings of the 2nd World Congress on Formal Methods
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 traditionally deal with temporal logic languages and automata interpreted over 驴-words, i.e., where time is infinite in the future but finite in the past. This is motivated by the study of reactive systems, which are typically nonterminating: system termination may be abstracted away by allowing an infinite future. In the same way, if time is infinite also in the past one is allowed to ignore the complexity of system initialization. Specifications may then be simpler and more easily understandable, because they do not necessarily include the description of operations (such as configuration or installation) typically performed at system deployment time. In this paper, we investigate the feasibility of bounded model checking and bounded satisfiability checking when dealing with bi-infinite automata and logics. We present a tool and we discuss its application to a set of case studies, arguing that bi-infinite time does not entail significant penalties in verification time and space.