4850 search results - page 375 / 970 » Proof and Computation in Geometry |
180
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 ...
161
click to vote
TABLEAUX
1999
Springer
15 years 11 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 -...
177
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...
172
click to vote
KR
1994
Springer
15 years 11 months ago
1994
Springer
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
161
click to vote
ESOP
2010
Springer
15 years 10 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...