Pages that link to "Item:Q1267035"
From MaRDI portal
The following pages link to Verifying programs in the calculus of inductive constructions (Q1267035):
Displaying 19 items.
- Verification, induction, termination analysis. Festschrift for Christoph Walther on the occasion of his 60th birthday (Q600798) (← links)
- ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs (Q689297) (← links)
- Inductive expansion: A calculus for verifying and synthesizing functional and logic programs (Q757077) (← links)
- Program development in constructive type theory (Q1190474) (← links)
- Verifying programs in the calculus of inductive constructions (Q1267035) (← links)
- Program construction by verifying specification (Q1273080) (← links)
- Synthesis of ML programs in the system Coq (Q1322847) (← links)
- Using an induction prover for verifying arithmetic circuits (Q1856145) (← links)
- (Q3722485) (← links)
- (Q3766816) (← links)
- (Q4997232) (← links)
- A User-friendly Interface for a Lightweight Verification System (Q5170234) (← links)
- Characteristic formulae for the verification of imperative programs (Q5176992) (← links)
- Programming Languages and Systems (Q5308710) (← links)
- Proving Programs Incorrect Using a Sequent Calculus for Java Dynamic Logic (Q5423862) (← links)
- Theorem Proving in Higher Order Logics (Q5464648) (← links)
- Deductive verification in decidable fragments with Ivy (Q6041167) (← links)
- Contract lenses: Reasoning about bidirectional programs via calculation (Q6065510) (← links)
- Checking Sufficient Completeness by Inductive Theorem Proving (Q6487296) (← links)