290 search results - page 22 / 58 » Theorem Proving Using Lazy Proof Explication |
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
81
Voted
LICS
2008
IEEE
15 years 3 months ago
2008
IEEE
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
77
Voted
MKM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In a problem solving process, a step may not result in the expected progress or may not be applicable as expected. Hence, knowledge how to overcome and react to impasses ...
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
104
click to vote
LATIN
2004
Springer
15 years 2 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...