-
2
-
-
84949471838
-
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
-
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
-
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
-
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
-
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
-
10
-
-
0010276158
-
Program analysis, debugging, and optimization using the Ciao system preprocessor
-
[HBPL99]. D. De Schreye, editor. MIT Press
-
[HBPL99] M. V. Hermenegildo, F. Bueno, G. Puebla, and P. López. Program analysis, debugging, and optimization using the Ciao system preprocessor. In D. De Schreye, editor, Proceedings of ICLP 1999: International Conference on Logic Programming, Las Cruces, New Mexico, USA, pages 52-66. MIT Press, 1999.
-
(1999)
Proceedings of ICLP 1999: International Conference on Logic Programming, Las Cruces, New Mexico, USA
, pp. 52-66
-
-
Hermenegildo, M.V.1
Bueno, F.2
Puebla, G.3
López, P.4
-
11
-
-
19144367913
-
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
|