Sciweavers

197 search results - page 26 / 40
» Reduction Semantics and Formal Analysis of Orc Programs
Sort
View
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 2 days ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
CCS
2004
ACM
15 years 5 months ago
Authenticity by tagging and typing
We propose a type and effect system for authentication protocols built upon a tagging scheme that formalizes the intended semantics of ciphertexts. The main result is that the val...
Michele Bugliesi, Riccardo Focardi, Matteo Maffei
POPL
2011
ACM
14 years 2 months ago
Pick your contexts well: understanding object-sensitivity
ensitivity has emerged as an excellent context abstraction for points-to analysis in object-oriented languages. Despite its practical success, however, object-sensitivity is poorl...
Yannis Smaragdakis, Martin Bravenboer, Ondrej Lhot...
POPL
2004
ACM
15 years 5 months ago
Summarizing procedures in concurrent programs
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof
CCS
2008
ACM
15 years 1 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung