Topological Models for Higher Ordr Control Flow
Operational and denotational models are developed for two simple imperative languages with higher order constructs, and the semantic mappings are defined as fixed points of (contractive) higher order operators by Banach's theorem.
Specification of Abstract Dynamic-Data Types: A Temporal Logic Approach
- Mathematics, Computer ScienceTheor. Comput. Sci.
Bisimulation for Higher-Order Process Calculi
- Computer ScienceInf. Comput.
A new form of bisimulation is proposed for higher-order process calculus, called context bisimulations, which yields a more satisfactory discriminanting power and is played by the factorisation theorem.
Labelled transition logic: an outline
- Computer ScienceActa Informatica
A method for the specification of reactive/concurrent/parallel/distributed systems both at the requirement and at the design level, inspired by CCS, which extends to labelled transition systems the logical/algebraic specification method of abstract data types.
Reportrapport Topological Models for Higher Order Control Flow Topological Models for Higher Order Control Flow
Semantic models are presented for two simple imperative languages with higher order constructs. In the rst language the interesting notion is that of second order assignment x := s, for x a procedure…
Some Issues in the Semantics of Facile Distributed Programming
- Computer ScienceREX Workshop
A possible approach for the operational semantics of language constructs that follows the Facile philosophy and some recent results in concurrency theory are discussed.
Metric Semantics for Second Order
- Computer Science
An operational and a denotational semantics are presented for a simple imperative language. The main feature of the language is second order communication: sending and receiving of statements rather…
Proof Systems for Structured Specifications with Observability Operators
- MathematicsTheor. Comput. Sci.
Comparison of Process Algebra Equivalences Using Formats
- Computer ScienceICALP
This research defines a new format called extended tyft/tyxt format, able to express process algebras with structured or non-atomic labels and their bisimulation-based semantic equivalences and gives results showing conditions required to achieve the extensions.
SHOWING 1-10 OF 35 REFERENCES
Towards the Unification of Models for Concurrency
- Computer ScienceCAAP
This paper model the semantics of a concrete process description language, in both its interleaving and its true concurrency versions, through categories whose objects are models, and where morphisms represent a specification-implementation relation.
Algebraic laws for nondeterminism and concurrency
- Computer ScienceJACM
The paper demonstrates, for a sequence of simple languages expressing finite behaviors, that in each case observation congruence can be axiomatized algebraically and the algebraic language described here becomes a calculus for writing and specifying concurrent programs and for proving their properties.
Operational and Algebraic Semantics of Concurrent Processes
- MathematicsHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
Models and Equality for Logical Programming
- Computer ScienceTAPSOFT, Vol.1
We argue that some standard tools from model theory provide a better semantic foundation than the more syntactic and operational approaches usually used in logic programming. In particular, we show…
An Algebraic Characterization of Transition System Equivalences
- MathematicsInf. Comput.
Structured Operational Semantics and Bisimulation as a Congruence
- Computer ScienceInf. Comput.
Observers, Experiments and Agents: a Comprehensive Approach to Parallelism
- Computer ScienceSemantics of Systems of Concurrent Processes
An enriched categorical approach is introduced which provides a unifying theory for many notions of parallelism and concurrency, based on a concept of observational equivalence induced by a set of observers, which perform experiments over agents.
A calculus of higher order communicating systems
- Computer SciencePOPL '89
The relationship between CHOCS and the untyped λ-calculus is further strengthened by a result showing that the recursion operator is unnecessary in the sense that recursion can be simulated by means of process passing and communication.