Sciweavers

5904 search results - page 350 / 1181
» Requirements for a Composition Language
Sort
View
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
15 years 5 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
ICALP
2007
Springer
15 years 8 months ago
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
Aggelos Kiayias, Hong-Sheng Zhou
PODS
2005
ACM
104views Database» more  PODS 2005»
16 years 7 months ago
Views and queries: determinacy and rewriting
We investigate the question of whether a query can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines if V pr...
Luc Segoufin, Victor Vianu
DEBS
2009
ACM
16 years 1 months ago
Event-based applications and enabling technologies
Event processing has become the paradigm of choice in many monitoring and reactive applications. However, the understanding of events, their composition and level of abstraction, ...
Annika Hinze, Kai Sachs, Alejandro P. Buchmann
HICSS
2007
IEEE
145views Biometrics» more  HICSS 2007»
16 years 1 months ago
Next-Generation Software Engineering: Function Extraction for Computation of Software Behavior
The ultra-large-scale systems of the future require the transformation of software engineering into a computational discipline capable of fast and dependable software development....
Richard C. Linger, Mark G. Pleszkoch, Luanne Burns...