Systematic realisation of control flow analyses for CML

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 1997

View graph of relations

We present a methodology for the systematic realisation of control flow analyses and illustrate it for Concurrent ML. We start with an abstract specification of the analysis that is next proved semantically sound with respect to a traditional small-step operational semantics; this result holds for terminating w well as non-terminating programs. The analysis is defined coinductively and it is shown that all programs have a least analysis result (that is indeed the best one). To realise the analysis we massage the specification in three stages: (i) to explicitly record reachability of subexpressions, (ii) to be defined in a syntax-directed manner, and (iii) to generate a set of constraints that subsequently can be solved by standard techniques. We prove equivalence results between the different versions of the analysis; in particular it follows that the least solution to the constraints generated will be the least analysis result also to the initial specification.
Original languageEnglish
Title of host publicationProceedings of the second ACM SIGPLAN international conference on Functional programming
PublisherACM Press
Publication date1997
ISBN (print)0-89791-918-1
StatePublished - 1997
EventInternational Conference on Functional Programming -


ConferenceInternational Conference on Functional Programming
Period01/01/1997 → …
Download as:
Download as PDF
Select render style:
Download as HTML
Select render style:
Download as Word
Select render style:

ID: 2877851