756 search results - page 117 / 152 » Using Logic Programs to Reason about Infinite Sets |
PLDI
2003
ACM
14 years 1 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
VMCAI
2007
Springer
14 years 2 months ago
2007
Springer
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
SIGSOFT
2009
ACM
14 years 9 months ago
2009
ACM
The trend towards processors with more and more parallel cores is increasing the need for software that can take advantage of parallelism. The most widespread method for writing p...
ICLP
1999
Springer
14 years 23 days ago
1999
Springer
Concurrency in Logic Programming has received much attention in the past. One problem with many proposals, when applied to Prolog, is that they involve large modifications to the...
EMSOFT
2006
Springer
14 years 4 days ago
2006
Springer
A key problem for effective unit testing is the difficulty of partitioning large software systems into appropriate units that can be tested in isolation. We present an approach th...