Sciweavers

286 search results - page 51 / 58
» Pitfalls in Formal Reasoning about Security Protocols
Sort
View
AGTIVE
2007
Springer
15 years 1 months ago
Transforming Timeline Specifications into Automata for Runtime Monitoring
Abstract. In runtime monitoring, a programmer specifies code to execute whenever a sequence of events occurs during program execution. Previous and related work has shown that runt...
Eric Bodden, Hans Vangheluwe
APN
2010
Springer
15 years 2 months ago
Wendy: A Tool to Synthesize Partners for Services
Service-oriented computing proposes services as building blocks which can be composed to complex systems. To reason about the correctness of a service, its communication protocol n...
Niels Lohmann, Daniela Weinberg
POPL
2006
ACM
15 years 9 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
TPHOL
2009
IEEE
15 years 4 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
POPL
2006
ACM
15 years 9 months ago
Harmless advice
This paper defines an object-oriented language with harmless aspect-oriented advice. A piece of harmless advice is a computation that, like ordinary aspect-oriented advice, execut...
Daniel S. Dantas, David Walker