A proof system for conditional algebraic specifications
From MaRDI portal
Recommendations
Cites work
- Computing with rewrite systems
- scientific article; zbMATH DE number 3871335 (Why is no real title available?)
- scientific article; zbMATH DE number 3913659 (Why is no real title available?)
- scientific article; zbMATH DE number 3990847 (Why is no real title available?)
- scientific article; zbMATH DE number 4089521 (Why is no real title available?)
- scientific article; zbMATH DE number 3688683 (Why is no real title available?)
- scientific article; zbMATH DE number 193539 (Why is no real title available?)
- scientific article; zbMATH DE number 4776 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- On sufficient-completeness and related properties of term rewriting systems
- Proofs by induction in equational theories with constructors
- Proving termination with multiset orderings
- Semantic confluence tests and completion methods
- Termination of rewriting
Cited in
(14)- An algorithm to recognize sufficient completeness of algebraic specification of an abstract data type
- Simultaneous checking of completeness and ground confluence for algebraic specifications
- scientific article; zbMATH DE number 3876565 (Why is no real title available?)
- Completeness of Proof Systems for Equational Specifications
- scientific article; zbMATH DE number 3890711 (Why is no real title available?)
- scientific article; zbMATH DE number 1274721 (Why is no real title available?)
- scientific article; zbMATH DE number 1302503 (Why is no real title available?)
- Conditional equational specifications of data types with partial operations for inductive theorem proving
- Proof systems for structured algebraic specifications: An overview
- scientific article; zbMATH DE number 6403889 (Why is no real title available?)
- Incremental proofs of termination, confluence and sufficient completeness of OBJ specifications
- A calculus for conditional inductive theorem proving
- On sufficient completeness of conditional specifications
- Deductive verification of alternating systems
This page was built for publication: A proof system for conditional algebraic specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881266)