#### Filter Results:

- Full text PDF available (49)

#### Publication Year

1985

2017

- This year (2)
- Last 5 years (31)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard
- Sci. Comput. Program.
- 1998

Many static analyses for declarative programming/database languages use Boolean functions to express dependencies among variables or argument positions. Examples include groundness analysis, arguably the most important analysis for logic programs, niteness analysis and functional dependency analysis for databases. We identify two classes of Boolean… (More)

- Neil D. Jones, Peter Sestoft, Harald Søndergaard
- RTA
- 1985

The present paper is an extended abstract of (Jones 1985), in which a running , non-trivial partial evaluator is described. As far as we know, this partia l evaluator is the first which has been used in practice to transform interpreters into corresponding stand-alone compilers, or to generate a compile r generator by transforming itself. A partial… (More)

- Kim Marriott, Harald Søndergaard, Neil D. Jones
- ACM Trans. Program. Lang. Syst.
- 1994

Logic-programming languages are based on a principle of separation “logic” and “control.”. This means that they can be given simple model-theoretic semantics without regard to any particular execution mechanism (or proof procedure, viewing execution as theorem proving). Although the separation is desirable from a semantical point of… (More)

- Neil D. Jones, Peter Sestoft, Harald Søndergaard
- Lisp and Symbolic Computation
- 1989

- Kim Marriott, Harald Søndergaard
- LOPLAS
- 1993

We show how precise groundness information can be extracted from logic programs. The idea is to use abstract interpretation with Boolean functions as “approximations” to groundness dependencies between variables. This idea is not new, and different classes of Boolean functions have been used. We argue, however, that one class, the… (More)

- Chris Speirs, Zoltan Somogyi, Harald Søndergaard
- SAS
- 1997

Since the late eighties, much progress has been made in the theory of termination analysis for logic programs. However, from a practical point of view, the signiicance of much of the work on termination is hard to judge, since experimental evaluations rarely get published. Here we describe and evaluate a termination analyzer for Mercury, a strongly typed… (More)

Relational numeric abstract domains are very important in program analysis. Common domains, such as Zones and Octagons, are usually conceptualised with weighted digraphs and implemented using difference-bound matrices (DBMs). Unfortunately, though conceptually simple, direct implementations of graph-based domains tend to perform poorly in practice, and are… (More)

We revisit relational static analysis of numeric variables. Such analyses face two difficulties. First, even inexpensive relational domains scale too poorly to be practical for large code-bases. Second, to remain tractable they have extremely coarse handling of non-linear relations. In this paper, we introduce the subterm domain, a weakly relational… (More)

- Harald Søndergaard
- ESOP
- 1986