Minimal Function Graphs are not Instrumented

Alan Mycroft; Mads Rosendahl

Minimal Function Graphs are not Instrumented

Publikation: Bidrag til bog/antologi/rapport › Bidrag til bog/antologi › Forskning

Abstract

The minimal function graph semantics of Jones and Mycroft is a standard denotational semantics modified to include only `reachable' parts of a program. We show that it may be expressed directly in terms of the standard semantics without the need for instrumentation at the expression level and, in doing so, bring out a connection with strictness. This also makes it possible to prove a stronger theorem of correctness for the minimal function graph semantics.

Originalsprog	Engelsk
Titel	WSA'92 Workshop on Static Analysis
Redaktører	M Billaud, P Casteran, MM Corsini, K Musumbu, A Rauzy
Antal sider	8
Udgivelsessted	Bordeaux, France
Forlag	IRISA
Publikationsdato	1992
Sider	60-67
Status	Udgivet - 1992

Navn	Bigre
Vol/bind	81-82
ISSN	0221-5225

Citer dette

@inbook{133fe52052be11dba4bc000ea68e967b,

title = "Minimal Function Graphs are not Instrumented",

abstract = "The minimal function graph semantics of Jones and Mycroft is a standard denotational semantics modified to include only `reachable' parts of a program. We show that it may be expressed directly in terms of the standard semantics without the need for instrumentation at the expression level and, in doing so, bring out a connection with strictness. This also makes it possible to prove a stronger theorem of correctness for the minimal function graph semantics.",

author = "Alan Mycroft and Mads Rosendahl",

year = "1992",

language = "English",

series = "Bigre",

pages = "60--67",

editor = "M Billaud and P Casteran and MM Corsini and K Musumbu and A Rauzy",

booktitle = "WSA'92 Workshop on Static Analysis",

publisher = "IRISA",

}

TY - CHAP

T1 - Minimal Function Graphs are not Instrumented

AU - Mycroft, Alan

AU - Rosendahl, Mads

PY - 1992

Y1 - 1992

N2 - The minimal function graph semantics of Jones and Mycroft is a standard denotational semantics modified to include only `reachable' parts of a program. We show that it may be expressed directly in terms of the standard semantics without the need for instrumentation at the expression level and, in doing so, bring out a connection with strictness. This also makes it possible to prove a stronger theorem of correctness for the minimal function graph semantics.

AB - The minimal function graph semantics of Jones and Mycroft is a standard denotational semantics modified to include only `reachable' parts of a program. We show that it may be expressed directly in terms of the standard semantics without the need for instrumentation at the expression level and, in doing so, bring out a connection with strictness. This also makes it possible to prove a stronger theorem of correctness for the minimal function graph semantics.

M3 - Book chapter

T3 - Bigre

SP - 60

EP - 67

BT - WSA'92 Workshop on Static Analysis

A2 - Billaud, M

A2 - Casteran, P

A2 - Corsini, MM

A2 - Musumbu, K

A2 - Rauzy, A

PB - IRISA

CY - Bordeaux, France

ER -