4573 search results - page 486 / 915 » Automated Reasoning |
169
click to vote
TPHOL
2007
IEEE
16 years 12 days ago
2007
IEEE
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
153
click to vote
TPHOL
2007
IEEE
16 years 12 days ago
2007
IEEE
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...
138
click to vote
CSL
2007
Springer
16 years 9 days ago
2007
Springer
We define strong monads of continuous (lower, upper) previsions, and of forks, modeling both probabilistic and non-deterministic choice. This is an elegant alternative to recent p...
136
click to vote
CSL
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. We present a method of integrating linear rational arithmetic into superposition calculus for first-order logic. One of our main results is completeness of the resulting...
126
click to vote
CSL
2007
Springer
16 years 9 days ago
2007
Springer
We provide a new correctness criterion for unit-free MLL proof structures and MELL proof structures with units. We prove that deciding the correctness of a MLL and of a MELL proof ...