Results 1  10
of
1,621,345
An Interpretation of Erlang into Valuepassing Calculus
"... Abstract — In this paper we present a new process calculus VPCΣ and an interpretation for core Erlang. VPCΣ is at least as expressive as VPC and it is more effective for verification with some builtin functions. The wellestablished symbolic bisimulation in valuepassing calculus is now helpful for ..."
Abstract
 Add to MetaCart
Abstract — In this paper we present a new process calculus VPCΣ and an interpretation for core Erlang. VPCΣ is at least as expressive as VPC and it is more effective for verification with some builtin functions. The wellestablished symbolic bisimulation in valuepassing calculus is now helpful
Model Checking Valuepassing Processes
 In Proc. Of 8th AsiaPacific Software Engineering Conference
, 2001
"... An algorithm for model checking valuepassing processes is presented. Processes are modeled as symbolic transition graphs with assignments. To specify properties for such processes a graphical predicate mucalculus is introduced. It allows arbitrary nesting of the least and greatest fixpoints, and c ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
An algorithm for model checking valuepassing processes is presented. Processes are modeled as symbolic transition graphs with assignments. To specify properties for such processes a graphical predicate mucalculus is introduced. It allows arbitrary nesting of the least and greatest fixpoints
A calculus of mobile processes, I
, 1992
"... We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 1183 (31 self)
 Add to MetaCart
of higherorder functions (the Icalculus and combinatory algebra), the transmission of processes as values, and the representation of data structures as processes. The paper continues by presenting the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
; the spi calculus enables us to consider cryptographic issues in more detail. We represent protocols as processes in the spi calculus and state their security properties in terms of coarsegrained notions of protocol equivalence.
Symbolic Techniques for Valuepassing Calculi
 University of Sussex
, 1997
"... We investigate the use of symbolic operational semantics for valuepassing process languages. Symbolic semantics provide analytical tools for reasoning about particular infinite state systems where traditional methods fail. We eschew the use of Milner's encoding of valuepassing agents into pur ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We investigate the use of symbolic operational semantics for valuepassing process languages. Symbolic semantics provide analytical tools for reasoning about particular infinite state systems where traditional methods fail. We eschew the use of Milner's encoding of valuepassing agents
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise
An Extensible Interpreter for ValuePassing CCS
, 1995
"... We describe an interpreter for a valuepassing version of CCS implemented in the lazy functional programming language Haskell. Starting from a base interpreter, we then show how to modify the interpreter for CCS extensions including, additional nonprimitive combinators, new primitive operators (an ..."
Abstract
 Add to MetaCart
We describe an interpreter for a valuepassing version of CCS implemented in the lazy functional programming language Haskell. Starting from a base interpreter, we then show how to modify the interpreter for CCS extensions including, additional nonprimitive combinators, new primitive operators (an
A Complexity Analysis of Bisimilarity for ValuePassing Processes
 COMPUTER SCIENCE
, 1996
"... We study the complexity of deciding bisimilarity between nondeterministic processes with explicit primitives for manipulating data values. In particular, we consider a language with valuepassing (input/output of data) and parametric definitions of processes. We distinguish the case in which data c ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the complexity of deciding bisimilarity between nondeterministic processes with explicit primitives for manipulating data values. In particular, we consider a language with valuepassing (input/output of data) and parametric definitions of processes. We distinguish the case in which data
A Presheaf Semantics of ValuePassing Processes
, 1996
"... This paper investigates presheaf models for process calculi with value passing. Denotational semantics in presheaf models are shown to correspond to operational semantics in that bisimulation obtained from open maps is proved to coincide with bisimulation as defined traditionally from the operat ..."
Abstract

Cited by 33 (18 self)
 Add to MetaCart
This paper investigates presheaf models for process calculi with value passing. Denotational semantics in presheaf models are shown to correspond to operational semantics in that bisimulation obtained from open maps is proved to coincide with bisimulation as defined traditionally from
An Operational Framework for ValuePassing Processes\Lambda
, 1994
"... Abstract This paper develops a semantic framework for concurrent languages with value passing. An operation analogous to substitution in the *calculus is given, and a semantics is given for a valuepassing version of Milner's Calculus of Communicating Systems (CCS). An operational equivalence ..."
Abstract
 Add to MetaCart
Abstract This paper develops a semantic framework for concurrent languages with value passing. An operation analogous to substitution in the *calculus is given, and a semantics is given for a valuepassing version of Milner's Calculus of Communicating Systems (CCS). An operational equivalence
Results 1  10
of
1,621,345