322 search results - page 25 / 65 » Combinations of Abstract Domains for Logic Programming |
127
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
143
click to vote
ESOP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
138
click to vote
POPL
2011
ACM
14 years 6 months ago
2011
ACM
We consider programs for embedded real-time systems which use priority-driven preemptive scheduling with task priorities adjusted dynamically according to the immediate ceiling pr...
139
click to vote
ASP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The paper describes HıLεX, a new ASP-based system for the extraction of information from unstructured documents. Unlike previous systems, which are mainly syntactic, H...
131
click to vote
PPDP
2004
Springer
15 years 9 months ago
2004
Springer
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...