Results 1  10
of
24
Game Theoretic Analysis Of CallByValue Computation
, 1997
"... . We present a general semantic universe of callbyvalue computation based on elements of game semantics, and validate its appropriateness as a semantic universe by the full abstraction result for callbyvalue PCF, a generic typed programming language with callbyvalue evaluation. The key idea is ..."
Abstract

Cited by 59 (20 self)
 Add to MetaCart
. We present a general semantic universe of callbyvalue computation based on elements of game semantics, and validate its appropriateness as a semantic universe by the full abstraction result for callbyvalue PCF, a generic typed programming language with callbyvalue evaluation. The key idea is to consider the distinction between callbyname and callbyvalue as that of the structure of information flow, which determines the basic form of games. In this way the callbyname computation and callbyvalue computation arise as two independent instances of sequential functional computation with distinct algebraic structures. We elucidate the type structures of the universe following the standard categorical framework developed in the context of domain theory. Mutual relationship between the presented category of games and the corresponding callbyname universe is also clarified. 1. Introduction The callbyvalue is a mode of calling procedures widely used in imperative and function...
Concurrent Transition Systems
 Theoretical Computer Science
, 1989
"... : Concurrent transition systems (CTS's), are ordinary nondeterministic transition systems that have been equipped with additional concurrency information, specified in terms of a binary residual operation on transitions. Each CTS C freely generates a complete CTS or computation category C , ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
: Concurrent transition systems (CTS's), are ordinary nondeterministic transition systems that have been equipped with additional concurrency information, specified in terms of a binary residual operation on transitions. Each CTS C freely generates a complete CTS or computation category C , whose arrows are equivalence classes of finite computation sequences, modulo a congruence induced by the concurrency information. The categorical composition on C induces a "prefix" partial order on its arrows, and the computations of C are conveniently defined to be the ideals of this partial order. The definition of computations as ideals has some pleasant properties, one of which is that the notion of a maximal ideal in certain circumstances can serve as a replacement for the more troublesome notion of a fair computation sequence. To illustrate the utility of CTS's, we use them to define and investigate a dataflowlike model of concurrent computation. The model consists of machines, which ...
Safety for Branching Time Semantics
, 1991
"... We study in a first part of this paper safety and liveness properties for any given program semantics. We give a topological definition of these properties using a safety preorder. Then, we consider the case of branching time semantics where a program is modeled by a set of infinite computation tree ..."
Abstract

Cited by 35 (4 self)
 Add to MetaCart
We study in a first part of this paper safety and liveness properties for any given program semantics. We give a topological definition of these properties using a safety preorder. Then, we consider the case of branching time semantics where a program is modeled by a set of infinite computation trees modulo bisimulation. We propose and study a safety preorder for this semantics based on simulation and dealing with silent actions. We focus on regular safety properties and characterize them by both treeautomata and formulas of a branching time logic. We show that verifying safety properties on trees reduces to simulation testing.
Relationships between Models of Concurrency
, 1994
"... . Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics. The ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics. The classifications are formalized through the medium of category theory. Keywords. Semantics, Concurrency, Models for Concurrency, Categories. Contents 1 Preliminaries 431 2 Deterministic Transition Systems 433 3 Noninterleaving vs. Interleaving Models 436 Synchronization Trees and Labelled Event Structures : : : : : : : : : : : : : : 438 Transition Systems with Independence : : : : : : : : : : : : : : : : : : : : : : 439 4 Behavioural, Linear Time, Noninterleaving Models 441 Semilanguages and Event Structures : : : : : : : : : : : : : : : : : : : : : : : 443 Trace Languages and Event Structures : : : : : : : : : : : : : : : : : : : : : : 446 5 Transition Systems with Independence and Lab...
Object Specification
 IFIP WG14.3 BOOK ON ALGEBRAIC FOUNDATIONS OF SYSTEMS SPECIFICATION
, 1997
"... ..."
Structured theory presentations and logic representations
 ANNALS OF PURE AND APPLIED LOGIC
, 1994
"... The purpose of a logical framework such as LF is to provide a language for defining logical systems suitable for use in a logicindependent proof development environment. All inferential activity in an object logic (in particular, proof search) is to be conducted in the logical framework via the ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
The purpose of a logical framework such as LF is to provide a language for defining logical systems suitable for use in a logicindependent proof development environment. All inferential activity in an object logic (in particular, proof search) is to be conducted in the logical framework via the representation of that logic in the framework. An important tool for controlling search in an object logic, the need for which is motivated by the difficulty of reasoning about large and complex systems, is the use of structured theory presentations. In this paper a rudimentary language of structured theory presentations is presented, and the use of this structure in proof search for an arbitrary object logic is explored. The behaviour of structured theory presentations under representation in a logical framework is studied, focusing on the problem of "lifting" presentations from the object logic to the metalogic of the framework. The topic of imposing structure on logic presentations...
Combinators and Bisimulation Proofs for Restartable Systems
, 1991
"... During recent years, calculi for reasoning about concurrent systems have been developed; examples are CCS (Calculus of Communicating Systems), CSP (Communicating Sequential Processes) and ACP (Algebra of Communicating Processes). Their theory has been studied intensively; rather less has been done i ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
During recent years, calculi for reasoning about concurrent systems have been developed; examples are CCS (Calculus of Communicating Systems), CSP (Communicating Sequential Processes) and ACP (Algebra of Communicating Processes). Their theory has been studied intensively; rather less has been done in applying these calculi to problems of significant size. The reported work in this direction suggests that we should be prepared to develop new formal systems and notation for the problems we attack, and also that the sheer mechanics are difficult enough that we need new techniques to organise and structure proofs. In this thesis we study bisimulation proofs, applied to a small set of related problems. We define a class of new operators to capture the structure in these problems, and use them to produce significantly smaller and clearer proofs than were previously possible. In order to avoid complexities due to interleavings, we use a new calculus, MCCS, that can be seen as lying between C...
Aldébaran: A Tool for Verification of Communicating Processes
, 1989
"... Ald'ebaran is a tool for verifying communicating systems, represented as labeled transition systems. Verification techniques are based on the comparison of two labeled transition systems according to an equivalence relation. Strong bisimulation, weak bisimulation, acceptance model equivalence a ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Ald'ebaran is a tool for verifying communicating systems, represented as labeled transition systems. Verification techniques are based on the comparison of two labeled transition systems according to an equivalence relation. Strong bisimulation, weak bisimulation, acceptance model equivalence and safety equivalence are supported by Ald'ebaran. Communicating systems are described hierarchically by parallel composition of processes. Synchronization (or communications) between labeled transition systems set in parallel are determined by a synchronization algebra. To allow partial synchrony, a restriction operator is defined. To verify external specification, an abstract mechanism is used. A major goal of the tool is to provide different equivalence relations and efficient algorithms implementing these. 1 Introduction Ald'ebaran is a tool for verifying communicating processes, represented by labeled transition system. It is intended to be useful in the verification of communicating finite ...
Concurrent Transition System Semantics of Process Networks
 In Fourteenth ACM Symposium on Principles of Programming Languages
, 1987
"... Using concurrent transition systems [Sta86], we establish connections between three models of concurrent process networks, Kahn functions, input /output automata, and labeled processes. For each model, we define three kinds of algebraic operations on processes: the product operation, abstractio ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Using concurrent transition systems [Sta86], we establish connections between three models of concurrent process networks, Kahn functions, input /output automata, and labeled processes. For each model, we define three kinds of algebraic operations on processes: the product operation, abstraction operations, and connection operations. We obtain homomorphic mappings, from input/output automata to labeled processes, and from a subalgebra (called "input/output processes") of labeled processes to Kahn functions. The proof that the latter mapping preserves connection operations amounts to a new proof of the "Kahn Principle." Our approach yields: (1) extremely simple definitions of the process operations; (2) a simple and natural proof of the Kahn Principle that does not require the use of "strategies" or "scheduling arguments"; (3) a semantic characterization of a large class of labeled processes for which the Kahn Principle is valid, (4) a convenient operational semantics...