Sciweavers

138 search results - page 19 / 28
» Logical Concurrency Control From Sequential Proofs
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
14 years 3 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
WSC
1997
13 years 11 months ago
AutoMod Tutorial
The AutoModTM simulation system differs significantly from other systems because of its ability to deal with the physical elements of a system in physical (graphical) terms and th...
Matthew W. Rohrer
LICS
2010
IEEE
13 years 8 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...
TPHOL
2007
IEEE
14 years 4 months ago
Using XCAP to Certify Realistic Systems Code: Machine Context Management
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...
Zhaozhong Ni, Dachuan Yu, Zhong Shao
JFLP
2002
81views more  JFLP 2002»
13 years 9 months ago
A Practical Partial Evaluation Scheme for Multi-Paradigm Declarative Languages
We present a practical partial evaluation scheme for multi-paradigm declarative languages combining features from functional, logic, and concurrent programming. In contrast to pre...
Elvira Albert, Michael Hanus, Germán Vidal