SAT modulo ODE: A direct SAT approach to hybrid systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5311 LNCS, Issue , 2008, Pages 171-185

  Eggers, Andreas ^a   Fränzle, Martin ^a   Herde, Christian ^a  

^a UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; HYBRID SYSTEMS; INITIAL VALUE PROBLEMS;

ARITHMETIC CONSTRAINTS; AUTOMATED REASONING; BOOLEAN COMBINATIONS; CO-ORDINATE TRANSFORMATION; PARTIAL INFORMATION; REACHABLE STATE SET; SAT MODULO THEORIES; SEAMLESS INTEGRATION;

ORDINARY DIFFERENTIAL EQUATIONS;

EID: 56749155644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88387-6_14     Document Type: Conference Paper

References (16)

1. Alur, R., Pappas, G.J. (eds.): HSCC 2004. LNCS, vol. 2993. Springer, Heidelberg (2004)
2. Audemard, G., Bozzano, M., Cimatti, A., Sebastiani, R.: Verifying industrial hybrid systems with MathSAT. ENTCS 89(4) (2004)
3. Benhamou, F., Granvilliers, L.: Continuous and interval constraints. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, Foundations of Artificial Intelligence, ch. 16, pp. 571-603. Elsevier, Amsterdam (2006)
4. Biere, A., Cimatti, A., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579. Springer, Heidelberg (1999)
5. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5, 394-397 (1962)
6. Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
7. Fehnker, A., Ivančić, F.: Benchmarks for hybrid systems verification. In: Alur, Pappas (eds.) in [1] pp. 326-341
8. Fränzle, M., Herde, C.: HySAT: An efficient proof engine for bounded model checking of hybrid systems. Formal Methods in Syst. Design 30(3), 179-198 (2007)
9. Fränzle, M., Herde, C., Ratschan, S., Schubert, T., Teige, T.: Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure. JSAT Special Issue on Constraint Programming and SAT 1, 209-236 (2007)
10. Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(t): Fast decision procedures. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114. Springer, Heidelberg (2004)
11. Henzinger, T.A., Horowitz, B., Majumdar, R., Wong-Toi, H.: Beyond HYTECH: Hybrid systems analysis using interval numerical methods. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 130-144. Springer, Heidelberg (2000)
12. Hickey, T., Wittenberg, D.: Rigorous modeling of hybrid systems using interval arithmetic constraints. In: Alur, Pappas (eds.) in [1], pp. 402-416
13. Lohner, R.J.: Enclosing the solutions of ordinary initial and boundary value problems. In: Computerarithmetic: Scientific Computation and Programming Languages, pp. 255-286. Teubner, Stuttgart (1987)
14. Moore, R.E.: Automatic local coordinate transformation to reduce the growth of error bounds in interval computation of solutions of ordinary differential equations. In: Ball, L.B. (ed.) Error in Digital Computation, vol. II, pp. 103-140. Wiley, New York (1965)
15. Ramdani, N., Meslem, N., Candau, Y.: Rechability of unvertain nonlinear systems using a nonlinear hybridization. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 415-428. Springer, Heidelberg (2008)
16. Stauning, O.: Automatic Validation of Numerical Solutions. PhD thesis, Danmarks Tekniske Universitet, Kgs.Lyngby, Denmark (1997)