Sciweavers

780 search results - page 129 / 156
» Compositional Quantitative Reasoning
Sort
View
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
CSL
2007
Springer
14 years 2 months ago
Relativizing Small Complexity Classes and Their Theories
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
Klaus Aehlig, Stephen Cook, Phuong Nguyen
FMCO
2007
Springer
118views Formal Methods» more  FMCO 2007»
14 years 2 months ago
Coordination: Reo, Nets, and Logic
This article considers the coordination language Reo, a Petri net variant called zero-safe nets, and intuitionistic temporal linear logic (ITLL). The first part examines the seman...
Dave Clarke
ICLP
2007
Springer
14 years 2 months ago
Declarative Diagnosis of Temporal Concurrent Constraint Programs
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
Moreno Falaschi, Carlos Olarte, Catuscia Palamides...
LPAR
2007
Springer
14 years 2 months ago
How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
Yevgeny Kazakov, Ulrike Sattler, Evgeny Zolin