On Quantitative Software Verification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

On Quantitative Software Verification

Marta Kwiatkowska
  • Function : Author
  • PersonId : 861066


Software verification has made great progress in recent years, resulting in several tools capable of working directly from source code, for example, SLAM and Astree. Typical properties that can be verified are expressed as Boolean assertions or temporal logic properties, and include whether the program eventually terminates, or the executions never violate a safety property. The underlying techniques crucially rely on the ability to extract from programs, using compiler tools and predicate abstraction, finite-state abstract models, which are then iteratively refined to either demonstrate the violation of a safety property (e.g. a buffer overflow) or guarantee the absence of such faults. An established method to achieve this automatically executes an abstraction-refinement loop guided by counterexample traces [1].
Fichier principal
Vignette du fichier
spin09.pdf (53.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00457746 , version 1 (18-02-2010)



Marta Kwiatkowska. On Quantitative Software Verification. SPIN 2009 : Model Checking Software, 16th International SPIN Workshop, Jun 2009, Grenoble, France. pp.2-3, ⟨10.1007/978-3-642-02652-2⟩. ⟨inria-00457746⟩


36 View
156 Download



Gmail Facebook X LinkedIn More