Add to ORKGWe outline some conceptual challenges in extending the PCC paradigm to a concurrent and distributed setting, and sketch a generalized notion of module correctness based on viewing communication contracts as economic games. The model supports compositional reasoning about modular systems and is meant to apply not only to certification of executable code, but also of organizational workflows
AbstractThe state space explosion problem in model checking remains the chief obstacle to the practi...
Verification of concurrent systems is difficult because of the inherent nondeterminism. Modern verif...
There has been considerable progress in the domain of software verification over the last few years....
AbstractDistributed and concurrent object-oriented systems are difficult to analyze due to the compl...
Distributed and concurrent object-oriented systems are difficult to analyze due to the complexity of...
We present a new approach, certified program models, to establish correctness of distributed protoco...
This paper describes a compositional proof system called P-A logic for establishing weak total corre...
The goal of the thesis is to provide theory, methods and tools for the design and implementation of ...
Abstract. The SCOOP model extends the Eiffel programming language to provide support for concurrent ...
Formal methods to specify and verify concurrent programs with synchronous message passing are discus...
We present a method for specification and verification of distributed systems that communicate via ...
A concurrent system involves several executing components. Such a system usually allows to carry out...
This paper presents a foundation for refining concurrent programs with structured control flow. The ...
Traditionally, computer programs have been thought of as entities which take some input, execute a s...
In this thesis, we have studied how component-based systems are designed, verified and then implemen...
AbstractThe state space explosion problem in model checking remains the chief obstacle to the practi...
Verification of concurrent systems is difficult because of the inherent nondeterminism. Modern verif...
There has been considerable progress in the domain of software verification over the last few years....
AbstractDistributed and concurrent object-oriented systems are difficult to analyze due to the compl...
Distributed and concurrent object-oriented systems are difficult to analyze due to the complexity of...
We present a new approach, certified program models, to establish correctness of distributed protoco...
This paper describes a compositional proof system called P-A logic for establishing weak total corre...
The goal of the thesis is to provide theory, methods and tools for the design and implementation of ...
Abstract. The SCOOP model extends the Eiffel programming language to provide support for concurrent ...
Formal methods to specify and verify concurrent programs with synchronous message passing are discus...
We present a method for specification and verification of distributed systems that communicate via ...
A concurrent system involves several executing components. Such a system usually allows to carry out...
This paper presents a foundation for refining concurrent programs with structured control flow. The ...
Traditionally, computer programs have been thought of as entities which take some input, execute a s...
In this thesis, we have studied how component-based systems are designed, verified and then implemen...
AbstractThe state space explosion problem in model checking remains the chief obstacle to the practi...
Verification of concurrent systems is difficult because of the inherent nondeterminism. Modern verif...
There has been considerable progress in the domain of software verification over the last few years....