Sciweavers

4401 search results - page 848 / 881
» Computing with Default Logic
Sort
View
POPL
2006
ACM
14 years 9 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
POPL
2005
ACM
14 years 9 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
CADE
2001
Springer
14 years 9 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 9 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
14 years 8 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...