Sciweavers

890 search results - page 31 / 178
» Programming language methods in computer security
Sort
View
CP
2005
Springer
15 years 6 months ago
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
101
Voted
PPDP
2005
Springer
15 years 6 months ago
Trace effects and object orientation
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
Christian Skalka
84
Voted
ICALP
2005
Springer
15 years 6 months ago
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
Mathieu Baudet, Véronique Cortier, Steve Kr...
97
Voted
FOAL
2008
ACM
15 years 2 months ago
Certificate translation for specification-preserving advices
Aspect Oriented Programming (AOP) has significant potential to separate functionality and cross-cutting concerns. In particular, AOP supports an incremental development process, i...
Gilles Barthe, César Kunz
97
Voted
PLDI
2006
ACM
15 years 6 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa