Transformations on loop-free program schemata
Read Online

Transformations on loop-free program schemata

  • 420 Want to read
  • ·
  • 75 Currently reading

Published by Dept. of Computer Science, University of Illinois at Urbana-Champaign in Urbana .
Written in English


  • Compiling (Electronic computers),
  • Coding theory

Book details:

Edition Notes

SeriesReport (University of Illinois at Urbana-Champaign. Department of Computer Science) -- no. 516, Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 516.
LC ClassificationsQA76 .I4 no. 516, QA268 .I4 no. 516
The Physical Object
Paginationiv l., 121 p.
Number of Pages121
ID Numbers
Open LibraryOL25460087M

Download Transformations on loop-free program schemata


The importance of program transformations as a tool for program development has been pointed out by many, including [5, 9, 22, 36, 45, 63, 70, 71]. (For a survey, see ; for a more pessimistic view, see.) Gerhart and others have recommended the hand-compilation of a handbook of program schemata. Such a collection of schemata, along with a Cited by: Request PDF | The Equivalence Problem for Computational Models: Decidable and Undecidable Cases | This paper presents a survey of fundamental . linear process of data transformation results in a loop-free or straight-line program, a simple control structure successful ly applied in many previous data transformation projects [ The possibility of systematic program transformations to aid the programming process was also emphasized. he developed a complete theory of loop-free schemata with an algorithmic decision of the functional equivalence problem and a complete system of transformations [61]. THE EARLY DEVELOPMENT OF PROGRAMMING IN THE USSR When we look Cited by:

Full text of "Graph transformations: second international conference, ICGT , Rome, Italy, September October 2, proceedings" See other formats. %%% ==================================================================== %%% BibTeX-file{ %%% filename = "", %%% version = "", %%% url = . %%% -*-BibTeX-*- %%% ===== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "", %%% date = "09 October ", %%% time = " MDT. SIAM Journal on Computing Volume 1, Number 1, Robert L. Constable and Gries David On Classes of Program Schemata Brian S. Leininger The complexity of the equivalence problem for simple loop-free programs J. H. Halton and R. Terada A fast algorithm for the Euclidean traveling salesman problem.

Full text of "Introduction To Software Testing" See other formats. We're upgrading the ACM DL, and would like your input. Please sign up to review new features, functionality and page by: Recommend Documents. No documents. Lecture Notes in Artificial Intelligence IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 2, No 1, March ISSN (Online): With the total cost determined for each of the Voronoi edges, the Voronoi diagram is searched to find the set of lowest-cost candidate paths between the initial UAVs/UCAV location and the location of the target.