Sciweavers

2308 search results - page 132 / 462
» Representing Symbolic Reasoning
Sort
View
ICALP
2005
Springer
15 years 12 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
CCL
1994
Springer
15 years 10 months ago
On Modularity in Term Rewriting and Narrowing
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
Christian Prehofer
CADE
1990
Springer
15 years 10 months ago
A Theorem Prover for a Computational Logic
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
Robert S. Boyer, J. Strother Moore
LICS
1990
IEEE
15 years 10 months ago
Model-Checking for Real-Time Systems
E cient automatic model checking algorithms for real-time systems have been obtained in recent years based on the state region graph technique of Alur, Courcoubetis and Dill. Howev...
Rajeev Alur, Costas Courcoubetis, David L. Dill
ATVA
2006
Springer
140views Hardware» more  ATVA 2006»
15 years 10 months ago
On the Construction of Fine Automata for Safety Properties
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
Orna Kupferman, Robby Lampert