Verification
Verification is the heart of ImandraX. It's where you move from writing code to proving that your code is correct, or discovering exactly how it fails.
ImandraX combines three complementary approaches:
- Bounded verification (unrolling): symbolic model checking with built-in decision procedures. Fast, fully automatic, and excellent at finding counterexamples.
- Unbounded verification (the inductive waterfall): a proof engine that combines simplification, induction, and multiple proof strategies to establish properties for all inputs.
- Interactive proof construction: a rich language of reasoning tactics and tacticals that allows you to ergonomically guide the system, construct proofs step by step, and explore counterexamples interactively.
The recommended workflow is: start with bounded verification to search for counterexamples. Most conjectures are false, and unrolling finds this quickly. Iterate on fixing your models and goals until no counterexamples remain, then prove the goal with [@@by auto] or other tactics. ImandraX won't attempt induction unless you ask for it via a tactic.
ImandraX supports a spectrum of proof styles: highly automated declarative proofs built from a sequence of lemmas and definitions that the waterfall orchestrates automatically, and tightly controlled interactive proofs constructed from a precise sequence of tactics with fine-grained control over every step.
In this section
- Commands: the five commands
verify,instance,theorem,lemmaandaxiom - Tactics: the tactic language, with 45+ composable tactics
- Subterm Selection: a pattern language for picking subterms out of proof goals
- Simplification: rewrite rules, forward chaining, and the simplifier
- Unrolling: bounded model checking and counterexample synthesis
- Induction: functional and structural induction
- The Waterfall: the full automated proof pipeline
- Counterexamples: working with synthesized counterexamples
- Termination: proving that functions terminate, and why it matters
- Incremental Proofs: parallel and incremental proof checking