Sciweavers

2152 search results - page 188 / 431
» On Automating the Calculus of Relations
Sort
View
ICFP
2008
ACM
16 years 6 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
CSFW
2009
IEEE
16 years 1 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
RTA
2009
Springer
16 years 1 months ago
YAPA: A Generic Tool for Computing Intruder Knowledge
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
Mathieu Baudet, Véronique Cortier, St&eacut...
BIRTHDAY
2005
Springer
16 years 1 days ago
Compiled Labelled Deductive Systems for Access Control
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci’s tablea...
Krysia Broda, Alessandra Russo
FTRTFT
1998
Springer
15 years 10 months ago
Operational and Logical Semantics for Polling Real-Time Systems
PLC-Automata are a class of real-time automata suitable to describe the behavior of polling real-time systems. PLC-Automata can be compiled to source code for PLCs, a hardware wide...
Henning Dierks, Ansgar Fehnker, Angelika Mader, Fr...