Sciweavers

2308 search results - page 125 / 462
» Representing Symbolic Reasoning
Sort
View
ELP
1993
15 years 10 months ago
Finitary Partial Inductive Definitions as a General Logic
We describe how the calculus of partial inductive definitions is used to represent logics. This calculus includes the powerful principle of definitional reflection. We describe two...
Lars-Henrik Eriksson
DLOG
2003
15 years 7 months ago
Rule Based Computation of Updates to Terminologies
In this paper we formalise compilation of the conjunctive bodies of a restricted class of Horn rules into updates on terminologies. This involves a pre-processing of the graphs re...
Sanjay Modgil
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
16 years 3 months ago
Generating Monitor Circuits for Simulation-Friendly GSTE Assertion Graphs
Formal and dynamic (simulation, emulation, etc.) verification techniques are both needed to deal with the overall challenge of verification. Ideally, the same specification/tes...
Kelvin Ng, Alan J. Hu, Jin Yang
TPHOL
2009
IEEE
16 years 1 months ago
Formalising Observer Theory for Environment-Sensitive Bisimulation
Abstract. We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the kno...
Jeremy E. Dawson, Alwen Tiu
ICALP
2005
Springer
15 years 12 months ago
Password-Based Encryption Analyzed
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
Martín Abadi, Bogdan Warinschi