10715 search results - page 367 / 2143 » Proofs from Tests |
190
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
202
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
210
click to vote
FLOPS
2010
Springer
16 years 1 months ago
2010
Springer
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
178
click to vote
TASE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
172
click to vote
ESOP
2007
Springer
16 years 1 months ago
2007
Springer
There is a growing concern on anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, importance of probabilis...