188 search results - page 37 / 38 » Logic of Proofs for Bounded Arithmetic |
82
Voted
EMSOFT
2007
Springer
15 years 5 months ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
93
Voted
JACM
2000
14 years 11 months ago
2000
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
ASIACRYPT
2001
Springer
15 years 4 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
133
click to vote
CSFW
1999
IEEE
15 years 4 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
106
click to vote
ALT
1995
Springer
15 years 3 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...