Using satisfiability modulo theories for inductive verification of lustre programs

Electronic Notes in Theoretical Computer Science

Volumn 144, Issue 1 SPEC. ISS, 2006, Pages 19-33

  Franzén, Anders ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

Formal verification; Lustre; Satisfiability modulo theories; Temporal induction

Indexed keywords

DIGITAL ARITHMETIC; FORMAL LOGIC; INTEGER PROGRAMMING;

FORMAL VERIFICATION; LUSTRE; SATISFIABILITY MODULO THEORIES; TEMPORAL INDUCTION;

COMPUTER SOFTWARE;

EID: 30344444447     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.07.017     Document Type: Conference Paper

References (19)

1. C. Barrett, and S. Berezin CVC Lite: A New Implementation of the Cooperating Validity Checker Proc. CAV'04 LNCS volume 3114 2004 Springer
2. P. Bjesse and K. Claessen. SAT-based Verification without State Space Traversal. In Proceedings of FMCAD 2000, 2000
3. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. Rossum, S. Schulz, and R. Sebastiani. An incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic. In Proc. TACAS'05, 2005
4. M.D. Bvre Sur la piste des Dalton 1960 Dargaud Lucky Productions
5. J.W. Chinneck Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program INFORMS Journal on Computing 9 2 1997 164 174
6. J.W. Chinneck, and E.W. Dravnieks Locating Minimal Infeasible Constraint Sets in Linear Programs ORSA Journal on Computing 3 2 1991 157 168
7. D. Deharbe, and S. Ranise Light-Weight Theorem Proving for Debugging and Verifying Units of Code Proc. SEFM'03 2003 IEEE Computer Society Press
8. G. Delzanno. Automatic Verification of Parameterized Cache Coherence Protocols. In Proccedings of CAV 2000, 2000
9. N. En and N. Srensson. An extensible SAT solver. In Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing, 2003
10. N. En and N. Srensson. Temporal Induction by Incremental SAT Solving. In Proceedings of the First International Workshop on Bounded Model Checking, 2003
11. A. Franzén. Combining SAT Solving and Integer Programming for Inductive Verification of Lustre Programs. Master's thesis, Chalmers University of Technology, 2004
12. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast Decision Procedures. In 16th International Conference on Computer Aided Verification (CAV), Boston (USA), July 2004
13. O. Guieu, and J.W. Chinneck Analyzing Infeasible Mixed-Integer and Integer Linear Programs INFORMS Journal on Computing 11 1 1999 63 77
14. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud The synchronous dataflow programming language Lustre Proceedings of the IEEE 79 9 September 1991 1305 1320
15. N. Halbwachs and P. Raymond. A Tutorial of Lustre. 2002
16. E. Jahier and P. Raymond. The Lucky language Reference Manual. Technical Report TR-2004-6, Verimag
17. B. Jeannet Dynamic Partitioning in Linear Relation Analysis. Application to the Verification of Synchronous Programs Formal Methods in System Design 23 1 2003 5 37
18. M. Sheeran, S. Singh, and G. Stålmarck Checking safety properties using induction and a SAT-solver Lecture Notes in Computer Science volume 1954 2000 Springer Verlag
19. H.M. Sheini, and K.A. Sakallah A SAT-based Decision Procedure for Mixed Logical/Integer Linear Problems Lecture Notes in Computer Science volume 3524 2005 320 335