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
Specifying real-time properties with metric temporal logic
Real-Time Systems
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)
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
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)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Composition and refinement of discrete real-time 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)
Generation of Execution Sequences for Modular Time Critical Systems
IEEE Transactions on Software Engineering
A methodology for hardware verification using compositional model checking
Science of Computer Programming - Special issue on mathematics of program construction
Automated deductive requirements analysis of critical systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Concurrency verification: introduction to compositional and noncompositional methods
Concurrency verification: introduction to compositional and noncompositional methods
Formal Methods for Real-Time Computing
Formal Methods for Real-Time Computing
Automated Software Engineering
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Efficient Computation of Recurrence Diameters
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
The Need for Compositional Proof Systems: A Survey
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Compositional Verification of Real-Time Applications
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
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
Microarchitecture Verification by Compositional Model Checking
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques
CAV '02 Proceedings of the 14th 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
Automated compositional proofs for real-time systems
Theoretical Computer Science
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
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Automated Verification of Dense-Time MTL Specifications Via Discrete-Time Approximation
FM '08 Proceedings of the 15th international symposium on Formal Methods
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
Integrated Modeling and Verification of Real-Time Systems through Multiple Paradigms
SEFM '09 Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
A Metric Encoding for Bounded Model Checking
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Alloy: a logical modelling language
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
BAT: the bit-level analysis tool
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Proceedings of the 14th international SPIN conference on Model checking software
Incremental and complete bounded model checking for full PLTL
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
| Hi-index | 0.00 |
We introduce bounded satisfiability checking, a verification technique that extends bounded model checking by allowing also the analysis of a descriptive model, consisting of temporal logic formulae, instead of the more customary operational model, consisting of a state transition system. We define techniques for encoding temporal logic formulae into Boolean logic that support the use of bi-infinite time domain and of metric time operators. In the framework of bounded satisfiability checking, we show how a descriptive model can be refined into an operational one, and how the correctness of such a refinement can be verified for the bounded case, setting the stage for a stepwise system development method based on a bounded model refinement. Finally, we show how the adoption of a modular approach can make the bounded refinement process more manageable and efficient. All introduced concepts are extensively applied to a set of case studies, and thoroughly experimented through Zot, our SAT solver-based verification toolset.