61 search results - page 5 / 13 » On Resolution Proofs for Combinational Equivalence |
FM
2006
Springer
15 years 3 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...
72
Voted
LICS
2007
IEEE
15 years 6 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...
193
click to vote
CADE
2011
Springer
13 years 11 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
14 years 11 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...
101
Voted
LICS
2010
IEEE
14 years 10 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 ...