3228 search results - page 289 / 646 » Computationally Sound Proofs |
142
click to vote
CADE
2000
Springer
15 years 9 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 ...
121
Voted
TABLEAUX
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...
139
Voted
TPHOL
1998
IEEE
15 years 8 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...
125
Voted
ESOP
2010
Springer
15 years 7 months ago
2010
Springer
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...
151
click to vote
DLT
2010
15 years 6 months ago
2010
We study the inclusion problems for pattern languages that are generated by patterns with a bounded number of variables. This continues the work by Freydenberger and Reidenbach (In...