Sciweavers

54 search results - page 10 / 11
» On the Concurrent Composition of Zero-Knowledge Proofs
Sort
View
ICFP
1996
ACM
13 years 11 months ago
A Theory of Weak Bisimulation for Core CML
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
William Ferreira, Matthew Hennessy, Alan Jeffrey
CONCUR
2004
Springer
14 years 26 days ago
An Extensional Spatial Logic for Mobile Processes
Existing spatial logics for concurrency are intensional, in the sense that they induce an equivalence that coincides with structural congruence. In this work, we study a contextual...
Daniel Hirschkoff
CC
2010
Springer
172views System Software» more  CC 2010»
14 years 2 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
FUIN
2008
123views more  FUIN 2008»
13 years 7 months ago
Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...
Shahram Esmaeilsabzali, Nancy A. Day, Farhad Mavad...
LICS
2009
IEEE
14 years 2 months ago
Psi-calculi: Mobile Processes, Nominal Data, and Logic
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...