Pages that link to "Item:Q1355757"
From MaRDI portal
The following pages link to Automated theorem proving by test set induction (Q1355757):
Displaying 21 items.
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Automating inductionless induction using test sets (Q758216) (← links)
- Tool-assisted specification and verification of typed low-level languages (Q861687) (← links)
- Automatic inductive theorem proving using Prolog (Q1103415) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Incorporating decision procedures in implicit induction. (Q1404422) (← links)
- Observational proofs by rewriting. (Q1607227) (← links)
- Automata-driven automated induction (Q1854445) (← links)
- Implicit induction in conditional theories (Q1891255) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs (Q2163179) (← links)
- An automated prover for Zermelo-Fraenkel set theory in Theorema (Q2457343) (← links)
- Automated Certification of Implicit Induction Proofs (Q3100200) (← links)
- Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities (Q3522029) (← links)
- Superposition for Fixed Domains (Q3540186) (← links)
- Automated Induction with Constrained Tree Automata (Q3541728) (← links)
- Deciding the Inductive Validity of ∀ ∃ * Queries (Q3644758) (← links)
- Automating Inductive Proofs Using Theory Exploration (Q4928454) (← links)
- Verifying Procedural Programs via Constrained Rewriting Induction (Q5278212) (← links)
- Formal Approaches to Software Testing (Q5902011) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)
