481 search results - page 31 / 97 » Executing Higher Order Logic |
116
click to vote
CORR
2004
Springer
15 years 20 days ago
2004
Springer
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
115
Voted
ISSTA
2010
ACM
15 years 2 months ago
2010
ACM
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
115
click to vote
TAP
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This paper extends dynamic symbolic execution to distributed and concurrent systems. Dynamic symbolic execution can be used in software testing to systematically identify...
130
Voted
ICFP
2010
ACM
15 years 1 months ago
2010
ACM
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
100
Voted
ICLP
2004
Springer
15 years 6 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...