Harnessing disruptive innovation in formal verification

Proceedings - 4th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2006

Volumn , Issue , 2006, Pages 21-30

  Rushby, John ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED THEOREM PROVING; DISRUPTIVE INNOVATIONS; FORMAL VERIFICATIONS; INTERACTIVE THEOREM PROVING; IS DEVELOPMENT; LOOSELY COUPLED ARCHITECTURES; SINGLE COMPONENTS; TECHNOLOGICAL INNOVATION;

MODEL CHECKING; PROBLEM SOLVING; THEOREM PROVING;

FORMAL METHODS;

EID: 34547229860     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2006.24     Document Type: Conference Paper

References (50)

1. R. Alur and D. Peled, editors. Computer-Aided Verification, CAV '2004, volume 3114 of Lecture Notes in Computer Science, Boston, MA, July 2004.
2. N. Amla, X. Du, A. Kuehlmann, R. P. Kurshan, and K. L. McMillan. An analysis of SAT-based model checking techniques in an industrial environment. In D. Borrione and W. Paul, editors, Correct Hardware Design and Verification Methods: 13th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2005, volume 3725 of Lecture Notes in Computer Science, pages 254-268, Saarbrücken, Germany, Oct. 2005.
3. *IA-TABOO Joint Workshop from Objects to Agents: Evolutive Trends of Software Systems, pages 70-75, Parma, Italy, May 2000. Pitagora Editrice Bologna.
4. C. Barrett, L. de Moura, and A. Stump. SMT-COMP: Satisfiability modulo theories competition. In K. Etessami and S. K. Rajamani, editors, Computer-Aided Verification, CAV '2005, volume 3576 of Lecture Notes in Computer Science, pages 20-23, Edinburgh, Scotland, July 2005. (Pubitemid 41431717)
5. J. Berdine, C. Calcagno, and P. W. O'Hearn. Symbolic execution with separation logic. In K. Yi, editor, Programming Languages and Systems: Third Asian Symposium, APLAS, number 3780 in Lecture Notes in Computer Science, pages 52-68, Tsukuba, Japan, 2005.
6. Y. Bertot and P. Castéran. Interactive Theorem Proving and Program Development. Springer, 2004. Coq home page: http://coq.inria.fr/.
7. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In W. R. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems (TACAS '99), volume 1579 of Lecture Notes in Computer Science, pages 193-207, Amsterdam, The Netherlands, Mar. 1999.
8. A. Cheyer and D. Martin. The open agent architecture. Autonomous Agents and Multi-Agent Systems, 4(1-2):143-148, Mar. 2001.
9. C. M. Christensen. The Innovator's Dilemma. Harvard Business School Press, 1997.
10. C. M. Christensen. The Innovator's Solution. Harvard Business School Press, 2003.
11. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Emerson and Sistla [23], pages 154-169.
12. R. L. Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, Englewood Cliffs, NJ, 1986. Nuprl home page: http://www.cs.cornell.edu/Info/Projects/NuPRL/.
13. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, CA, Jan. 1977. Association for Computing Machinery.
14. L. de Moura, S. Owre, H. Rueß, J. Rushby, and N. Shankar. The ICS decision procedures for embedded deduction. In D. Basin and M. Rusinowitch, editors, 2nd International Joint Conference on Automated Reasoning (IJCAR), volume 3097 of Lecture Notes in Computer Science, pages 218-222, Cork, Ireland, July 2004. (Pubitemid 38939972)
15. L. de Moura, S. Owre, H. Rueß, J. Rushby, and N. Shankar. Integrating verification components. In Shankar [48].
16. L. de Moura, S. Owre, H. Rueß, J. Rushby, N. Shankar, M. Sorea, and A. Tiwari. SAL 2. In Alur and Peled [1], pages 496-500. SAL home page: http://sal.csl.sri.com/.
17. L. de Moura and H. Rueß. An experimental evaluation of ground decision procedures. In Alur and Peled [1], pages 162-174.
18. L. de Moura, H. Rueß, and M. Sorea. Lazy theorem proving for bounded model checking over infinite domains. In A. Voronkov, editor, 18th International Conference on Automated Deduction (CADE), volume 2392 of Lecture Notes in Computer Science, pages 438-455, Copenhagen, Denmark, July 2002.
19. L. de Moura, H. Rueß, and M. Sorea. Bounded model checking and induction: From refutation to verification. In W. A. Hunt, Jr. and F. Somenzi, editors, Computer-Aided Verification, CAV '2003, volume 2725 of Lecture Notes in Computer Science, pages 14-26, Boulder, CO, July 2003.
20. L. A. Dennis, G. Collins, M. Norrish, R. Boulton, K. Slind, G. Robinson, M. Gordon, and T. Melham. The PROSPER toolkit. In S. Graf and M. Schwartzbach, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2000), volume 1785 of Lecture Notes in Computer Science, pages 78-92, Berlin, Germany, Mar. 2000.
21. D. L. Dill. The Murφ verification system. In R. Alur and T. A. Henzinger, editors, Computer-Aided Verification, CAV '96, volume 1102 of Lecture Notes in Computer Science, pages 390-393, New Brunswick, NJ, July/Aug. 1996.
22. B. Dutertre and M. Sorea. Modeling and verification of a fault-tolerant real-time startup protocol using calendar automata. In Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 3253 of Lecture Notes in Computer Science, Grenoble, France, Sept. 2004.
23. E. A. Emerson and A. P. Sistla, editors. Computer-Aided Verification, CAV '2000, volume 1855 of Lecture Notes in Computer Science, Chicago, IL, July 2000.
24. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. IEEE Transactions on Software Engineering, 27(2):99-123, Feb. 2001. Daikon home page: http://pag.csail.mit.edu/daikon. (Pubitemid 32254259)
25. A. Franke and M. Kohlhase. MATHWEB, an agent-based communication layer for distributed automated theorem proving. In 16th International Conference on Automated Deduction (CADE), volume 1632 of Lecture Notes in Artificial Intelligence, pages 217-221, Trento, Italy, July 1999.
26. D. Gelernter and N. Carriero. Coordination languages and their significance. Commun. ACM, 35(2):97-102, Feb. 1992.
27. D. I. Good. Toward a Man-Machine System for Proving Program Correctness. PhD thesis, University of Wisconsin, 1970.
28. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A Theorem Proving Environment for HigherOrder Logic. Cambridge University Press, Cambridge, UK, 1993. HOL home page: http://www.cl.cam.ac.uk/Research/HVG/HOL/.
29. J. Harrison. HOL Light: A tutorial introduction. In M. Srivas and A. Camilleri, editors, Formal Methods in Computer-Aided Design (FMCAD '96), volume 1166 of Lecture Notes in Computer Science, pages 265-269, Palo Alto, CA, Nov. 1996. HOL Light home page: http://www.cl.cam.ac.uk/~jrh13/hol-light/index.html. (Pubitemid 126149763)
30. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Software verification with BLAST. In Proceedings of the Tenth International Workshop on Model Checking of Software (SPIN), volume 2648 of Lecture Notes in Computer Science, pages 235-239. May 2003. BLAST home page: http://embedded.eecs. berkeley.edu/blast/. (Pubitemid 137635189)
31. T. Hoare. The verifying compiler: A grand challenge for computing research. J. ACM, 50(1):63-69, 2003.
32. G. J. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, 2003. SPIN home page: http://spinroot.com/.
33. C. Jones, P. O'Hearn, and J. Woodcock. Verified software: A grand challenge. IEEE Computer, 39(4):93-95, Apr. 2006.
34. M. Kaufmann and J. S. Moore. An industrial strength theorem prover for a logic based on Common Lisp. IEEE Transactions on Software Engineering, 23(4):203-213, Apr. 1997. ACL2 home page: http://www.cs.utexas.edu/users/moore/ acl2/. (Pubitemid 127828288)
35. J. C. King. A Program Verifier. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, 1969.
36. S. Lahiri, R. Nieuwenhuis, and A. Oliveras. SMT techniques for predicate abstraction. In Computer-Aided Verification, CAV '2006, Lecture Notes in Computer Science, Seattle, WA, 2006. To appear.
37. K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2):134-152, Oct. 1997. Uppaal home page: http://www.uppaal.com.
38. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, MA, 1993.
39. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference, pages 530-535, Las Vegas, NV, June 2001. (Pubitemid 32841010)
40. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Springer, 2002. Isabelle home page: http://isabelle.in. tum.de/.
41. B. Oki, M. Pfluegl, A. Siegel, and D. Skeen. The Information Bus - an architecture for extensible distributed systems. In Fourteenth ACM Symposium on Operating System Principles, pages 58-68, Asheville, NC, Dec. 1993. (ACM Operating Systems Review, Vol. 27, No. 5).
42. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, Feb. 1995. PVS home page: http://pvs.csl.sri.com.
43. L. Pike and G. M. Brown. Easy parameterized verification of biphase mark and 8N1 decoders. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS '06), number 3920 in Lecture Notes in Computer Science, pages 58-72, Vienna, Austria, Apr. 2006. (Pubitemid 44019362)
44. J. Rushby. Verification diagrams revisited: Disjunctive invariants for easy verification. In Emerson and Sistla [23], pages 508-520.
45. V. Rusu and E. Singerman. On proving safety properties by integrating static analysis, theorem proving and abstraction. In W. R. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems (TACAS '99), volume 1579 of Lecture Notes in Computer Science, pages 178-192, Amsterdam, The Netherlands, Mar. 1999.
46. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Trans. Prog. Lang. Syst., 24(3):217-298, May 2002.
47. H. Saïdi and S. Graf. Construction of abstract state graphs with PVS. In O. Grumberg, editor, Computer-Aided Verification, CAV '97, volume 1254 of Lecture Notes in Computer Science, pages 72-83, Haifa, Israel, June 1997. (Pubitemid 127088966)
48. N. Shankar, editor. IFIP Working Conference on Verified Software: Theories, Tools, and Experiments, Zurich, Switzerland, Oct. 2005. Available at http://vstte.inf.ethz.ch/papers.html.
49. M. Sheeran, S. Singh, and G. Stålmarck. Checking safety properties using induction and a SAT-solver. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer-Aided Design (FMCAD 2000), volume 1954 of Lecture Notes in Computer Science, pages 108-125, Austin, TX, Nov. 2000.
50. A. Tiwari. Abstractions for Hybrid Systems. Computer Science Laboratory, SRI International, Menlo Park, CA, 2004. Combines several conference papers: available at http://www.csl.sri.com/~tiwari/new.pdf.