Sciweavers

899 search results - page 109 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
LPNMR
2004
Springer
15 years 5 months ago
Reasoning About Actions and Change in Answer Set Programming
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...
Yannis Dimopoulos, Antonis C. Kakas, Loizos Michae...
ICLP
2010
Springer
15 years 4 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
Mario Alviano
102
Voted
ENTCS
2008
140views more  ENTCS 2008»
15 years 17 days ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
111
Voted
LISP
2008
96views more  LISP 2008»
15 years 14 days ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
106
Voted
ESOP
2009
Springer
15 years 7 months ago
A Basis for Verifying Multi-threaded Programs
Abstract. Advanced multi-threaded programs apply concurrency concepts in sophisticated ways. For instance, they use fine-grained locking to increase parallelism and change locking...
K. Rustan M. Leino, Peter Müller