This paper presents a foundation for refining concurrent programs with structured control flow. The verification problem is decomposed into subproblems that aid interactive program development, proof reuse, and automation. The formalization in this paper is the basis of a new design and implementation of the Civl verifier
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
This work proposes and demonstrates a novel method for software development that applies formal veri...
In this paper we present a theory for the refinement of shared-memory concurrent algorithms from spe...
This paper presents a foundation for refining concurrent programs with structured control flow. The ...
Designing and verifying concurrent programs is a notoriously challenging, time consuming, and error ...
Civl is a static verifier for concurrent programs designed around the conceptual framework of layere...
Civl is a static verifier for concurrent programs designed around the conceptual framework of layer...
textSociety depends critically on the correct and efficient execution of computer programs. The req...
This thesis is not available on this repository until the author agrees to make it public. If you ar...
Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data s...
This paper discusses how several concurrent program verification techniques can be combined in a lay...
There has been considerable progress in the domain of software verification over the last few years....
AbstractThe state space explosion problem in model checking remains the chief obstacle to the practi...
Reasoning systems based on Concurrent Separation Logic make verifying complex concurrent algorithms ...
AbstractA simple and elegant formulation of compositional proof systems for concurrent programs resu...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
This work proposes and demonstrates a novel method for software development that applies formal veri...
In this paper we present a theory for the refinement of shared-memory concurrent algorithms from spe...
This paper presents a foundation for refining concurrent programs with structured control flow. The ...
Designing and verifying concurrent programs is a notoriously challenging, time consuming, and error ...
Civl is a static verifier for concurrent programs designed around the conceptual framework of layere...
Civl is a static verifier for concurrent programs designed around the conceptual framework of layer...
textSociety depends critically on the correct and efficient execution of computer programs. The req...
This thesis is not available on this repository until the author agrees to make it public. If you ar...
Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data s...
This paper discusses how several concurrent program verification techniques can be combined in a lay...
There has been considerable progress in the domain of software verification over the last few years....
AbstractThe state space explosion problem in model checking remains the chief obstacle to the practi...
Reasoning systems based on Concurrent Separation Logic make verifying complex concurrent algorithms ...
AbstractA simple and elegant formulation of compositional proof systems for concurrent programs resu...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
This work proposes and demonstrates a novel method for software development that applies formal veri...
In this paper we present a theory for the refinement of shared-memory concurrent algorithms from spe...
DOI
Add to ORKG