967 search results - page 124 / 194 » Probabilistic Predicative Programming |
197
Voted
SIGSOFT
2010
ACM
15 years 12 days ago
2010
ACM
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
128
click to vote
AIPS
2007
15 years 4 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
145
Voted
FLAIRS
2008
15 years 4 months ago
2008
Combining probability and first-order logic has been the subject of intensive research during the last ten years. The most well-known formalisms combining probability and some sub...
98
Voted
ICFP
2008
ACM
16 years 2 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
154
click to vote
PVLDB
2008
15 years 2 months ago
2008
We propose EndoScope, a software monitoring framework that allows users to pose declarative queries that monitor the state and performance of running programs. Unlike most existin...