322 search results - page 8 / 65 » Combinations of Abstract Domains for Logic Programming |
114
Voted
FROCOS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quanti...
123
Voted
SAS
2010
Springer
15 years 2 months ago
2010
Springer
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
156
Voted
AMAI
2008
Springer
15 years 3 months ago
2008
Springer
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, ...
114
Voted
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
The actions of a robot like lifting an object are often best thought of as low-level processes with uncertain outcome. A highlevel robot plan can be seen as a description of a task...
247
Voted
POPL
2008
ACM
16 years 4 months ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...