Sciweavers

846 search results - page 45 / 170
» Rewrite-Based Decision Procedures
Sort
View
CADE
2009
Springer
14 years 10 months ago
Computing Knowledge in Security Protocols under Convergent Equational Theories
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
Stéphanie Delaune, Stefan Ciobâca, St...
CADE
2001
Springer
14 years 10 months ago
Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
Jörg Lücke
TPHOL
2009
IEEE
14 years 4 months ago
Extended First-Order Logic
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
Chad E. Brown, Gert Smolka
CONCUR
2005
Springer
14 years 3 months ago
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
Abstract. We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and...
Sibylle B. Fröschle, Slawomir Lasota
CCS
1999
ACM
14 years 2 months ago
Proof-Carrying Authentication
We have designed and implemented a general and powerful distributed authentication framework based on higher-order logic. Authentication frameworks — including Taos, SPKI, SDSI,...
Andrew W. Appel, Edward W. Felten