The following pages link to A proof theory for model checking (Q2331070):
Displaying 19 items.
- A partial approach to model checking (Q1327383) (← links)
- Non-well-founded deduction for induction and coinduction (Q2055840) (← links)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- The undecidability of proof search when equality is a logical connective (Q2134939) (← links)
- Intuitionistic implication makes model checking hard (Q2887060) (← links)
- (Q3434483) (← links)
- Machine Checking Proof Theory: An Application of Logic to Logic (Q3601798) (← links)
- (Q3819996) (← links)
- (Q4364538) (← links)
- (Q4518869) (← links)
- An Implementation of the Model Elimination Proof Procedure (Q4770008) (← links)
- Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays (Q5043584) (← links)
- (Q5144667) (← links)
- (Q5322945) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897473) (← links)
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus (Q6041667) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- A local search approach to protocol verification (Q6589831) (← links)
- Focusing Gentzen's LK proof system (Q6612872) (← links)