Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
Larch: languages and tools for formal specification
Larch: languages and tools for formal specification
Lightweight formal methods for computer algebra systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
The Haskell school of expression: learning functional programming through multimedia
The Haskell school of expression: learning functional programming through multimedia
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Journal of Symbolic Computation
Static type inference for Ruby
Proceedings of the 2009 ACM symposium on Applied Computing
The spec# programming system: an overview
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
A Survey of Automated Techniques for Formal Software Verification
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On formal specification of maple programs
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
On formal specification of maple programs
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
A verification framework for minimaple programs
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
In this paper, we present our ongoing work and initial results on the formal specification and verification of MiniMaple (a substantial subset of Maple with slight extensions) programs. The main goal of our work is to find behavioral errors in such programs w.r.t. their specifications by static analysis. This task is more complex for widely used computer algebra languages like Maple as these are fundamentally different from classical languages: they support non-standard types of objects such as symbols, unevaluated expressions and polynomials and require abstract computer algebraic concepts and objects such as rings and orderings etc. As a starting point we have defined and formalized a syntax, semantics, type system and specification language for MiniMaple.