Sciweavers

1557 search results - page 2 / 312
» Programming up to Congruence
Sort
View
ICALP
2003
Springer
15 years 3 months ago
Bisimulation Proof Methods for Mobile Ambients
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
Massimo Merro, Francesco Zappa Nardelli
FMICS
2010
Springer
14 years 10 months ago
Range Analysis of Microcontroller Code Using Bit-Level Congruences
Bitwise instructions, loops and indirect data access pose difficult challenges to the verification of microcontroller programs. In particular, it is necessary to show that an indir...
Jörg Brauer, Andy King, Stefan Kowalewski
NJC
2006
86views more  NJC 2006»
14 years 10 months ago
Axiomatizing Binding Bigraphs
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove tha...
Troels Christoffer Damgaard, Lars Birkedal
69
Voted
ENTCS
2008
89views more  ENTCS 2008»
14 years 10 months ago
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in so...
Sylvain Conchon, Evelyne Contejean, Johannes Kanig...