This technical report contains detailed definitions, auxiliary lemmas, main theorems, and proofs related to the paper A Predicate Transformer for Choreographies, published in the proceedings of ESOP 2022. The aim of this document is to provide a comprehensive reference guide for the theory presented in the paper. In contrast to the paper, we do not split the presentation into a base calculus, an extension with blocking if/while-statements, and an extension with non-blocking if/while statements. Instead, we present the whole calculus of global programs, including all extensions, at once.<br/
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
AbstractIn Keimel et al. (2009) [5] we have systematically derived a predicate transformer semantics...
Choreographic programming is a paradigm where developers write the global specification (called chor...
This technical report contains detailed definitions, auxiliary lemmas, main theorems, and proofs rel...
Abstract. Construction and analysis of distributed systems is difficult; choreographic programming i...
Construction and analysis of distributed systems is difficult; choreographic programming is a deadlo...
Construction and analysis of distributed systems is difficult; choreographic programming is a deadlo...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
The weakest precondition semantics of recursive procedures with local variables are developed for an...
Given a general definition of the procedure call based on the substitution rule for assignment, a g...
AbstractData refinement is the systematic substitution of one data type for another in a program. Us...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
Process algebra is a device for analysing sequential processes, and has been studied in Amsterdam si...
AbstractThe behavior of a program can be modeled by describing how it transforms input states to out...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
AbstractIn Keimel et al. (2009) [5] we have systematically derived a predicate transformer semantics...
Choreographic programming is a paradigm where developers write the global specification (called chor...
This technical report contains detailed definitions, auxiliary lemmas, main theorems, and proofs rel...
Abstract. Construction and analysis of distributed systems is difficult; choreographic programming i...
Construction and analysis of distributed systems is difficult; choreographic programming is a deadlo...
Construction and analysis of distributed systems is difficult; choreographic programming is a deadlo...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
The weakest precondition semantics of recursive procedures with local variables are developed for an...
Given a general definition of the procedure call based on the substitution rule for assignment, a g...
AbstractData refinement is the systematic substitution of one data type for another in a program. Us...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
Process algebra is a device for analysing sequential processes, and has been studied in Amsterdam si...
AbstractThe behavior of a program can be modeled by describing how it transforms input states to out...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
AbstractIn Keimel et al. (2009) [5] we have systematically derived a predicate transformer semantics...
Choreographic programming is a paradigm where developers write the global specification (called chor...