Sciweavers

630 search results - page 111 / 126
» Combining Two Formalism for Reasoning about Concepts
Sort
View
PLDI
2009
ACM
14 years 3 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
SIGIR
2008
ACM
13 years 8 months ago
Discriminative probabilistic models for passage based retrieval
The approach of using passage-level evidence for document retrieval has shown mixed results when it is applied to a variety of test beds with different characteristics. One main r...
Mengqiu Wang, Luo Si
SRDS
2006
IEEE
14 years 2 months ago
Solving Consensus Using Structural Failure Models
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring
CP
2004
Springer
14 years 2 months ago
Controllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
Francesca Rossi, Kristen Brent Venable, Neil Yorke...
PLDI
2003
ACM
14 years 2 months ago
A type and effect system for atomicity
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. Previous work addressed th...
Cormac Flanagan, Shaz Qadeer