4850 search results - page 192 / 970 » Proof and Computation in Geometry |
175
click to vote
FOSSACS
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
160
click to vote
ICFP
1999
ACM
15 years 11 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
173
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. In this work we propose an alternative approach to inference in DLLite, based on a reduction to reasoning in an extension of function-free Horn Logic (EHL). We develop a ...
154
click to vote
DIMVA
2010
15 years 8 months ago
2010
We present Conqueror, a software-based attestation scheme for tamper-proof code execution on untrusted legacy systems. Beside providing load-time attestation of a piece of code, Co...
196
click to vote
JAR
2008
15 years 6 months ago
2008
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...