A3PAT
From MaRDI portal
Software:33392
swMATH21587MaRDI QIDQ33392FDOQ33392
Author name not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- Proving termination by dependency pairs and inductive theorem proving
- Generalized and Formalized Uncurrying
- A metamodel of access control for distributed environments: applications and properties
- Structural Analysis of Narratives with the Coq Proof Assistant
- CERTIFIED SUBTERM CRITERION AND CERTIFIED USABLE RULES
- Certifying safety and termination proofs for integer transition systems
- Mechanically certifying formula-based Noetherian induction reasoning
This page was built for software: A3PAT
