An iterative framework for simulation conformance

Journal of Logic and Computation

Volumn 15, Issue 4, 2005, Pages 465-488

  Chaki, Sagar ^a   Clarke, Edmund ^a   Jha, Somesh ^b   Veith, Helmut ^c  

^a Carnegie Mellon University ^*  (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Abstraction; C programs; Concurrency; Refinement; Simulation; Software verification

Indexed keywords

ABSTRACTING; ALGORITHMS; C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); COMPUTER SIMULATION; COMPUTER SOFTWARE; ITERATIVE METHODS;

ABSTRACTION; C PROGRAMS; CONCURRENCY; REFINEMENT; SOFTWARE VERIFICATION;

SOFTWARE ENGINEERING;

EID: 23844439524     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/exi028     Document Type: Conference Paper

References (52)

1. S. Abramsky. Sematics of interaction: an introduction to game semantics. In Semantics and Logics of Computation, pp. 1-32. Cambridge University Press, 1997.
2. S. Abramsky, R. Jagadesan and P. Malacaria. Full abstraction for PCF. Information amd Computation, 163, 409-470, 2000.
3. Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski and C.-H. Luke Ong. Applying game semantics to compositional software modeling and verification. In Proc. of TACAS, 2004.
4. F. Aloul, A. Ramani, I. Markov and K. Sakallah. PBS: A backtrack search pseudo Boolean solver. In Proceedings of the 5th International Symposium on the Theory and Applications of Satisfiability Testing (SAT '02), pp. 346-353, May 2002.
5. K. Altisen, G. Gossler, A. Pnueli, J. Sifakis, S. Tripakis and S. Yovine. A framework for scheduler synthesis. In RTSS: Real-Time Systems Symposium, pp. 154-163, 1999.
6. R. Alur, L. de Alfaro, T.A. Henzinger and F.Y.C. Mang. Automating modular verification. In CONCUR: Concurrency Theory, pp. 82-97, 1999.
7. R. Alur and T.A. Henzinger. Modularity for timed and hybrid systems. In CONCUR: Concurrency Theory, pp. 74-88, 2001.
8. L.O. Anderson. Program Analysis and Specialization for the C Programming Language. PhD thesis, Datalogisk Intitut, Univ. of Copenhagen, Copenhagen, Denmark, 1994.
9. G. Ausiello and G. F. Italiano. On-line algorithms for polynomially solvable satisfiability problems. Journal of Logic Programming, 10(1):69-90, January 1991.
10. T. Ball, R. Majumdar, T. D. Millstein and S. K. Rajamani. Automatic predicate abstraction of C programs. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (PLDI '01), volume 36(5) of SIGPLAN Notices, pp. 203-213. ACM Press, June 2001.
11. T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. Lecture Notes in Computer Science, 2057, Springer, 2001.
12. BLAST website. http://www-cad.eecs.berkaley.edu/~rupak/blast.
13. J.R. Buchi and L.H. Landweber. Solving sequential conditions by finite-state strategies. Transactions of the AMS, 138, 295-311, 1962.
14. S. Chaki, E. Clarke, A. Groce, S. Jha and H. Veith. Modular verification of software components in C. In Proc. of International Conference on Software Engineering (ICSE), pp. 385-395, IEEE Computer Society Press, 2003.
15. S. Chaki, E. Clarke, A. Groce, S. Jha and H. Veith. Modular verification of software components in C. IEEE Transactions on Software Engineering (TSE), 30, 388-402, 2004.
16. S. Chaki, E. Clarke, A. Groce, J. Ouaknine, O. Strichman and K. Yorav. Efficient verification of sequential and concurrent C programs. Formal Methods in System Design (FMSD), 25, 129-166, 2004.
17. S. Chaki, E. Clarke, A. Groce and O. Strichman. Predicate abstraction with minimum predicates. In Proc. of 12th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME), D. Geist and E. Troci, eds, pp. 19-34. Vol. 2860 of Lecture Notes in Computer Science, Springer-Verlag, 2003.
18. S. Chaki, E. Clarke, O. Grumberg, J. Ouaknine, N. Sharygina, T. Touili and H. Veith. An expressive verification framework for state-event systems. Submitted to Fifth International Conference on Integrated Formal Methods (IFM '05), 29 November-2 December 2005 in Eindhoven, The Netherlands
19. S. Chaki, E. Clarke, J. Ouaknine and N. Sharygina. Automated, compositional and iterative deadlock detection. In Proceedings of the 2nd ACM-IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE'04), pp. 201-210. OMNI Press, June 2004.
20. S. Chaki, E. M. Clarke, J. Ouaknine, N. Sharygina and N. Sinha. State/event-based software model checking. In Proceedings of the 4th International Conference on Integrated Formal Methods (IFM '04), E. A. Boiten, J. Derrick and G. Smith, eds, pp. 128-147. Volume 2999 of Lecture Notes in Computer Science, Springer-Verlag, April 2004.
21. CIL website. http://manju.cs.berkeley.edu/cil.
22. E. Clarke and A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Proceedings of Workshop on Logic of Programs, D. Kozen, ed., pp. 52-71. Volume 131 of Lecture Notes in Computer Science, Springer-Verlag, May 1981.
23. E. Clarke, O. Grumberg, S. Jha, Y. Lu and H. Veith. Counterexample-guided abstraction refinement for symbolic model checking. Journal of the. ACM, 50, 752-794, 2003.
24. E. Clarke, S. Jha, Y. Lu and H. Veith. Tree-like counterexamples in model checking. In Proc. of Logic in Computer Science (LICS), pp. 19-29. IEEE Computer Society, 2002.
25. E. M. Clarke, O. Grumberg and D. E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16, 1512-1542, 1994.
26. E. M. Clarke, O. Grumberg and D. Peled. Model Checking. MIT Press, Cambridge, MA, 2000.
27. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 238-252, Los Angeles, California, 1977. ACM Press, New York, NY.
28. S. Das, D. L. Dill and S. Park. Experience with predicate abstraction. In Proceedings of the 11th International Conference on Computer Aided Verification (CAV '99), N. Halbwachs and D. Peled, eds, pp. 160-171. Volume 1633 of Lecture Notes in Computer Science, Springer-Verlag, July 1999.
29. L. de Alfaro, T.A. Henzinger, and F.Y.C. Mang. Detecting errors before reaching them. In CAV: Computer-Aided Verification, pp. 186-201. Vol. 1855 of Lecture Notes in Computer Science, Springer-Verlag, 2000.
30. W. F. Dowling and J. H. Gallier. Linear time algorithms for testing the satisfiability of propositional horn formula. Journal of Logic Programming, 1, 267-284, 1984.
31. M. B. Dwyer, J. Hatcliff, R. Joehanes, S. Laubach, C. S. Pasareanu, H. Zheng and W. Visser. Tool-supported program abstraction for finite-state verification. In Proceedings of the 23rd International Conference on Software Engineering (ICSE '01), pp. 177-187. IEEE Computer Society Press, May 2001.
32. D. R. Engler, B. Chelf, A. Chou and S. Hallem. Checking system rules using system-specific, programmer-written compiler extensions. In Proceedings of the 4th Symposium on Operating System Design and Implementation (OSDI '00), pp. 1-16, October 2000.
33. ESC-Java. http://www.research.compaq.com/SRC/esc.
34. R. Ghica and G. McCusker. Reasoning about idealized Algol using regular languages. In International Colloquium. and Automata, Languages, and Programming (ICALP), pp. 103-116. Vol 1853 of Lecture Notes in Computer Science, Springer-Verlag, 2000.
35. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Proceedings of the 9th International Conference on Computer Aided Verification (CAV '97), O. Grumberg, ed., pp. 72-83. Vol. 1254 of Lecture Notes in Computer Science, Springer-Verlag, June 1997.
36. S. Hallem, B. Chelf, Y. Xie and D. Engler. A system and language for building system-specific, static analyses. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (PLDI'02), volume 37(5) of SIGPLAN Notices, pp. 69-82. ACM Press, June 2002.
37. T. A. Henzinger, R. Jhala, and R. Majumdar. Counterexample-guided control. In ICALP: 30th International Colloquium on Automata, Languages, and Programming, pp. 886-902. Vol. 2719 of Lecture Notes in Computer Science, Springer-Verlag, 2003.
38. T. A. Henzinger, R. Jhala, R. Majumdar and G. Sutre. Lazy abstraction. In Symposium, on Principles of Programming Languages, pp. 58-70, ACM Press, 2002.
39. Java PathFinder. ase.arc.nasa.gov/visser/jpf.
40. D. Kroening. Application specific higher order logic theorem proving. In Proceedings of the Verification Workshop (VERIFY'02), S. Autexier and H. Mantel, eds, pp. 5-15, July 2002.
41. MAGIC website. http://www.cs.cmu.edu/~chaki/magic.
42. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
43. G. C. Necula, S. McPeak, S. Prakash Rahul and W. Weimer. CIL: Intermediate language and tools for analysis and transformation of C programs. In Proceedings of the 11th International Conference on Compiler Construction (CC '02), R. N. Horspool, ed., pp. 213-228. Volume 2304 of Lecture Notes in Computer Science, Springer-Verlag, April 2002.
44. G. Nelson. Techniques for Program Verification. PhD thesis, Stanford University, 1980.
45. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 179-190. ACM Press, 1989.
46. S.K. Rajamani. New Directions in Refinement Checking. PhD thesis, University of California, Berkeley, 1999.
47. P.J. Ramadge and W.M. Wonham. Supervisory control of a class of discrete-event processes. SIAM Journal of Control and Optimization, 25, 206-230, 1987.
48. S. K. Shukla. Uniform. Approaches to the Verification of Finite State Systems. PhD thesis, State University of New York, Albany, New York, USA, 1997.
49. S. K. Shukla, H. B. Hunt III and D. J. Rosenkrantz. HORNSAT, model checking, verification and games. Technical Report TR-95-8, State University of New York, Albany, 1995.
50. SLAM website. http://research.microsoft.com/slam.
51. C. Stirling. The Joys of Bisimulation. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS '98), L. Brim, J. Gruska, and J. Zlatuska, eds, pp. 142-151. Volume 1450 of Lecture Notes in Computer Science, pp. 142-151. Springer-Verlag, August 1998.
52. Micro-C website. http://www.ucos-ii.com.