Sciweavers

57 search results - page 10 / 12
» Specialising Logic Programs with Respect to Call
Sort
View
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 7 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
KBSE
2007
IEEE
14 years 28 days ago
Evacon: a framework for integrating evolutionary and concolic testing for object-oriented programs
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
Kobi Inkumsah, Tao Xie
JAR
2008
89views more  JAR 2008»
13 years 6 months ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff
CP
2007
Springer
14 years 24 days ago
The Log-Support Encoding of CSP into SAT
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Marco Gavanelli
WIESS
2000
13 years 8 months ago
Dynamic Memory Management with Garbage Collection for Embedded Applications
A software system can be called a safe-system with respect to memory, when it supports only strong-typing and it does not allow for the manual disposal of dynamic memory [2]. The ...
Roberto Brega, Gabrio Rivera