61 search results - page 5 / 13 » On Resolution Proofs for Combinational Equivalence |
FM
2006
Springer
13 years 10 months ago
2006
Springer
This paper presents the formal verification of a compiler front-end that translates a subset of the C language into the Cminor intermediate language. The semantics of the source an...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
CADE
2011
Springer
12 years 7 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
ENTCS
2007
13 years 7 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...