Computing properties of numerical imperative programs by symbolic computation

MaRDI QIDQ5431916zbMATH OpenFDO

Authors Jacques Carette, Ryszard Janicki

Publication date 2 January 2008

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Symbolic computation and algebraic computation (68W30)

Recommendations

• Polynomial approximations of the relational semantics of imperative programs
• Derivations of identities by symbolic computation
• scientific article; zbMATH DE number 4078794
• Lazy Relations
• Combining relational calculus and the Dijkstra-Gries method for deriving relational programs

Cited in

(4)

• Convergence: integrating termination and abort-freedom
• Abstract Semantic Differencing for Numerical Programs
• Mathemagix: Towards Large Scale Programming for Symbolic and Certified Numeric Computations
• Reflexive transitive invariant relations: A basis for computing loop functions

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Computing properties of numerical imperative programs by symbolic computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5431916)