Deductive software verification

Filliâtre, Jean-Christophe

doi:10.1007/s10009-011-0211-0

Cited by 41 publications

(25 citation statements)

References 39 publications

(37 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Verification ensures that the software is aligned with its desired requirements, meets particular necessities, completeness, and performance according to specifications [4]. It strives to fulfill consistency, the correctness of program translations as well as behavioral correctness [6].…”

Section: Introductionmentioning

confidence: 99%

An efficient software verification using multi-layered software verification tool

Devi¹,

Nalini²,

Kumar³

2018

IJET

150

171

View full text Add to dashboard Cite

Rapid advancements in Software Verification and Validation have been critical in the wide development of tools and techniques to identify potential Concurrent bugs and hence verify the software correctness. A concurrent program has multiple processes and shared objects. Each process is a sequential program and they use the shared objects for communication for completion of a task. The primary objective of this survey is retrospective review of different tools and methods used for the verification of real-time concurrent software. This paper describes the proposed tool 'F-JAVA' for multithreaded Java codebases in contrast with existing 'FRAMA-C' platform, which is dedicated to real-time concurrent C software analysis. The proposed system is comprised of three layers, namely Programming rules generation stage, Verification stage with Particle Swarm Optimization (PSO) algorithm, and Performance measurement stage. It aims to address some of the challenges in the verification process such as larger programs, long execution times, and false alarms or bugs, and platform independent code verification

show abstract

Section: Introductionmentioning

confidence: 99%

An efficient software verification using multi-layered software verification tool

Devi¹,

Nalini²,

Kumar³

2018

IJET

150

171

View full text Add to dashboard Cite

show abstract

“…it has sought to verify that a program, given as a piece of code in a programming language, satisfies a specification for all possible inputs to that program. This approach can be traced back to the seminal work of Floyd and Hoare, which has grown into the mature field of Deduction Software Verification [2,15]. Another successful static approach is that of (Software) Model Checking [12] where the state space of the program is searched looking for bad states (and trying to establish their absence).…”

Section: Motivation and Goalsmentioning

confidence: 99%

A Broader View on Verification: From Static to Runtime and Back (Track Summary)

Ahrendt

Huisman

Reger

et al. 2018

Leveraging Applications of Formal Methods, Verification and Validation. Verification

View full text Add to dashboard Cite

When seeking to verify a computational system one can either view the system as a static description of possible behaviours or a dynamic collection of observed or actual behaviours. Historically, there have been clear differences between the two approaches in terms of their level of completeness, the associated costs, the kinds of specifications considered, how and when they are applied, and so on. Recently there has been a concentrated interest in the combination of static and runtime (dynamic) techniques and this track (taking place as part of ISoLA 2018) aims to explore this combination further.

show abstract

“…Over the past decades, we have witnessed a tremendous development in the field of deductive software verification [11], the practice of turning the correctness of code into a mathematical statement and then prove it. Interactive proof assistants have evolved from obscure and mysterious tools into de facto standards for proving industrial-size projects.…”

Section: Introductionmentioning

confidence: 99%

Cameleer: A Deductive Verification Tool for OCaml

Pereira

Ravara

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present , an automated deductive verification tool for OCaml. We leverage on the recently proposed GOSPEL (Generic OCaml SPEcification Language) to attach rigorous, yet readable, behavioral specification to OCaml code. The formally-specified program is fed to our toolchain, which translates it into an equivalent one in WhyML, the programming and specification language of the Why3 verification framework. We report on successful case studies conducted in .

show abstract

Deductive software verification

Cited by 41 publications

References 39 publications

An efficient software verification using multi-layered software verification tool

An efficient software verification using multi-layered software verification tool

A Broader View on Verification: From Static to Runtime and Back (Track Summary)

Cameleer: A Deductive Verification Tool for OCaml

Contact Info

Product

Resources

About