A new polynomial-time algorithm for linear programming
Combinatorica
Trusted computing systems: the ProCoS experience
ICSE '92 Proceedings of the 14th international conference on Software engineering
Bounded Model Checking for Timed Systems
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Take It NP-Easy: Bounded Model Construction for Duration Calculus
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
An Extended Duration Calculus for Hybrid Real-Time Systems
Hybrid Systems
Bounded Model Construction for Monadic Second-Order Logics
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
ICS: Integrated Canonizer and Solver
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
From Duration Calculus To Linear Hybrid Automata
Proceedings of the 7th International Conference on Computer Aided Verification
Automated Verification of Dense-Time MTL Specifications Via Discrete-Time Approximation
FM '08 Proceedings of the 15th international symposium on Formal Methods
Deciding an interval logic with accumulated durations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
On sampling abstraction of continuous time logic with durations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Engineering the development of embedded systems
Formal methods and hybrid real-time systems
Model-checking of specifications integrating processes, data and time
FM'05 Proceedings of the 2005 international conference on Formal Methods
Modal strength reduction in quantified discrete duration calculus
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Bounded model-checking of discrete duration calculus
Proceedings of the 16th international conference on Hybrid systems: computation and control
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Specifying safety-critical systems with a decidable duration logic
Science of Computer Programming
| Hi-index | 0.00 |
A rich dense-time logic, called Interval Duration Logic (IDL), is useful for specifying quantitative properties of timed systems. The logic is undecidable in general. However, several approaches can be used for checking validity (and model checking) of IDL formulae in practice. In this paper, we propose bounded validity checking of IDL formulae by polynomially reducing this to checking unsatisfiability of lin-sat formulae. We implement this technique and give performance results obtained by checking the unsatisfiability of the resulting lin-sat formulae using the ICS solver. We also perform experimental comparisons of several approaches for checking validity of IDL formulae, including (a) digitization followed by automata-theoretic analysis, (b) digitization followed by pure propositional SAT solving, and (c) lin-sat solving as proposed in this paper. Our experiments use a rich set of examples drawn from the Duration Calculus literature.