Results 1 - 10 of 10,497

Testing Equivalences for Processes

by R. De Nicola, M. C. B. Hennessy - Theoretical Computer Science , 1984
"... Abstract. Given a set of processes and a set of tests on these processes we show how to define in a natural way three different eyuitalences on processes. ThesP equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models ha ..."
Abstract - Cited by 526 (37 self) - Add to MetaCart
Abstract. Given a set of processes and a set of tests on these processes we show how to define in a natural way three different eyuitalences on processes. ThesP equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models

Testing Equivalence as a Bisimulation Equivalence

by Rance Cleaveland , Matthew Hennessy - Formal Aspects of Computing , 1993
"... In this paper we show how the testing equivalences and preorders on transition systems may be interpreted as instances of generalized bisimulation equivalences and prebisimulation preorders. The characterization relies on defining transformations on the transition systems in such a way that the te ..."
Abstract - Cited by 81 (11 self) - Add to MetaCart
In this paper we show how the testing equivalences and preorders on transition systems may be interpreted as instances of generalized bisimulation equivalences and prebisimulation preorders. The characterization relies on defining transformations on the transition systems in such a way

Testing equivalence for mobile processes

by Michele Boreale, Rocco De Nicola - Proceedings of CONCUR ’92, LNCS 630 , 1995
"... Abst rac t. The impact of applying the testing approach to a calculus of processes with a dynamically changing structure is investigated. A proof system for the finite fragment of the calculus is introduced which consists of two groups of laws: those for strong observational equivalence and those ne ..."
Abstract - Cited by 71 (10 self) - Add to MetaCart
Abst rac t. The impact of applying the testing approach to a calculus of processes with a dynamically changing structure is investigated. A proof system for the finite fragment of the calculus is introduced which consists of two groups of laws: those for strong observational equivalence and those

Testing Equivalence Probabilistically

by Adnan Darwiche, Jinbo Huang - COMPUTER SCIENCE DEPARTMENT, UCLA , 2002
"... Although the equivalence of two Ordered Binary Decision Diagrams (OBDDs) can be decided in polynomial time, the equivalence of two Free Binary Decision Diagrams (FBDDs) is only known to be probabilistically decidable in polynomial time. FBDDs are a strict superset of OBDDs, and are more succinct ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
than OBDDs, which explains the interest in testing their equivalence. We show that the probabilistic equivalence test for FBDDs holds for the class of deterministic, decomposable negation normal forms (d-DNNFs), which forms a strict superset of FBDDs and is more succinct than FBDDs. Our

Trace and Testing Equivalence on Asynchronous Processes

by Michele Boreale, Rocco De Nicola, Rosario Pugliese - Information and Computation , 1999
"... We study trace and may-testing equivalences in the asynchronous versions of CCS and -calculus. We start from the operational definition of the may-testing preorder and provide for it finitary and fully abstract trace-based characterizations, along with a complete in-equational proof system. We also ..."
Abstract - Cited by 34 (5 self) - Add to MetaCart
We study trace and may-testing equivalences in the asynchronous versions of CCS and -calculus. We start from the operational definition of the may-testing preorder and provide for it finitary and fully abstract trace-based characterizations, along with a complete in-equational proof system. We also

Bisimulation through probabilistic testing

by Kim G. Larsen, Arne Skou - in “Conference Record of the 16th ACM Symposium on Principles of Programming Languages (POPL , 1989
"... We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily clos ..."
Abstract - Cited by 529 (14 self) - Add to MetaCart
close to one, between processes that are not bisimulation equivalent. We also show a similar result (in a slightly stronger form) for a new process relation called $-bisimulation-which lies strictly between that of simulation and bisimulation. Finally, the ultimately strength of the testing language

Using Field Experiments to Test Equivalence between Auction Formats: Magic on the Internet

by David Lucking-Reiley, Ann Bell, Jim Cox, Rachel Croson, Ron Harstad, Elton Hinshaw, John List, Preston Mcafee - Magic on the Internet. American Economic Review , 1999
"... William Vickrey's predicted equivalences between first-price sealed-bid and Dutch auctions, and between second-price sealed-bid and English auctions, are tested using field experiments that auctioned off collectible trading cards over the Internet. The results indicate that the Dutch auction ..."
Abstract - Cited by 192 (8 self) - Add to MetaCart
William Vickrey's predicted equivalences between first-price sealed-bid and Dutch auctions, and between second-price sealed-bid and English auctions, are tested using field experiments that auctioned off collectible trading cards over the Internet. The results indicate that the Dutch

KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs

by Cristian Cadar, Daniel Dunbar, Dawson Engler
"... We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentally-intensive programs. We used KLEE to thoroughly check all 89 stand-alone programs in the GNU COREUTILS utility suite, which form the cor ..."
Abstract - Cited by 557 (15 self) - Add to MetaCart
of the developers’ own hand-written test suite. When we did the same for 75 equivalent tools in the BUSYBOX embedded system suite, results were even better, including 100 % coverage on 31 of them. We also used KLEE as a bug finding tool, applying it to 452 applications (over 430K total lines of code), where

Testing for Common Trends

by James H. Stock, Mark W. Watson - Journal of the American Statistical Association , 1988
"... Cointegrated multiple time series share at least one common trend. Two tests are developed for the number of common stochastic trends (i.e., for the order of cointegration) in a multiple time series with and without drift. Both tests involve the roots of the ordinary least squares coefficient matrix ..."
Abstract - Cited by 464 (7 self) - Add to MetaCart
matrix obtained by regressing the series onto its first lag. Critical values for the tests are tabulated, and their power is examined in a Monte Carlo study. Economic time series are often modeled as having a unit root in their autoregressive representation, or (equivalently) as containing a stochastic

Symbolic Boolean manipulation with ordered binary-decision diagrams

by Randal E Bryant - ACM COMPUTING SURVEYS , 1992
"... Ordered Binary-Decision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as grap ..."
Abstract - Cited by 1036 (13 self) - Add to MetaCart
Ordered Binary-Decision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented
Results 1 - 10 of 10,497