Semantics of Program Representation Graphs

Simple item page
dc.contributor.authorRamalingam, Gen_US
dc.contributor.authorReps, Thomasen_US
dc.date.accessioned2012-03-15T16:52:41Z
dc.date.available2012-03-15T16:52:41Z
dc.date.created1989en_US
dc.date.issued1989en_US
dc.description.abstractProgram representation graphs are a recently introduced intermediate representation form for programs. In this paper, we develop a mathematical semantics for these graphs by interpreting them as data-flow graphs. We also study the relation between this semantics and the standard operational semantics of programs. We show that the semantics of the program representation graphs is more defined than the program semantics and that for states on which a program terminates normally, the PRG semantics is identical to the program semantics.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR900en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/59230
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleSemantics of Program Representation Graphsen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR900.pdf
Size:
2.52 MB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports