967 search results - page 105 / 194 » Probabilistic Predicative Programming |
148
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
113
click to vote
ICML
1996
IEEE
16 years 3 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
118
click to vote
VMCAI
2010
Springer
16 years 2 days ago
2010
Springer
Shape analyses (Chase et al. 1990, Sagiv et al. 2002) discover properties of dynamic and/or mutable structures. We ask, "Is there an equivalent to shape analysis for purely fu...
134
click to vote
SIGSOFT
2003
ACM
15 years 8 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
124
click to vote
RP
2009
Springer
15 years 7 months ago
2009
Springer
Counterexamples for Non-disjunctive ions K. L. McMillan1 and L. D. Zuck2 1 Cadence Research Labs 2 University of Illinois at Chicago Counterexample-guided abstraction refinement (...