Sciweavers

44 search results - page 1 / 9
» Security Theorems via Model Theory
Sort
View
CORR
2009
Springer
55views Education» more  CORR 2009»
13 years 3 months ago
Security Theorems via Model Theory
Joshua D. Guttman
JSYML
2007
79views more  JSYML 2007»
13 years 5 months ago
Models of non-well-founded sets via an indexed final coalgebra theorem
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
Federico De Marchi, Benno van den Berg
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
13 years 9 months ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh
FROCOS
2007
Springer
13 years 11 months ago
Combining Algorithms for Deciding Knowledge in Security Protocols
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Mathilde Arnaud, Véronique Cortier, St&eacu...
POPL
2010
ACM
14 years 2 months ago
A Theory of Indirection via Approximation
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
Aquinas Hobor, Robert Dockins, Andrew W. Appel