A Metric Encoding for Bounded Model Checking (extended version)
Preprint
Abstract
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique which is particularly optimized for managing quantitative future and past metric temporal operators, typically found in properties of hard real time systems. The encoding is simple and intuitive in principle, but it is made more complex by the presence, typical of the Bounded Model Checking technique, of backward and forward loops used to represent an ultimately periodic infinite domain by a finite structure. We report and comment on the new encoding technique and on an extensive set of experiments carried out to assess its feasibility and effectiveness.Keywords
All Related Versions
- Version 1, 2009-07-17, ArXiv
- Version 2, 2009-07-27, ArXiv
- Published version: , 741.
This publication has 4 references indexed in Scilit:
- Automated deductive requirements analysis of critical systemsACM Transactions on Software Engineering and Methodology, 2001
- Validating real-time systems by history-checking TRIO specificationsACM Transactions on Software Engineering and Methodology, 1994
- TRIO: A logic language for executable specifications of real-time systemsJournal of Systems and Software, 1990
- A fast mutual exclusion algorithmACM Transactions on Computer Systems, 1987