메뉴 건너뛰기




Volumn 2, Issue , 2004, Pages 1131-1135

Analysis and specialisation of a PIC processor

Author keywords

Abstract interpretation; Analysis; Emulation; Partial evaluation; PIC processor

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER PROGRAMMING; COMPUTER SIMULATION; DATA ACQUISITION; HARDWARE; LOGIC PROGRAMMING; PATTERN RECOGNITION; PROGRAM PROCESSORS; SEMANTICS;

EID: 15744401222     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (11)
  • 2
    • 84949471838 scopus 로고    scopus 로고
    • Inferring argument size relationships with CLP(R)
    • [BK96]. J.P. Gallagher, editor, Logic-Based Program Synthesis and Transformation (LOPSTR'96), August
    • [BK96] F. Benoy and A. King. Inferring argument size relationships with CLP(R). In J.P. Gallagher, editor, Logic-Based Program Synthesis and Transformation (LOPSTR'96), volume 1207 of Springer-Verlag Lecture Notes in Computer Science, pages 204-223, August 1996.
    • (1996) Springer-verlag Lecture Notes in Computer Science , vol.1207 , pp. 204-223
    • Benoy, F.1    King, A.2
  • 3
    • 85050550846 scopus 로고
    • Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
    • [CC77]
    • [CC77] P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, pages 238-252, 1977.
    • (1977) Proceedings of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles , pp. 238-252
    • Cousot, P.1    Cousot, R.2
  • 7
    • 35048818957 scopus 로고    scopus 로고
    • Abstract domains based on regular types
    • [GH04]. V. Lifschitz and B. Demoen, editors, Springer-Verlag Lecture Notes in Computer Science. Springer Verlag. (to appear)
    • [GH04] J. P. Gallagher and K.S. Henriksen. Abstract domains based on regular types. In V. Lifschitz and B. Demoen, editors, Proceedings of the International Conference on Logic Programming (ICLP'2004), Springer-Verlag Lecture Notes in Computer Science. Springer Verlag, 2004. (to appear).
    • (2004) Proceedings of the International Conference on Logic Programming (ICLP'2004)
    • Gallagher, J.P.1    Henriksen, K.S.2
  • 8
    • 0035466110 scopus 로고    scopus 로고
    • Regular tree languages as an abstract domain in program specialisation
    • [GP01]
    • [GP01] J. P. Gallagher and J. C. Peralta. Regular tree languages as an abstract domain in program specialisation. Higher Order and Symbolic Computation, 14(2,3):143-172, 2001.
    • (2001) Higher Order and Symbolic Computation , vol.14 , Issue.2-3 , pp. 143-172
    • Gallagher, J.P.1    Peralta, J.C.2
  • 9
    • 84947241479 scopus 로고    scopus 로고
    • Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs
    • [GP02], LNCS. Springer-Verlag, January. Accepted for publication
    • [GP02] J. Gallagher and G. Puebla. Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. In Fourth International Symposium on Practical Aspects of Declarative Languages (PADL'02), LNCS. Springer-Verlag, January 2002. Accepted for publication.
    • (2002) Fourth International Symposium on Practical Aspects of Declarative Languages (PADL'02)
    • Gallagher, J.1    Puebla, G.2
  • 11
    • 19144367913 scopus 로고    scopus 로고
    • Efficient specialisation in Prolog using the hand-written compiler generator LOGEN
    • [LJ99]
    • [LJ99] M. Leuschel and J. Jørgensen. Efficient specialisation in Prolog using the hand-written compiler generator LOGEN. Electr. Notes Theor. Comput. Sci. 30(2), 1999.
    • (1999) Electr. Notes Theor. Comput. Sci. , vol.30 , Issue.2
    • Leuschel, M.1    Jørgensen, J.2


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