Formal methods for extensions to CAS

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

Volumn 1709, Issue , 1999, Pages 1758-1777

  Dunstan, Martin N ^a   Kelsey, Tom ^a   Martin, Ursula ^a   Linton, Steve ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; SEMANTICS;

ABSTRACT SPECIFICATIONS; ALGEBRA SYSTEMS; FORMAL METHODS TOOLS; PROGRAM ANALYSIS; TYPE HIERARCHIES;

FORMAL METHODS;

EID: 84949486847     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48118-4_43     Document Type: Conference Paper

References (32)

1. Ballarin, C., Homann, K., and Calmet, J. Theorems and algorithms: An interface between Isabelle and Maple. In Proceedings of International Symposium on Symbolic and Algebraic Computation (1995), A.H.M.Levelt, Ed., ACM Press, pp. 150-157.
2. Bauer, A., Clarke, E., and Zhao, X. Analytica—an experiment in combining theorem proving and symbolic computation. J. Automat. Reason. 21, 3 (1998), 295-325.
3. Buchberger, B. Symbolic computation: computer algebra and logic. In Frontiers of combining systems (Munich, 1996). Kluwer Acad. Publ., Dordrecht, 1996, pp. 193-219.
4. Char, B. W. Maple V language Reference Manual. Springer-Verlag, 1991.
5. Cheon, Y., and Leavens, G. T. A gentle introduction to Larch/Smalltalk specification browsers. Tech. Rep. TR 94-01, Department of Computer Science, Iowa State University, 226 Atanasoff Hall, Ames, Iowa 50011-1040, USA, Jan. 1994.
6. Detlefs, D. L. An overview of the Extended Static Checking system. In Proceedings of The First Workshop on Formal Methods in Software Practice (Jan 1996), ACM (SIGSOFT), pp. 1-9.
7. Dingle, A., and Fateman, R. J. Branch cuts in computer algebra. In Symbolic and Algebraic Computation (1994), ISSAC, ACM Press.
8. Dolzmann, A., and Sturm, T. REDLOG: Computer algebra meets computer logic. ACM SIGSAM Bulletin 31, 2 (June 1997), 2-9.
9. Dunstan, M., Kelsey, T., Linton, S., and Martin, U. Lightweight formal methods for computer algebra systems. In ISSAC (1998).
10. Evans, D. Using specifications to check source code. Master’s thesis, Department of Electrical Engineering and Computer Science, MIT Lab. for Computer Science, 545 Technology Square, Cambridge, MA 02139, June 1994.
11. Feit, W., AND Thompson, J. G. Solvability of groups of odd order. Pacific Journal of Mathematics 13 (1963), 775-1029.
12. The GAP Group. GAP - Groups, Algorithms, and Programming, Version 4. Aachen, St Andrews, 1998. (http://www-gap.dcs.st-and.ac.uk/~gap).
13. Gordon, M. J. C. Programming language theory and its implementation. Series in Computer Science. Prentice Hall International, 1988.
14. Gordon, M. J. C., and Melham, T. F., Eds. Introduction to HOL. Cambridge University Press, Cambridge, 1993. A theorem proving environment for higher order logic, Appendix B by R. J. Boulton.
15. Guaspari, D., Marceau, C., AND Polak, W. Formal verification of Ada programs. In First International Workshop on Larch (July 1992), U. Martin and J. Wing, Eds., Springer-Verlag, pp. 104-141.
16. Guttag, J. V., AND Horning, J. J. Larch: Languages and Tools for Formal Specification, first ed. Texts and Monograps in Computer Science. Springer-Verlag, 1993.
17. Harrison, J., and Thery, L. Extending the HOL theorem prover with a computer algebra system to reason about the reals. In Higher order logic theorem proving and its applications (Vancouver, BC, 1993). Springer, Berlin, 1994, pp. 174-184.
18. Jackson, P. Enhancing the NUPRL Proof Development System and Applying it to Computational Abstract Algebra. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, Apr. 1995.
19. Jenks, R. D., AND Sutor, R. S. AXIOM. Numerical Algorithms Group Ltd., Oxford, 1992. The scientific computation system, With a foreword by David V. Chudnovsky and Gregory V. Chudnovsky.
20. Jones, C. B. Systematic Software Development using VDM, second ed. Computer Science. Prentice Hall International, 1990.
21. Jones, k. D. LM3: a Larch interface language for Modula-3, a definition and introduction. Tech. Rep. 72, SRC, Digital Equipment Corporation, Palo Alto, California, June 1991.
22. King, D. J., and Arthan, R. D. Development of practical verification tools. The ICL Systems Journal 1 (May 1996).
23. Leavens, G. T., AND Cheon, Y. Preliminary design of Larch/C++. In First International Workshop on Larch (July 1992), U. Martin and J. M. Wing, Eds., Workshops in Computing, Springer-Verlag, pp. 159-184.
24. Meyer, B. Object-Oriented Software Construction. Computer Science. Prentice Hall International, 1988.
25. Owre, S., Shankar, N., and Rüshby, J. M. User Guide for the PVS Specification and Verification System. Computer Science Laboratory, SRI International, Menlo Park, CA, Feb. 1993.
26. Poll, E., and Thompson, S. Adding the axioms to Axiom: Towards a system of automated reasoning in aldor. Technical Report 6-98, Computing Laboratory, University of Kent, May 1998.
27. Potter, B., Sinclair, J., and Till, D. An introduction to formal specification and Z. Prentice Hall International, 1991.
28. Sannella, D. Formal program development in Extended ML for the working programmer. In Proceedings of the 3rd BCS/FACS Workshop on Refinement (1990), Springer Workshops in Computing, pp. 99-130.
29. Vandevoorde, M. T., AND Guttag, J. V. Using specialized procedures and specification-based analysis to reduce the runtime costs of modularity. In Proceedings of the 1994 ACM/SIGSOFT Foundations of Software Engineering Conference (1994).
30. Wing, J. m. A two-tiered approach to specifying programs. Tech. Rep. LCS/TR- 299, Laboratory for Computer Science, MIT, May 1983.
31. Wing, J. M., Rollins, E., and Zaremski, A. M. Thoughts on aLarch/ML and a new application for TP. In First International Workshop on Larch (July 1992), U. Martin and J. M. Wing, Eds., Workshops in Computing, Springer-Verlag, pp. 297-312.
32. Wolfram, s. Mathematica: A system for doing mathematics by computer, 2 ed. Addison Wesley, 1991.