322 search results - page 46 / 65 » Combinations of Abstract Domains for Logic Programming |
SAS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
101
click to vote
PADO
2001
Springer
15 years 4 months ago
2001
Springer
nt Abstractions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 J¨orgen Gustavsson, Josef Svenningsson Implementing Circularity Using Pa...
ATVA
2010
Springer
15 years 25 days ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
144
click to vote
FCA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
100
click to vote
ICLP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...