The PROSPER toolkit

International Journal on Software Tools for Technology Transfer

Volumn 4, Issue 2, 2003, Pages 189-210

  Dennis, Louise A ^a   Collins, Graham ^b   Norrish, Michael ^c   Boulton, Richard J ^b   Slind, Konrad ^c   Melham, Thomas F ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Formal verification; Proof engine; Theorem proving; Tool integration

Indexed keywords

DESIGN ENVIRONMENT; FORMAL VERIFICATIONS; SOFTWARE TOOLKITS; TOOL INTEGRATION; VERIFICATION TOOLS;

THEOREM PROVING;

TOOLS;

EID: 84896692762     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090200076     Document Type: Article

References (74)

1. Aagaard, M.D., Jones, R.B., Seger, C.-J.H.: Lifted-FL: a pragmatic implementation of combined model checking and theorem proving. In: Bertot et al., 12, pp. 323-340
2. Agerholm, S., Skjødt, H.: Automating a model checker for recursive modal assertions in HOL. Technical Report DAIMI IR-92, Computer Science Department, Aarhus University, 1990.
3. Ahrendt, W., Baar, T., Beckert, B., Giese, M., Habermalz, E., Hähnle, R., Menzel, W., Schmitt, P.H.: The KeY approach: integrating object oriented design and formal verification. In: Ojeda-Aciego, M., de Guzmán, I.P., Brewka, G., Pereira, L.M. (eds) Proc. 8th European Workshop on Logics in AI (JELIA), Lecture Notes in Computer Science, vol. 1919. Springer, Berlin Heidelberg New York, 2000, pp. 21-36.
4. Ahrendt, W., Beckert, B., Hähnle, R., Menzel, W., Reif, W., Schellhorn, G., Schmitt, P.: Integrating automated and interactive theorem proving. In: Bibel, W., Schmitt, P.H. (eds) Automated deduction - a basis for applications, Volume II: systems and implementation techniques. Kluwer, Dordrecht, The Netherlands, 1998.
5. Armando, A., Kohlhase, M., Ranise, S.: Communication protocols for mathematical services based on KQML and OMRS. In: Kerber and Kohlhase [47]
6. Armando, A., Zini, D.: Interfacing computer algebra and deduction systems via the Logic Broker Architecture. In: Kerber and Kohlhase 47
7. Barrett, C., Dill, D., Levitt, J.: Validity checking for combinations of theories with equality. In: Srivas and Camilleri 66, pp. 187-201
8. Bensalem, S., Lakhnech, Y., Owre, S.: InVeSt: A tool for the verification of invariants. In: Hu, A.J., Vardi, M.Y. (eds) Proc. 10th International Conference on Computer Aided Verification (CAV'98), Lecture Notes in Computer Science, vol. 1427. Springer, Berlin Heidelberg New York, 1998, pp. 505-510.
9. Bensalem, S., Ganesh, V., Lakhnech, Y., Munoz, C., Owre, S., Ruess, H., Rushby, J., Rusu, V., Säidi, H., Shankar, N., Singerman, E., Tiwari, A.: An overview of SAL. In: Proc. 5th NASA Langley Formal Methods Workshop, Williamsburg, VA, USA, June 2000.
10. Benzmüller, C., Sorge, V.: Ω-Ants - An open approach at combining interactive and automated theorem proving. In: Kerber and Kohlhase 47
11. Bertot, Y.: The CtCoq system: design and architecture. Formal Aspects Comput 11:225-243, 1999.
12. Bertot, Y., Dowek, G., Hirshowitz, A., Paulin, C., Théry, L. (eds): Proc. 12th International Conference on Theorem Proving in Higher Order Logics, Lecture Notes in Computer Science, vol. 1690. Springer, Berlin Heidelberg New York, 1999.
13. Boulton, R.J.: A tool to support formal reasoning about computer languages. In: Brinksma E. (ed) Proc. 3rd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'97), Lecture Notes in Computer Science, vol. 1217. Springer, Berlin Heidelberg New York, 1997, pp. 81-95.
14. Boulton, R.J.: Generating embeddings from denotational descriptions. In: Grundy and Newey 40, pp. 67-86
15. Boulton, R.J.: Prosper Integration Interface implementor's guide. ESPRIT LTR Project Prosper (26241), part of deliverable D3.5, Department of Computing Science, University of Glasgow, 17 Lilybank Gardens, Glasgow, G12. 8QQ, UK, April 2001.
16. Boulton, R., Gordon, A., Gordon, M., Harrison, J., Herbert, J., Van Tassel, J.: Experience with embedding hardware description languages in HOL. In: Stavridou, V., Melham, T.F., Boute, R.T. (eds) Proc. IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience, IFIP Transactions volume A-10, pp. 129-156, North-Holland/Elsevier, The Netherlands, 1992.
17. Boulton, R., Slind, K., Bundy, A., Gordon, M.: An interface between CLAM and HOL. In: Grundy and Newey 40, pp. 87-104
18. Bowen, J., Gordon, M.: A shallow embedding of Z in HOL. Information Software Technol 37:269-276, 1995.
19. Braun, P., Lötzbeyer, H., Schätz, B., Slotosch, O.: Consistent integration of formal methods. In: Graf and Schwartzbach 39, pp. 48-62
20. Bundy, A., van Harmelen, F., Horn, C., Smaill, A.: The Oyster-Clam system. In: Stickel, M.E. (ed) Proc. 10th International Conference on Automated Deduction, Lecture Notes in Computer Science, vol. 449. Springer, Berlin Heidelberg New York, 1990, pp. 647-648.
21. Church, A.: A formulation of the simple theory of types. J Symbol Logic 5:56-68, 1940.
22. Cimatti, A., Clarke, E.M., Giunchiglia, F., Roveri, M.: NuSMV: a new Symbolic Model Verifier. In: Halbwachs, N., Peled, D. (eds) Proc. 11th Conference on Computer- Aided Verification (CAV'99), Lecture Notes in Computer Science, vol. 1633. Springer, Berlin Heidelberg New York, 1999, pp. 495-499.
23. Coglio, A.: The control component of OMRS: NQTHM as a case study. Extended abstract in Proc. 1st Workshop on Abstraction, Analogy and Metareasoning, IRST, Trento, Italy, 1996, pp. 65-71.
24. Collins, G., Dennis, L.A.: System description: embedding verification into Microsoft Excel. In: McAllester [50, pp. 497-501]
25. Dahn, B.I., Gehne, J., Honigmann, T., Wolf, A.: Integration of automated and interactive theorem proving in ILF. In: McCune, W. (ed) Proc. 14th International Conference on Automated Deduction (CADE-14), Lecture Notes in Artificial Intelligence, vol. 1249. Springer, Berlin Heidelberg New York, 1997, pp. 57-60.
26. Dennis, L.A., Collins, G., Norrish, M., Boulton, R., Slind, K., Robinson, G., Gordon, M., Melham, T.: The Prosper toolkit. In: Graf and Schwartzbach 39, pp. 78-92
27. Dennis, L., Collins, G., Boulton, R., Robinson, G., Norrish, M., Slind, K.: The Prosper toolkit version 1.4. ESPRIT LTR Project Prosper (26241), part of deliverable D3.5, Department of Computing Science, University of Glasgow, 17 Lilybank Gardens, Glasgow, G12. 8QQ, UK, April 2001. http://www.dcs.gla.ac.uk/prosper/toolkit/ prosper1-4.ps.gz
28. Detlefs, D.L., Leino, K.R.M., Nelson, G., Saxe, J.B.: Extended static checking. Research Report 159, Compaq Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, USA, December 1998.
29. Fitzgerald, J., Larsen, P.G.: Modelling systems: practical tools and techniques in software development. Cambridge University, Cambridge, UK, 1998.
30. Franke, A., Hess, S.M., Jung, C.G., Kohlhase, M., Sorge, V.: Agent-oriented integration of distributed mathematical services. J Univers Comput Sci 5:156-187, 1999.
31. Franke, A., Kohlhase, M.: System description: MBase, an open mathematical knowledge base. In: McAllester 50, pp. 455-459
32. Fuchs, D., Denzinger, J.: Knowledge-based cooperation between theorem provers by TECHS. SEKI-Report SR-97-11, University of Kaiserslautern, 1997.
33. Giunchiglia, F., Pecchiari, P., Talcott, C.: Reasoning theories: towards an architecture for open mechanized reasoning systems. In: Baader, F., Schulz, K.U. (eds) Proc. 1st International Workshop on Frontiers of Combining Systems (Fro- CoS'96), Applied Logic Series, pp. 157-174, Kluwer, Dordrecht, The Netherlands, 1996.
34. Goguen, J.A., Luqi: Formal methods and social context in software development. In: Proc. TAPSOFT'95, Lecture Notes in Computer Science, vol. 915. Springer, Berlin Heidelberg New York, 1995, pp. 62-81.
35. Gordon, M.J.C.: Mechanizing programming logics in Higher Order Logic. In: Birtwistle, G., Subrahmanyam, P.A. (eds) Current Trends in Hardware Verification and Automated Theorem Proving, pp. 387-439, Springer, Berlin Heidelberg New York, 1989. Also available as University of Cambridge Computer Laboratory Technical Report 145.
36. Gordon, M.J., Milner, A.J., Wadsworth, C.P.: In: Edinburgh LCF: a mechanised logic of computation, Lecture Notes in Computer Science, vol. 78. Springer, Berlin Heidelberg New York, 1979.
37. Gordon, M.J.C., Melham, T.F. (eds): Introduction to HOL: a theorem proving environment for Higher Order Logic. Cambridge University, Cambridge, UK, 1993.
38. Gordon, M., Larsen, K.F.: Combining the Hol98 proof assistant with the BuDDy BDD package, Technical Report 481, University of Cambridge Computer Laboratory, December 1999.
39. Graf, S., Schwartzbach, M. (eds): Proc. 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2000), Lecture Notes in Computer Science, vol. 1785. Springer, Berlin Heidelberg New York, 2000.
40. Grundy, J., Newey, M. (eds): Proc. 11th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'98), Lecture Notes in Computer Science, vol. 1479. Springer, Berlin Heidelberg New York, 1998.
41. Harrison, J.: Theorem proving with the real numbers. Distinguished Dissertation Series, Springer, Berlin Heidelberg New York, 1998.
42. Hoffmann, D.W., Kropf, T.: Automatic error correction of large circuits using Boolean decomposition and abstraction. In: Pierre, L., Kropf, T. (eds) Proc. 10th IFIP WG10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'99), Lecture Notes in Computer Science, vol. 1703. Springer, Berlin Heidelberg New York, 1999.
43. Holt, A., Klein, E., Grover, C.: Natural language specifications for hardware verification. Special issue on ICoS-1. Language Computat 1:275-282, 2000.
44. Hurd, J.: Integrating Gandalf and HOL. In: Bertot et al. 12, pp. 311-321
45. Joyce, J., Seger, C.-J.: Linking BDD based symbolic evaluation to interactive theorem proving. In: Proc. ACM/IEEE Design Automation Conference, June 1993.
46. Kaufmann, M., Manolios, P., Moore, J: Computer-aided reasoning: an approach. Advances in Formal Methods series, vol.3. Kluwer, Dordrecht, The Netherlands, 2000.
47. Kerber, M., Kohlhase, M. (eds): Symbolic computation and automated reasoning: the CALCULEMUS-2000 symposium. Proc. 8th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, St Andrews, Scotland, August 2000. AK Peters, Natick, Mass, USA, 2001.
48. Krieg-Brückner, B., Peleska, J., Olderog, E.-R., Baer, A.: The UniForM WorkBench, a universal development environment for formal methods. In: Wing, J.M., Woodcock, J., Davies J. (eds) FM'99 - Formal Methods, vol.2, Lecture Notes in Computer Science, vol. 1709. Springer, Berlin Heidelberg New York, 1999, pp. 1186-1205.
49. Levitt, J.R.: Formal verification techniques for digital systems. PhD Thesis, Stanford University, December 1998.
50. McAllester, D. (ed): Proc. 17th International Conference on Automated Deduction (CADE-17), Lecture Notes in Computer Science, vol. 1831. Springer, Berlin Heidelberg New York, 2000.
51. McMillan, K.L.: Symbolic model checking. Kluwer, Dordrecht, The Netherlands, 1993.
52. Melham, T.F.: A mechanized theory of the π-calculus in HOL. Nordic J Comput 1:50-76, 1994.
53. Microsoft Corporation: Microsoft Excel. http://www.microsoft.com/excel
54. Milner, R., Tofte, M., Harper, R., MacQueen, D.: The definition of Standard ML (revised). MIT, Boston, Mass., USA, 1997.
55. Nipkow, T.: Embedding programming languages in theorem provers (abstract). In: Ganzinger, H. (ed) Proc. 16th International Conference on Automated Deduction (CADE-16), Lecture Notes in Artificial Intelligence, vol. 1632. Springer, Berlin Heidelberg New York, 1999, p. 398.
56. Object Management Group: The Common Object Request Broker: architecture and specification. Technical Report, OMG, July 1995.
57. O'Leary, J., Zhao, X., Gerth, R., Seger, C.-J.H.: Formally verifying IEEE compliance of floating-point hardware. Intel Technol J (1st Quarter, 1999). Online at: http://developer.intel.com/technology/itj/
58. Paulson, L.C.: Isabelle: a generic theorem prover. Lecture Notes in Computer Science, vol. 828. Springer, Berlin Heidelberg New York, 1994.
59. Rajan, S., Shankar, N., Srivas, M.: An integration of model checking and automated proof checking. In: Proc. International Conference on Computer-Aided Verification, Lecture Notes in Computer Science, vol. 939. Springer, Berlin Heidelberg New York, 1995, pp. 84-97.
60. Reetz, R.: Deep embedding VHDL. In: Schubert, E.T., Windley, P.J., Alves-Foss J. (eds) Proc. 8th International Workshop on Higher Order Logics Theorem Proving and Its Applications, Lecture Notes in Computer Science, vol. 971. Springer, Berlin Heidelberg New York, 1995, pp. 277-292.
61. Reetz, R., Kropf, T.: Simplifying deep embedding: a formalised code generator. In: Melham, T.F., Camilleri J. (eds) Proc. 7th International Workshop on Higher Order Logics Theorem Proving and Its Applications, Lecture Notes in Computer Science, vol. 859. Springer, Berlin Heidelberg New York, 1994, pp. 378-390.
62. Seger, C.-J.H., Bryant, R.E.: Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Methods Syst Design 6:147-189, 1995.
63. Shankar, N.: PVS: combining specification, proof checking, model checking. In: Srivas and Camilleri 66, pp. 257-264
64. Shankar, N.: Using decision procedures with a higher-order logic. In: Boulton, R.J., Jackson P.B. (eds) Proc. 14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2001), Lecture Notes in Computer Science, vol. 2152. Springer, Berlin Heidelberg New York, 2001, pp. 5-26.
65. Sheeran, M., Stålmarck, G.: A tutorial on St °almarck's proof procedure for propositional logic. Formal Methods Syst Design 16(1):23-58, 2000.
66. Srivas, M., Camilleri, A. (eds): Proc. 1st International Conference on Formal Methods in Computer-Aided Design (FMCAD' 96), Lecture Notes in Computer Science, vol. 1166. Springer, Berlin Heidelberg New York, 1996.
67. Stalmarck, G., Säflund, M.: Modelling and verifying systems and software in propositional logic. In: Proc. SAFECOMP'90, Pergamon, 1990, pp. 31-36.
68. Staples, M.: Linking ACL2 and HOL. Technical Report 476, University of Cambridge Computer Laboratory, 1999.
69. Steffen, B., Margaria, T., Braun, V.: The Electronic Tool Integration Platform: concepts and design. Int J Software Tools Technol Transfer 1:9-30, 1997.
70. Stevenson, A., Dennis, L.A.: Integrating SVC and HOL with the Prosper Toolkit. In: Supplemental Proc. 13th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2000), pp. 199-206. OGI Technical Report CSE 00- 009, Oregon Graduate Institute, Portland, Ore., USA, August 2000.
71. Suppes, P.: Axiomatic set theory. Van Nostrand, New York, 1960.
72. SVC Home Page: The Stanford Validity Checker. http://verify.stanford.edu/SVC
73. Tammet, T.: A resolution theorem prover for intuitionistic logic. In: Proc. 13th International Conference on Automated Deduction, Lecture Notes in Computer Science, vol. 1104. Springer, Berlin Heidelberg New York, 1996, pp. 2-16.
74. Wong, W., Németh, L.: A new proof format for linking theorem provers. In: Supplemental Proc. 13th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2000), pp. 231-235. OGI Technical Report CSE 00- 009, Oregon Graduate Institute, Portland, Ore., USA, August 2000