A semi-algorithm for algebraic implementation proofs
From MaRDI portal
Recommendations
Cites work
- Algebraic implementation of abstract data types
- Algebraic implementations preserve program correctness
- An overview of LP, the Larch Prover
- Context induction: A proof principle for behavioural abstractions and algebraic implementations
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 3956411 (Why is no real title available?)
- scientific article; zbMATH DE number 4112064 (Why is no real title available?)
- scientific article; zbMATH DE number 3784848 (Why is no real title available?)
- scientific article; zbMATH DE number 4113952 (Why is no real title available?)
- Observational implementation of algebraic specifications
- On the algebraic definition of programming languages
- Proving Properties of Programs by Structural Induction
Cited in
(8)- Context induction: A proof principle for behavioural abstractions and algebraic implementations
- scientific article; zbMATH DE number 8763 (Why is no real title available?)
- scientific article; zbMATH DE number 844104 (Why is no real title available?)
- Observational implementations
- scientific article; zbMATH DE number 6403889 (Why is no real title available?)
- Semialgebraic Proofs and Efficient Algorithm Design
- The Alf proof editor and its proof engine
- Observational implementation of algebraic specifications
This page was built for publication: A semi-algorithm for algebraic implementation proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199928)