UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

A lattice of abstract graphs

Clark, D; Hankin, C; (1993) A lattice of abstract graphs. In: (pp. pp. 318-331).

Full text not available from this repository.

Abstract

© Springer-Verlag Berlin Heidelberg 1993. This paper concerns the abstract interpretation of Term Graph Rewriting systems. We introduce a new lattice of abstract graphs; this improves over previous work in that the ordering is defined directly on the graph structure rather than via unravelling into trees. We use the lattice in sketching the correctness of Nöcker’s abstract reduction algorithm; an efficient strictness analysis used in the Concurrent Clean system.

Type: Proceedings paper
Title: A lattice of abstract graphs
ISBN-13: 9783540571865
UCL classification: UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: http://discovery.ucl.ac.uk/id/eprint/619663
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item