Counterexample-guided predicate abstraction of hybrid systems

Theoretical Computer Science

Volumn 354, Issue 2, 2006, Pages 250-271

  Alur, Rajeev ^a   Dang, Thao ^b   Ivančić, Franjo ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b VERIMAG   (France)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

Counterexample analysis; Hybrid systems; Model checking; Predicate abstraction; Verification

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; FINITE AUTOMATA; HYBRID COMPUTERS; MATHEMATICAL MODELS; OPTIMIZATION;

COUNTEREXAMPLE ANALYSIS; HYBRID SYSTEMS; MODEL CHECKING; PREDICATE ABSTRACTION; VERIFICATION;

ABSTRACTING;

EID: 33644671996     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.11.026     Document Type: Conference Paper

References (33)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine The algorithmic analysis of hybrid systems Theoret. Comput. Sci. 138 1995 3 34
2. R. Alur, T. Dang, J. Esposito, Y. Hur, F. Ivančić, V. Kumar, I. Lee, P. Mishra, G. Pappas, and O. Sokolsky Hierarchical modeling and analysis of embedded systems Proc. IEEE 91 1 2003 11 28
3. R. Alur, T. Dang, and F. Ivančić Reachability analysis of hybrid systems via predicate abstraction Hybrid Systems: Computation and Control, Fifth Internat. Workshop, LNCS vol. 2289 2002 Springer Berlin 35 48
4. R. Alur, T. Dang, F. Ivančić, Reachability analysis of hybrid systems using counter-example guided predicate abstraction, Technical Report MS-CIS-02-34, University of Pennsylvania, Philadelphia, PA, November 2002.
5. R. Alur, and D.L. Dill A theory of timed automata Theoret. Comput. Sci. 126 2 1994 183 235
6. R. Alur, A. Itai, R.P. Kurshan, and M. Yannakakis Timing verification by successive approximation Inform. and Comput. 118 1 1995 142 157
7. E. Asarin, O. Bournez, T. Dang, and O. Maler Approximate reachability analysis of piecewise linear dynamical systems Hybrid Systems: Computation and Control, Third Internat. Workshop, Lecture Notes in Computer Science vol. 1790 2000 21 31
8. T. Ball, and S. Rajamani Bebop: a symbolic model checker for boolean programs SPIN 2000 Workshop on Model Checking of Software, Lecture Notes in Computer Science vol. 1885 2000 113 130
9. C. Barber, D. Dobkin, and H. Huhdanpaa The Quickhull algorithm for convex hulls ACM Trans. Math. Software 22 4 1996 469 483
10. S. Cameron A comparison of two fast algorithms for computing the distance between convex polyhedra IEEE Trans. Robotics Automation 13 6 1997 915 920
11. A. Chutinan, and B.K. Krogh Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations Hybrid Systems: Computation and Control, Lecture Notes in Computer Science vol. 1569 1999 76 90
12. E. Clarke, A. Fehnker, Z. Han, B. Krogh, O. Stursberg, and M. Theobald Verification of hybrid systems based on counterexample-guided abstraction refinement Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science vol. 2619 2003 Springer Berlin 192 207
13. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith Counterexample-guided abstraction refinement Computer Aided Verification 2000 154 169
14. E.M. Clarke, A. Fehnker, Z. Han, B. Krogh, J. Ouaknine, O. Stursberg, and M. Theobald Abstraction and counterexample-guided refinement of hybrid systems Internat. J. Found. Comput. Sci. 14 3 2003
15. E.M. Clarke, and R.P. Kurshan Computer-aided verification IEEE Spectrum 33 6 1996 61 67
16. J.C. Corbett, M.B. Dwyer, J. Hatcliff, S. Laubach, C.S. Pasareanu, Robby, and H. Zheng Bandera: extracting finite-state models from Java source code 22nd Internat. Conf. on Software Engineering 2000 439 448
17. P. Cousot, and R. Cousot Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints 4th ACM Symp. on Principles of Programming Languages 1977 238 252
18. G. Das, and D. Joseph The complexity of minimum convex nested polyhedra Canadian Conf. on Computational Geometry 1990
19. C. Daws, A. Olivero, S. Tripakis, and S. Yovine The tool KRONOS Hybrid Systems III: Verification and Control, Lecture Notes in Computer Science vol. 1066 1996 Springer Berlin
20. D. Dobkin, and D. Kirkpatrick Determining the separation of preprocessed polyhedra - a unified approach Proc. ICALP'90 1990 400 413
21. H. Edelsbrunner, and F.P. Preparata Minimum polygon separation Inform. and Comput. 77 1987 218 232
22. K. Fukuda, cddlib reference manual, cddlib version 092a, Technical Report, McGill University, 2001.
23. T.A. Henzinger, P. Ho, and H. Wong-Toi HYTECH: the next generation 16th IEEE Real-Time Systems Symposium 1995 56 65
24. T.A. Henzinger, P. Ho, and H. Wong-Toi HYTECH: a model checker for hybrid systems Software Tools Technol. Transfer 1 1997
25. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre Lazy abstraction Symp. on Principles of Programming Languages 2002 58 70
26. G.J. Holzmann The model checker SPIN IEEE Trans. Software Eng. 23 5 1997 279 295
27. G.J. Holzmann, and M.H. Smith Automating software feature verification Bell Labs Technical J. 5 2 2000 72 87
28. T. Hudson, M. Lin, J. Cohen, S. Gottschalk, and D. Manocha V-collide: accelerate collision detection for vrml Proc. VRML'97 1997
29. F. Ivančić, Modeling and analysis of hybrid systems, Ph.D. Dissertation, University of Pennsylvania, Philadelphia, PA, 2003.
30. K.J. Kristoffersen, F. Laroussinie, K.G. Larsen, P. Pettersson, W. Yi, A compositional proof of a real-time mutual exclusion protocol, in: Proc. 7th Internat. Joint Conf. Theory and Practice of Software Development (TAPSOFT'97), Lille, France, April 1997, vol. 1214, Springer, Berlin, 1997, pp. 565-579.
31. K. Larsen, P. Pettersson, and W. Yi UPPAAL in a nutshell Springer Internat. J. Software Tools Technol. Transfer 1 1997
32. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem Property preserving abstractions for the verification of concurrent systems Formal Meth. System Des. 6 1 1995
33. N. Megiddo On the complexity of polyhedral separability Discrete Comput. Geometry 3 1988 325 337