1302 search results - page 99 / 261 » Free-Style Theorem Proving |
116
click to vote
TAP
2010
Springer
15 years 2 months ago
2010
Springer
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
121
click to vote
VSTTE
2010
Springer
15 years 2 months ago
2010
Springer
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...
117
click to vote
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
We define the notions of a canonical inference rule and a canonical constructive system in the framework of strict single-conclusion Gentzen-type systems (or, equivalently, natural...
135
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
155
click to vote
INFORMS
2010
15 years 1 months ago
2010
use for constraint solving, abstract interpretation, spatial databases, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction a...