Garland S.J., Luckham D.C. Program schemes, recursion schemes and formal languages.-- Report UCLA-ENG-7154, June 1971, School of Engineering and Applied Science, University of California, Los Angeles. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Equivalent Transformations of Recursive Programs with.. - Sabelfeld, Sabelfeld (1997) (Correct)
....(the programs result equally for all admissible interpretations) We consider a wider class of recursive programs than that investigated in the literature, beginning with the classical work of Garland and Luckham This paper appeared in Programming and Computer Software, 23 (2) 70 77, 1997. 1 [5]. The conditions of conditional terms allow for not only atomic formulas, as was usually assumed in earlier investigations, but also terms of the general form. Besides this, a program limits the set of possible interpretations of any basic symbol by assigning to it a collection of strict ....
Garland S.J., Luckham D.C. Program schemes, recursion schemes and formal languages. Report UCLA-ENG-7154, June 1971, School of Engineering and Applied Science, University of California, Los Angeles
Forwards and Backwards Analysis for Functional Programs - Andrei Sabelfeld (Correct)
....Many authors have explored program analysis problems on program models. Most results have been obtained in flow analysis [KU77] and abstract interpretation [CC77, CC92] approaches. We introduce a new method of semantic analysis for first order call by name functional programs (recursion schemes [GL71]) We describe two simple classes of semantic property analysis problems, forwards and backwards property analysis problems for recursion schemes, and use a marking technique for their solution. Our approach is close to Patrick and Radhia Cousot s abstract interpretation approach [CC77, CC92] We ....
S.J. Garland, D.C. Luckham. Program schemes, recursion schemes and formal languages. Report UCLA-ENG-7154, June 1971, School of Engineering and Applied Science, University of California, Los Angeles, 1971.
The Tree Equivalence of Linear Recursion Schemes - Sabelfeld (Correct)
No context found.
Garland S.J., Luckham D.C. Program schemes, recursion schemes and formal languages.-- Report UCLA-ENG-7154, June 1971, School of Engineering and Applied Science, University of California, Los Angeles.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC