UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Safety of strictness analysis via term graph rewriting

Clark, D; Hankin, C; Hunt, S; (2000) Safety of strictness analysis via term graph rewriting. In: (pp. pp. 95-114).

Full text not available from this repository.

Abstract

A safe abstraction is presented for a restricted form of term graph rewriting. This abstraction can be seen as a formalisation of the rewrite system employed by the strictness analyser in the Concurrent Clean compiler. Programs written in a core functional language are interpreted as graph rewriting systems using a form of equational term graph rewriting due to Ariola and Arvind. Abstract graphs are defined by extending the signature of ordinary graphs and it is shown how to extend a rewriting system on ordinary graphs to one on abstract graphs. An abstraction relation between abstract graphs is used to define a notion of safety with respect to a variant of Ariola and Arvind's direct approximation semantics, and this notion of safety is shown to be adequate for strictness analysis. Abstract reduction is defined as the union of the extended rewrite system with additional 'heuristic' reductions and shown to be safe. © Springer-Verlag Berlin Heidelberg 2000.

Type: Proceedings paper
Title: Safety of strictness analysis via term graph rewriting
ISBN: 3540676686
ISBN-13: 9783540676683
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/619669
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