Formal Methods for Extensions to CAS

Authors:
Martin Dunstan;Tom Kelsey;Ursula Martin;Steve Linton
Affiliations:
-;-;-;-
Venue:
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Year:
1999

Citing 19
Cited 0

Programming language theory and its implementation

Programming language theory and its implementation
Systematic software development using VDM (2nd ed.)

Systematic software development using VDM (2nd ed.)
Mathematica: a system for doing mathematics by computer (2nd ed.)

Mathematica: a system for doing mathematics by computer (2nd ed.)
An introduction to formal specification and Z

An introduction to formal specification and Z
Larch: languages and tools for formal specification

Larch: languages and tools for formal specification
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
Branch cuts in computer algebra

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Using specialized procedures and specification-based analysis to reduce the runtime costs of modularity

SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Theorems and algorithms: an interface between Isabelle and Maple

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Enhancing the NUPRL proof development system and applying it to computational abstract algebra

Enhancing the NUPRL proof development system and applying it to computational abstract algebra
REDLOG: computer algebra meets computer logic

ACM SIGSAM Bulletin
Lightweight formal methods for computer algebra systems

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Object-Oriented Software Construction

Object-Oriented Software Construction
Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation

Journal of Automated Reasoning
Formal Verification of Ada Programs

Proceedings of the first First International Workshop on Larch
Thoughts on a Larch/ML and a New Application for LP

Proceedings of the first First International Workshop on Larch
Preliminary Design of Larch/C++

Proceedings of the first First International Workshop on Larch
Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals

HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
A TWO-TIERED APPROACH TO SPECIFYING PROGRAMS

A TWO-TIERED APPROACH TO SPECIFYING PROGRAMS

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate the use of formal methods tools to provide a semantics for the type hierarchy of the AXIOM computer algebra system, and a methodology for Aldor program analysis and verification. We give a case study of abstract specifications of AXIOM primitives, and provide an interface between these abstractions and Aldor code.