322 search results - page 42 / 65 » Combinations of Abstract Domains for Logic Programming |
130
Voted
CADE
2007
Springer
16 years 4 months ago
2007
Springer
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
130
Voted
SEMWEB
2007
Springer
15 years 9 months ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....
105
Voted
ACSAC
1999
IEEE
15 years 8 months ago
1999
IEEE
Secure enterprise programming is a difficult and tedious task. Programmers need tools that support t levels of abstraction and that track all the components that participate in di...
114
Voted
CAV
2007
Springer
15 years 10 months ago
2007
Springer
We present Hector, a software tool for combining different abstraction methods to extract sound models of heap-manipulating imperative programs with recursion. Extracted models ma...
148
Voted
ISSTA
2010
ACM
15 years 5 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...