AbstractCompositionality is of great practical importance when building systems from individual components. Unfortunately, leads-to properties are not, in general, compositional, and theorems describing the special cases where they are, are needed. In this paper, we develop a general theory of compositional leads-to properties, and use it to derive a composition theorem based on the notion of progress sets, where progress sets can be defined in various ways. Appropriate definitions of progress sets yield new results and generalized versions of known theorems
Abstract. The paper reports on experiences of mechanizing various proposals for compositional reason...
A session-based process satisfies the progress property if its sessions never get stuck when it is ...
AbstractThe UNITY approach to specification, design, and verification of parallel programs expounded...
AbstractCompositionality is of great practical importance when building systems from individual comp...
To facilitate the construction of concurrent programs based on progress requirements, we study an in...
Giving a compositional proof for progress properties of distributed systems has always been problema...
Large distributed applications are composed of basic blocks, by using composition operators. In an ...
In some otherwise attractive formalisms, it can be difficult or even impossible to specify progress...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
This paper explores theories that help in (i) proving that a system composed from components satisfi...
AbstractThe compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the mo...
In this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calcu...
AbstractIn component based software design, formal reasoning about programs has to be compositional,...
We define a predicate transformer, in terms of which finite disjunctions of leads-to properties ca...
The paper reports on experiences of mechanizing various proposals for compositional reasoning in co...
Abstract. The paper reports on experiences of mechanizing various proposals for compositional reason...
A session-based process satisfies the progress property if its sessions never get stuck when it is ...
AbstractThe UNITY approach to specification, design, and verification of parallel programs expounded...
AbstractCompositionality is of great practical importance when building systems from individual comp...
To facilitate the construction of concurrent programs based on progress requirements, we study an in...
Giving a compositional proof for progress properties of distributed systems has always been problema...
Large distributed applications are composed of basic blocks, by using composition operators. In an ...
In some otherwise attractive formalisms, it can be difficult or even impossible to specify progress...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
This paper explores theories that help in (i) proving that a system composed from components satisfi...
AbstractThe compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the mo...
In this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calcu...
AbstractIn component based software design, formal reasoning about programs has to be compositional,...
We define a predicate transformer, in terms of which finite disjunctions of leads-to properties ca...
The paper reports on experiences of mechanizing various proposals for compositional reasoning in co...
Abstract. The paper reports on experiences of mechanizing various proposals for compositional reason...
A session-based process satisfies the progress property if its sessions never get stuck when it is ...
AbstractThe UNITY approach to specification, design, and verification of parallel programs expounded...