The following pages link to Logical analysis of programs (Q4124273):
Displayed 17 items.
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Verification conditions for source-level imperative programs (Q465685) (← links)
- Mechanical inference of invariants for FOR-loops (Q604381) (← links)
- A method for computing the number of iterations in data dependent loops (Q853604) (← links)
- An integrated approach to high integrity software verification (Q861714) (← links)
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs (Q882517) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- A decomposition rule for the Hoare logic (Q1097683) (← links)
- Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic (Q1139368) (← links)
- Logical debugging (Q1322853) (← links)
- Automatic generation of invariants and intermediate assertions (Q1391929) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Generating all polynomial invariants in simple loops (Q2457430) (← links)
- Synthesis of the programmed functions offor loops on data structures (Q3804172) (← links)
- Current methods for proving program correctness (Q3911363) (← links)
- An algorithm for finding invariant relations in programs (Q3942372) (← links)
- Solving invariant generation for unsolvable loops (Q6164420) (← links)