Sciweavers

322 search results - page 8 / 65
» Combinations of Abstract Domains for Logic Programming
Sort
View
FROCOS
2007
Springer
15 years 5 months ago
Idempotent Transductions for Modal Logics
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...
Tim French
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
14 years 10 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
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...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
114
Voted
AMAI
2008
Springer
14 years 11 months ago
Integrating answer set programming and constraint logic programming
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, ...
Veena S. Mellarkod, Michael Gelfond, Yuanlin Zhang
ECAI
2000
Springer
15 years 4 months ago
Turning High-Level Plans into Robot Programs in Uncertain Domains
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...
Henrik Grosskreutz, Gerhard Lakemeyer
POPL
2008
ACM
15 years 12 months ago
Relational inductive shape analysis
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...
Bor-Yuh Evan Chang, Xavier Rival