Proofs in parameterized specifications
From MaRDI portal
Publication:5055758
DOI10.1007/3-540-53904-2_95zbMath1503.68292OpenAlexW2147993379MaRDI QIDQ5055758
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-53904-2_95
Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items
Cites Work
- On sufficient-completeness and related properties of term rewriting systems
- A characterization of passing compatibility for parameterized specifications
- The equational theory of parameterized specifications
- Automatic proofs by induction in theories without constructors
- Parameterized Programming
- Computing with rewrite systems
- Semantic confluence tests and completion methods
- Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item