4401 search results - page 299 / 881 » Computing with Default Logic |
173
click to vote
CADE
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
170
click to vote
TPHOL
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
199
click to vote
ASIAN
2006
Springer
15 years 10 months ago
2006
Springer
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
140
click to vote
ICCD
1991
IEEE
15 years 10 months ago
1991
IEEE
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
148
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...