Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Communicating sequential processes
Communicating sequential processes
Communications of the ACM
Information Processing Letters
Parallel program design: a foundation
Parallel program design: a foundation
A bridging model for parallel computation
Communications of the ACM
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Theoretical Computer Science
Probabilistic models for the guarded command language
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
Predicative programming Part II
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Communication and Concurrency
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Specification for reactive bulk-synchronous programming
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
A Fixpoint Theory for Non-monotonic Parallelism
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
| Hi-index | 0.00 |
This paper presents a technique called generic composition to provide a neat basis for different kinds of semantic compositions and various higher-order healthiness conditions appearing in a variety of semantic theories. The weak inverse of generic composition is defined. A completeness theorem shows that any predicate can be written in terms of generic composition and its weak inverse, and a number of algebraic laws are given to support reasoning.