Proving the equivalence of CLP programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1140685
- CLP(χ) for automatically proving program properties1An earlier version of this paper was presented at the workshop “Frontiers of Combining Systems”, Munich, March 1996.1
- A language-independent proof system for full program equivalence
- Equivalences among logics of programs
- Program equivalence is coinductive
- Equivalence of propositional Prolog programs
- The equivalence problem and correctness formulas for a simple class of programs
- scientific article; zbMATH DE number 3883587
- scientific article; zbMATH DE number 826301
Cited in
(11)- Executing and verifying higher-order functional-imperative programs in Maude
- scientific article; zbMATH DE number 3883587 (Why is no real title available?)
- scientific article; zbMATH DE number 5677418 (Why is no real title available?)
- Inference rules for proving the equivalence of recursive procedures
- scientific article; zbMATH DE number 139628 (Why is no real title available?)
- CLP(χ) for automatically proving program properties1An earlier version of this paper was presented at the workshop “Frontiers of Combining Systems”, Munich, March 1996.1
- scientific article; zbMATH DE number 1140685 (Why is no real title available?)
- Program equivalence by circular reasoning
- A language-independent proof system for full program equivalence
- On Termination of Binary CLP Programs
- Equivalence of propositional Prolog programs
This page was built for publication: Proving the equivalence of CLP programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4812966)