<--- Back to Details
First PageDocument Content
Formal methods / Automated theorem proving / Theoretical computer science / Logic in computer science / SPARK / Loop invariant / Mathematical proof / Automated reasoning / Verification condition generator / Formal verification / Correctness / Conjecture
Date: 2006-05-16 11:38:59
Formal methods
Automated theorem proving
Theoretical computer science
Logic in computer science
SPARK
Loop invariant
Mathematical proof
Automated reasoning
Verification condition generator
Formal verification
Correctness
Conjecture

An Integrated Approach to High Integrity Software Verification Andrew Ireland1 , Bill J. Ellis1 , Andrew Cook1 , Roderick Chapman2 , Janet Barnes2 1

Add to Reading List

Source URL: www.macs.hw.ac.uk

Download Document from Source Website

File Size: 263,05 KB

Share Document on Facebook

Similar Documents

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT  INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING  1. I NTRODUCTION

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTION

DocID: 1vah4 - View Document

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

DocID: 1sXwT - View Document

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

DocID: 1sOSK - View Document

Microsoft Word - BlankPage

Microsoft Word - BlankPage

DocID: 1rugC - View Document

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

DocID: 1rrok - View Document