Results 11  20
of
70
TestingBased Abstractions for ValuePassing Systems
 In CONCUR'94, number 836 in Lecture Notes in Computer Science
, 1994
"... ions for ValuePassing Systems ? Rance Cleaveland ?? and James Riely ??? 1 Dept. of Computer Science, N.C. State University, Raleigh, NC 276958206, USA 2 Dept. of Computer Science, University of N.C., Chapel Hill, NC 275993175, USA email: rance@csc.ncsu.edu, riely@cs.unc.edu Abstract. ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
(Show Context)
ions for ValuePassing Systems ? Rance Cleaveland ?? and James Riely ??? 1 Dept. of Computer Science, N.C. State University, Raleigh, NC 276958206, USA 2 Dept. of Computer Science, University of N.C., Chapel Hill, NC 275993175, USA email: rance@csc.ncsu.edu, riely@cs.unc.edu Abstract. This paper presents a framework for the abstract interpretation of processes that pass values. We define a process description language that is parameterized with respect to the set of values that processes may exchange and show that an abstraction over values induces an abstract semantics for processes. Our main results state that if the abstract value interpretation safely/optimally approximates the ground interpretation, then the resulting abstracted processes safely/optimally approximate those derived from the ground semantics (in a precisely defined sense). As the processes derived from an abstract semantics in general have far fewer states than those derived from a concrete sem...
A FrontEnd Generator for Verification Tools
, 1995
"... This paper describes the Process Algebra Compiler (PAC), a frontend generator for processalgebrabased verification tools. Given descriptions of a process algebra's concrete and abstract syntax and semantics as structural operational rules, the PAC produces syntactic routines and functions fo ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
This paper describes the Process Algebra Compiler (PAC), a frontend generator for processalgebrabased verification tools. Given descriptions of a process algebra's concrete and abstract syntax and semantics as structural operational rules, the PAC produces syntactic routines and functions for computing the semantics of programs in the algebra. Using this tool greatly simplies the task of adapting verification tools to the analysis of systems described in different languages; it may therefore be used to achieve sourcelevel compatibility between different verication tools. Although the initial verication tools targeted by the PAC are MAUTO and the Concurrency Workbench, the structure of the PAC caters for the support of other tools as well.
Simulation Revisited
 In In Proc. 7th Intern. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’01), LNCS 2031
, 2001
"... This paper develops an ecient algorithm for determining when one system is capable of simulating the behavior of another. The method combines an iterative algorithm for computing behavioral preorders with an algorithm that simultaneously computes the bisimulation equivalence classes of the syste ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
This paper develops an ecient algorithm for determining when one system is capable of simulating the behavior of another. The method combines an iterative algorithm for computing behavioral preorders with an algorithm that simultaneously computes the bisimulation equivalence classes of the systems in question. Experimental data indicate that the new routine dramatically outperforms the bestknown algoritm for computing simulation, even when the systems are minimized with respect to bisimulation before the simulation algorithm is invoked.
Verification Tools from the CONCUR project
 EATCS Bulletin
, 1992
"... this paper. ..."
(Show Context)
Behavioural models for distributed fractal components
 Proc. of the IEEE
"... apport de recherche ..."
(Show Context)
A Concurrent Model for Linear Logic
"... We build a realizability model for linear logic using a namepassing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and modal logics, and yields a new type system for process calculi that ensures termination while allowing significantly con ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We build a realizability model for linear logic using a namepassing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and modal logics, and yields a new type system for process calculi that ensures termination while allowing significantly concurrent behaviours. Then we study how embeddings of intuitionistic and classical logics into linear logic induce typed translations of λ and λµ calculi in which new concurrent instructions can be introduced, thus sketching the basis for a CurryHoward interpretation of linear and classical proofs in terms of concurrent interaction.
A Theory of Testing for Markovian Processes
 in Proc. of the 11th Int. Conf. on Concurrency Theory (CONCUR 2000), LNCS 1877:305319, State College (PA
, 2000
"... . We present a testing theory for Markovian processes in order to formalize a notion of efficiency which may be useful for the analysis of soft real time systems. Our Markovian testing theory is shown to enjoy close connections with the classical testing theory of De NicolaHennessy and the proba ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
. We present a testing theory for Markovian processes in order to formalize a notion of efficiency which may be useful for the analysis of soft real time systems. Our Markovian testing theory is shown to enjoy close connections with the classical testing theory of De NicolaHennessy and the probabilistic testing theory of CleavelandSmolka et al. The Markovian testing equivalence is also shown to be coarser than the Markovian bisimulation equivalence. A fully abstract characterization is developed to ease the task of establishing testing related relationships between Markovian processes. It is then demonstrated that our Markovian testing equivalence, which is based on the (easier to work with) probability of executing a successful computation whose average duration is not greater than a given amount of time, coincides with the Markovian testing equivalence based on the (more intuitive) probability of reaching success within a given amount of time. Finally, it is shown that...
On Automatically Explaining Bisimulation Inequivalence
 Proceedings of the 2nd International Workshop on Computer Aided Verification, Lecture Notes In Computer Science; Vol. 531
, 1990
"... This paper describes a technique for generating a logical formula that differentiates between two bisimulationinequivalent finitestate systems. The method works in conjunction with a partitionrefinement algorithm for computing bisimulation equivalence and yields formulas that are often minimal ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
This paper describes a technique for generating a logical formula that differentiates between two bisimulationinequivalent finitestate systems. The method works in conjunction with a partitionrefinement algorithm for computing bisimulation equivalence and yields formulas that are often minimal in a precisely defined sense.
Processes as formal power series: a coinductive approach to denotational semantics
 TCS
, 2006
"... We characterize must testing equivalence on CSP in terms of the unique homomorphism from the Moore automaton of CSP processes to the final Moore automaton of partial formal power series over a certain semiring. The final automaton is then turned into a CSPalgebra: operators and fixpoints are define ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
(Show Context)
We characterize must testing equivalence on CSP in terms of the unique homomorphism from the Moore automaton of CSP processes to the final Moore automaton of partial formal power series over a certain semiring. The final automaton is then turned into a CSPalgebra: operators and fixpoints are defined, respectively, via behavioural differential equations and simulation relations. This structure is then shown to be preserved by the final homomorphism. As a result, we obtain a fully abstract compositional model of CSP phrased in purely settheoretical terms.
Comparing Refinements for Failure and Bisimulation Semantics
 Fundam. Inf
, 2000
"... Abstract. Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics refinement is based on simulations between labelled transition systems, whereas in failure semantics refinement is based on inclusions between decorated traces system ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics refinement is based on simulations between labelled transition systems, whereas in failure semantics refinement is based on inclusions between decorated traces systems. There exist however pairs of refinements, for bisimulation and failure semantics respectively, that have almost the same properties. Furthermore, each refinement in bisimulation semantics implies its counterpart in failure semantics, and conversely each refinement in failure semantics implies its counterpart in bisimulation semantics defined on the canonical form of the compared processes.