322 search results - page 36 / 65 » Combinations of Abstract Domains for Logic Programming |
150
Voted
KBSE
2007
IEEE
15 years 10 months ago
2007
IEEE
We describe EUREKA, a symbolic model checker for Linear Programs with arrays, i.e. programs where variables and array elements range over a numeric domain and expressions involve ...
118
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
151
click to vote
TPHOL
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
124
Voted
PPDP
2005
Springer
15 years 9 months ago
2005
Springer
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
210
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...