Sciweavers

441 search results - page 4 / 89
» A Method for Proving Observational Equivalence
Sort
View
BIRTHDAY
2005
Springer
14 years 1 months ago
Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...
Fabio Gadducci, Ugo Montanari
ACTA
2010
87views more  ACTA 2010»
13 years 7 months ago
On the observational theory of the CPS-calculus
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
Massimo Merro
ICCAD
2006
IEEE
128views Hardware» more  ICCAD 2006»
14 years 4 months ago
Improvements to combinational equivalence checking
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...
DAC
2008
ACM
14 years 8 months ago
Merging nodes under sequential observability
This paper presents a new type of sequential technology independent synthesis. Building on the previous notions of combinational observability and sequential equivalence, sequenti...
Michael L. Case, Victor N. Kravets, Alan Mishchenk...
LICS
2010
IEEE
13 years 6 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...