Sciweavers

1763 search results - page 112 / 353
» A Formalization of Polytime Functions
Sort
View
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
14 years 8 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King
FMICS
2010
Springer
14 years 8 months ago
A Study of Shared-Memory Mutual Exclusion Protocols Using CADP
Mutual exclusion protocols are an essential building block of concurrent systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurr...
Radu Mateescu, Wendelin Serwe
FORTE
2009
14 years 7 months ago
The Orc Programming Language
Orc was originally presented as a process calculus. It has now evolved into a full programming language, which we describe in this paper. The language has the structure and feel of...
David Kitchin, Adrian Quark, William R. Cook, Jaya...
FOCS
2005
IEEE
15 years 3 months ago
On the Impossibility of Obfuscation with Auxiliary Input
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...
Shafi Goldwasser, Yael Tauman Kalai
CCS
2009
ACM
15 years 4 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal