1679 search results - page 8 / 336 » Strong order equivalence |
98
Voted
POPL
2010
ACM
15 years 9 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
69
Voted
COMBINATORICA
2008
14 years 12 months ago
2008
Cyclic orders of graphs and their equivalence have been promoted by Bessy and Thomass
FMCAD
2004
Springer
15 years 5 months ago
2004
Springer
This paper describes a new method that is useful in combinational equivalence checking with very challenging industrial designs. The method does not build a miter; instead it build...
ERSHOV
2009
Springer
15 years 6 months ago
2009
Springer
One of the applications of supercompilation is proving properties
of programs.We focus in this paper on a speci c task: proving term
equivalence for a higher-order lazy functiona...
CAV
2009
Springer
16 years 8 days ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...