Sciweavers

183 search results - page 18 / 37
» Trace Semantics is Fully Abstract
Sort
View
ICALP
2004
Springer
15 years 2 months ago
Syntactic Control of Concurrency
Abstract. We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown t...
Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
JELIA
1990
Springer
15 years 1 months ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira
FUIN
2002
63views more  FUIN 2002»
14 years 9 months ago
Probabilistic Cluster Unfoldings
Abstract. This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets, with no structural or safety assumptions, g...
Stefan Haar
PLDI
2010
ACM
15 years 2 months ago
Traceable data types for self-adjusting computation
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifica...
Umut A. Acar, Guy E. Blelloch, Ruy Ley-Wild, Kanat...
SP
2008
IEEE
132views Security Privacy» more  SP 2008»
14 years 8 months ago
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
Michael Backes, Matteo Maffei, Dominique Unruh