Sciweavers

1342 search results - page 26 / 269
» Ordered Programs as Abductive Systems
Sort
View
ICFP
2012
ACM
11 years 9 months ago
Introspective pushdown analysis of higher-order programs
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
Christopher Earl, Ilya Sergey, Matthew Might, Davi...
ASP
2003
Springer
14 years 21 days ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
13 years 11 months ago
Higher Order Demand Propagation
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
Dirk Pape
CLIMA
2004
13 years 8 months ago
Dynamic Logic Programming: Various Semantics Are Equal on Acyclic Programs
Abstract. Multidimensional dynamic logic programs (MDLPs) are suitable to represent knowledge dynamic in time, or more generally, information coming from various sources, partially...
Martin Homola
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
13 years 11 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill