Add to ORKGThe paper reports on experiences of mechanizing various proposals for compositional reasoning in concurrent systems. The work uses the UNITY formalism and the Isabelle proof tool. The proposals investigated include existential /universal properties, guarantees properties and progress sets. The paper mentions some alternative proposals that are also worth of investigation
AbstractA simple and elegant formulation of compositional proof systems for concurrent programs resu...
AbstractDistributed and concurrent object-oriented systems are difficult to analyze due to the compl...
This report documents the program and the outcomes of Dagstuhl Seminar 15191 "Compositional Verifica...
Abstract. The paper reports on experiences of mechanizing various proposals for compositional reason...
We describe the mechanization of recent examples of compositional reasoning, due to Charpentier and ...
UNITY is an abstract formalism for proving properties of concurrent systems, which typically are exp...
AbstractThis paper introduces open systems with non-trivial environment actions and proposes a coope...
This paper presents a high level overview of Proof Spaces [Farzan, Kincaid, and Podelski, 2015] as a...
Formal methods to specify and verify concurrent programs with synchronous message passing are discus...
This paper proposes a parallel programming notation and a method of reasoning about programs with th...
There is a broad design space for concurrent computer processors: they can be optimized for low powe...
Specification, construction and verification of programs should be done in a compositional way. This...
Abstract. A key property for a development method is compositionality because it ensures that a meth...
Specification, construction and verification of programs should be done in a compositional way. This...
Compositional reasoning about a system means writing its specification as the parallel composition o...
AbstractA simple and elegant formulation of compositional proof systems for concurrent programs resu...
AbstractDistributed and concurrent object-oriented systems are difficult to analyze due to the compl...
This report documents the program and the outcomes of Dagstuhl Seminar 15191 "Compositional Verifica...
Abstract. The paper reports on experiences of mechanizing various proposals for compositional reason...
We describe the mechanization of recent examples of compositional reasoning, due to Charpentier and ...
UNITY is an abstract formalism for proving properties of concurrent systems, which typically are exp...
AbstractThis paper introduces open systems with non-trivial environment actions and proposes a coope...
This paper presents a high level overview of Proof Spaces [Farzan, Kincaid, and Podelski, 2015] as a...
Formal methods to specify and verify concurrent programs with synchronous message passing are discus...
This paper proposes a parallel programming notation and a method of reasoning about programs with th...
There is a broad design space for concurrent computer processors: they can be optimized for low powe...
Specification, construction and verification of programs should be done in a compositional way. This...
Abstract. A key property for a development method is compositionality because it ensures that a meth...
Specification, construction and verification of programs should be done in a compositional way. This...
Compositional reasoning about a system means writing its specification as the parallel composition o...
AbstractA simple and elegant formulation of compositional proof systems for concurrent programs resu...
AbstractDistributed and concurrent object-oriented systems are difficult to analyze due to the compl...
This report documents the program and the outcomes of Dagstuhl Seminar 15191 "Compositional Verifica...