A sufficient completeness reasoning tool for partial specifications
From MaRDI portal
Recommendations
- Towards Complete Reasoning about Axiomatic Specifications
- Partial specifications and compositional verification
- A total approach to partial algebraic specification
- On sufficient completeness of conditional specifications
- scientific article; zbMATH DE number 3943001
- Completeness of a logical system for structured specifications
- scientific article; zbMATH DE number 139988
- Completeness of Proof Systems for Equational Specifications
Cited in
(13)- Partial specifications and compositional verification
- Twenty years of rewriting logic
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Metalevel algorithms for variant satisfiability
- Metalevel algorithms for variant satisfiability
- On First-Order Model-Based Reasoning
- Towards Complete Reasoning about Axiomatic Specifications
- Sufficient completeness verification for conditional and constrained TRS
- A metamodel of access control for distributed environments: applications and properties
- Variant-Based Satisfiability in Initial Algebras
- Checking Sufficient Completeness by Inductive Theorem Proving
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies
- A nominal approach to equational problems in languages with binders
This page was built for publication: A sufficient completeness reasoning tool for partial specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703846)