4192 search results - page 488 / 839 » Probabilistic Logic Programming |
182
click to vote
CORR
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
136
click to vote
ENTCS
2007
15 years 4 months ago
2007
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...
241
click to vote
PADL
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Boyer and Moore's ACL2 theorem prover combines firstorder applicative Common Lisp with a computational, first-order logic. While ACL2 has become popular and is being...
125
Voted
FM
2009
Springer
15 years 11 months ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
146
click to vote
LOPSTR
2009
Springer
15 years 11 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...