메뉴 건너뛰기




Volumn 1817, Issue , 2000, Pages 102-117

Imperative program specialisation: An approach using CLP

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DIRECTED GRAPHS; LOGIC PROGRAMMING; SEMANTICS;

EID: 84949671465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10720327_7     Document Type: Conference Paper
Times cited : (6)

References (24)
  • 2
    • 0002626826 scopus 로고    scopus 로고
    • Appel. SSA is functional programming
    • Andrew W. Appel. SSA is functional programming. ACM SIGPLAN Notices, 33(4):17-20, 1998.
    • (1998) ACM SIGPLAN Notices , vol.33 , Issue.4 , pp. 17-20
    • Andrew, W.1
  • 3
    • 84957623785 scopus 로고    scopus 로고
    • An automatic interprocedural analysis for the understanding of scientific application programs
    • In O. Danvy, Robert Glück, and Peter Thieman, editors, Springer-Verlag, LNCS
    • Sandrine Blazy and Philippe Facon. An automatic interprocedural analysis for the understanding of scientific application programs. In O. Danvy, Robert Glück, and Peter Thieman, editors, International Seminar on Partial Evaluation, pages 1-16. Springer-Verlag, LNCS 1110, 1996.
    • (1996) International Seminar on Partial Evaluation , vol.1110 , pp. 1-16
    • Blazy, S.1    Facon, P.2
  • 6
    • 0038559009 scopus 로고
    • The derivation of an algorithm for program specialisation
    • J. Gallagher and M. Bruynooghe. The derivation of an algorithm for program specialisation. New Generation Computing, 9(3&4):305-333, 1991.
    • (1991) New Generation Computing , vol.9 , Issue.3-4 , pp. 305-333
    • Gallagher, J.1    Bruynooghe, M.2
  • 8
    • 84957690439 scopus 로고    scopus 로고
    • Regular approximation of computation paths in logic and functional languages
    • In O. Danvy, R. Glück, and P. Thiemman, editors, Springer-Verlag, LNCS
    • John P. Gallagher and L. Lafave. Regular approximation of computation paths in logic and functional languages. In O. Danvy, R. Glück, and P. Thiemman, editors, Partial Evaluation, pages 115-136. Springer-Verlag, LNCS 1110, 1996.
    • (1996) Partial Evaluation , vol.1110 , pp. 115-136
    • Gallagher, J.P.1    Lafave, L.2
  • 9
    • 0033723168 scopus 로고    scopus 로고
    • Using regular approximations for generalisation during partial evaluation
    • ACM Press, To appear in ACM SIGPLAN Notices
    • John P. Gallagher and Julio C. Peralta. Using regular approximations for generalisation during partial evaluation. In Workshop on Partial Evaluation and Program Manipulation, pages 44-51. ACM Press, 2000. To appear in ACM SIGPLAN Notices.
    • (2000) Workshop on Partial Evaluation and Program Manipulation , pp. 44-51
    • Gallagher, J.P.1    Peralta, J.C.2
  • 11
    • 84866954840 scopus 로고    scopus 로고
    • Effective specialization of realistic programs via use sensitivity
    • Pascal Van Hentenryck, editor, Springer-Verlag, LNCS
    • Luke Hornof, Jaques Noyé, and Charles Consel. Effective specialization of realistic programs via use sensitivity. In Pascal Van Hentenryck, editor, Static Analysis Symposium, pages 293-318. Springer-Verlag, LNCS 1302, 1997.
    • (1997) Static Analysis Symposium , vol.1302 , pp. 293-318
    • Hornof, L.1    Noyé, J.2    Consel, C.3
  • 12
    • 4243532938 scopus 로고
    • Constraint logic programming: A survey
    • Joxan Jaffar and Michael J. Maher. Constraint logic programming: A survey. The Journal of Logic Programming, 19(20):503-581, 1994.
    • (1994) The Journal of Logic Programming , vol.19 , Issue.20 , pp. 503-581
    • Jaffar, J.1    Maher, M.J.2
  • 21
    • 84905001048 scopus 로고    scopus 로고
    • Analysis of imperative programs through analysis of constraint logic programs
    • In G. Levi, editor, Springer-Verlag, LNCS
    • Julio C. Peralta, John P. Gallagher, and Hüseyin Sağlam. Analysis of imperative programs through analysis of constraint logic programs. In G. Levi, editor, Static Analysis Symposium, pages 246-261. Springer-Verlag, LNCS 1503, 1998.
    • (1998) Static Analysis Symposium , vol.1503 , pp. 246-261
    • Peralta, J.C.1    Gallagher, J.P.2    Sağlam, H.3
  • 22
    • 30544444823 scopus 로고    scopus 로고
    • Technical Report TR-1386, Computer Sciences Department, University of Wisconsin, August, Extended version of invited paper in Proceedings of ILPS97
    • Thomas Reps. Program analysis via graph reachability. Technical Report TR-1386, Computer Sciences Department, University of Wisconsin, August 1998. Extended version of invited paper in Proceedings of ILPS97.
    • (1998) Program Analysis via Graph Reachability
    • Reps, T.1
  • 23
    • 2542619991 scopus 로고
    • The partial evaluation of imperative programs using Prolog
    • H. Abramson and M. H. Rogers, editors, MIT Press
    • Brian J. Ross. The partial evaluation of imperative programs using Prolog. In H. Abramson and M. H. Rogers, editors, Meta-Programming in Logic Programming, pages 341-363. MIT Press, 1989.
    • (1989) Meta-Programming in Logic Programming , pp. 341-363
    • Ross, B.J.1
  • 24
    • 14544282938 scopus 로고    scopus 로고
    • Constrained regular approximations of logic programs
    • In N. Fuchs, editor, Springer-Verlag, LNCS
    • Hüseyin Sağlam and John P. Gallagher. Constrained regular approximations of logic programs. In N. Fuchs, editor, LOPSTR'97, pages 282-299. Springer-Verlag, LNCS 1463, 1997.
    • (1997) LOPSTR'97 , vol.1463 , pp. 282-299
    • Sa, H.1    Ğlamgallagher, J.P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.