메뉴 건너뛰기




Volumn 3444, Issue , 2005, Pages 61-76

Forward slicing by conjunctive partial deduction and argument filtering

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; MAINTENANCE; PROGRAM DEBUGGING;

EID: 24644447404     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31987-0_6     Document Type: Conference Paper
Times cited : (10)

References (33)
  • 2
    • 0036242531 scopus 로고    scopus 로고
    • The narrowing-driven approach to functional logic program specialization
    • E. Albert and G. Vidal. The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing, 2(1):3-26, 2002.
    • (2002) New Generation Computing , vol.2 , Issue.1 , pp. 3-26
    • Albert, E.1    Vidal, G.2
  • 4
    • 0342295077 scopus 로고
    • The applicability of logic program analysis and transformation to theorem proving
    • A. Bundy, editor, Springer-Verlag
    • D. A. de Waal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In A. Bundy, editor, Automated Deduction - CADE-12, pages 207-221. Springer-Verlag, 1994.
    • (1994) Automated Deduction - CADE-12 , pp. 207-221
    • De Waal, D.A.1    Gallagher, J.2
  • 7
    • 0007868497 scopus 로고
    • A system for specialising logic programs
    • University of Bristol, November
    • J. Gallagher. A system for specialising logic programs. Technical Report TR-91-32, University of Bristol, November 1991.
    • (1991) Technical Report , vol.TR-91-32
    • Gallagher, J.1
  • 8
    • 0347659840 scopus 로고
    • Deletion of redundant unary type predicates from logic programs
    • K.-K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation. Manchester, UK
    • J. Gallagher and D. A. de Waal. Deletion of redundant unary type predicates from logic programs. In K.-K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation. Proc. of LOPSTR'92, pages 151-167, Manchester, UK, 1992.
    • (1992) Proc. of LOPSTR'92 , pp. 151-167
    • Gallagher, J.1    De Waal, D.A.2
  • 9
    • 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
  • 12
    • 0002107790 scopus 로고    scopus 로고
    • An overview of program slicing
    • M. Harman and R. Hierons. An Overview of Program Slicing. Software Focus, 2(3):85-92, 2001.
    • (2001) Software Focus , vol.2 , Issue.3 , pp. 85-92
    • Harman, M.1    Hierons, R.2
  • 16
    • 0347303277 scopus 로고    scopus 로고
    • Logic program specialisation through partial deduction: Control issues
    • July & September
    • M. Leuschel and M. Bruynooghe. Logic program specialisation through partial deduction: Control issues. Theory and Practice of Logic Programming, 2(4 &: 5):461-515, July & September 2002.
    • (2002) Theory and Practice of Logic Programming , vol.2 , Issue.4-5 , pp. 461-515
    • Leuschel, M.1    Bruynooghe, M.2
  • 17
    • 11244349004 scopus 로고    scopus 로고
    • Specializing interpreters using offline partial deduction
    • M. Bruynooghe and K.-K. Lau, editors, Springer LNCS 3049
    • M. Leuschel, S. Craig, M. Bruynooghe, and W. Vanhoof. Specializing interpreters using offline partial deduction. In M. Bruynooghe and K.-K. Lau, editors, Program Development in Computational Logic, pages 341-376. Springer LNCS 3049, 2004.
    • (2004) Program Development in Computational Logic , pp. 341-376
    • Leuschel, M.1    Craig, S.2    Bruynooghe, M.3    Vanhoof, W.4
  • 18
    • 0031630125 scopus 로고    scopus 로고
    • Constrained partial deduction and the preservation of characteristic trees
    • M. Leuschel and D. De Schreye. Constrained Partial Deduction and the Preservation of Characteristic Trees. New Generation Computing, 16(3):283-342, 1998.
    • (1998) New Generation Computing , vol.16 , Issue.3 , pp. 283-342
    • Leuschel, M.1    De Schreye, D.2
  • 19
    • 0031598967 scopus 로고    scopus 로고
    • Controlling generalisation and polyvariance in partial deduction of normal logic programs
    • January
    • M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM Transactions on Programming Languages and Systems, 20(1):208-258, January 1998.
    • (1998) ACM Transactions on Programming Languages and Systems , vol.20 , Issue.1 , pp. 208-258
    • Leuschel, M.1    Martens, B.2    De Schreye, D.3
  • 20
    • 0013150935 scopus 로고    scopus 로고
    • Infinite state model checking by abstract interpretation and program specialisation
    • A. Bossi, editor, Logic-Based Program Synthesis and Transformation. LNCS 1817, Venice, Italy
    • M. Leuschel and T. Massart. Infinite state model checking by abstract interpretation and program specialisation. In A. Bossi, editor, Logic-Based Program Synthesis and Transformation. Proceedings of LOPSTR'99, LNCS 1817, pages 63-82, Venice, Italy, 2000.
    • (2000) Proceedings of LOPSTR'99 , pp. 63-82
    • Leuschel, M.1    Massart, T.2
  • 22
    • 24644508538 scopus 로고    scopus 로고
    • Forward slicing by conjunctive partial deduction and argument filtering
    • DSSE, University of Southamtpon, December
    • M. Leuschel and G. Vidal. Forward Slicing by Conjunctive Partial Deduction and Argument Filtering. Technical Report, DSSE, University of Southamtpon, December 2004.
    • (2004) Technical Report
    • Leuschel, M.1    Vidal, G.2
  • 24
    • 0028428124 scopus 로고
    • Transformation of logic programs: Foundations and techniques
    • A. Pettorossi and M. Proietti. Transformation of Logic Programs: Foundations and Techniques. The Journal of Logic Programming, 19,20:261-320, 1994.
    • (1994) The Journal of Logic Programming , vol.19 , Issue.20 , pp. 261-320
    • Pettorossi, A.1    Proietti, M.2
  • 25
    • 84957647698 scopus 로고    scopus 로고
    • Program specialization via program slicing
    • O. Danvy, R. Glück, and P. Thiemann, editors, Springer LNCS 1110
    • T. Reps and T. Turnidge. Program Specialization via Program Slicing. In O. Danvy, R. Glück, and P. Thiemann, editors, Partial Evaluation. Dagstuhl Castle, pages 409-429. Springer LNCS 1110, 1996.
    • (1996) Partial Evaluation. Dagstuhl Castle , pp. 409-429
    • Reps, T.1    Turnidge, T.2
  • 26
    • 84957716639 scopus 로고    scopus 로고
    • A roadmap to metacomputation by supercompilation
    • O. Danvy, R. Glück, and P. Thiemann, editors, Springer LNCS 1110
    • R. Glück and M.H. Sørensen A Roadmap to Metacomputation by Supercompilation. In O. Danvy, R. Glück, and P. Thiemann, editors, Partial Evaluation. Dagstuhl Castle, pages 137-160. Springer LNCS 1110, 1996.
    • (1996) Partial Evaluation. Dagstuhl Castle , pp. 137-160
    • Glück, R.1    Sørensen, M.H.2
  • 29
    • 0000990322 scopus 로고
    • A survey of program slicing techniques
    • F. Tip. A Survey of Program Slicing Techniques. Journal of Programming Languages, 3:121-189, 1995.
    • (1995) Journal of Programming Languages , vol.3 , pp. 121-189
    • Tip, F.1
  • 31
    • 35248825071 scopus 로고    scopus 로고
    • Forward slicing of multi-paradigm declarative programs based on partial evaluation
    • M. Leuschel, editor, LNCS 2664, Springer-Verlag
    • G. Vidal. Forward slicing of multi-paradigm declarative programs based on partial evaluation. In M. Leuschel, editor, Proc. of Logic-based Program Synthesis and Transformation (LOPSTR'02), LNCS 2664, pages 219-237. Springer-Verlag, 2003.
    • (2003) Proc. of Logic-based Program Synthesis and Transformation (LOPSTR'02) , pp. 219-237
    • Vidal, G.1


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