%
%$Id: Abint.bib,v 4.1 2000/11/27 15:57:38 mmc Exp $
%
%%----------------------------------------------------------------------
%% Laboratories
@String{brown = "Department of Computer Science, Brown University"}
@String{brownaddr = "Providence, Rhode Island 02912"}
@String{labri = "Laboratoire Bordelais de Recherche en Informatique"}
@String{labriaddr = "351, Cours de la Lib\'eration, F-33405 Talence,
Cedex"}
@String{weiz = "Weizmann Institute of Science, Dept of appl. maths and
comp. sci."}
@String{pise = "Dipartimento di Informatica, Universit\`a di Pis\`a"}
@String{leuven = "Department of Computer Science, KU Leuven, Belgium"}
@String{padova = "Dipartimento di Matematica, Universit\`a di Padov\`a"}
@String{bxI = "Universit\'e de Bordeaux~I"}
%%---------------------------------------------------------------------------
%% Some Individuals
@String{cousot = "Cousot, P. and Cousot, R."}
@String{mike = "Codish, M."}
@String{maurice = "Bruynooghe, M."}
@String{gilberto = "Fil{\'e}, G."}
@String{baudouin = "Le~Charlier, B."}
@String{manuel = "Hermenegildo, M."}
@String{mmc = "Corsini, M.-M."}
@String{wsa = "Billaud, M. and Cast\'eran, P. and Corsini, M.-M. and
Musumbu, K. and Rauzy, A."}
@String{pi1 = "Corsini, M.-M. and Rauzy, A."}
@String{pi2 = "Corsini, M.-M. and Musumbu, K. and Rauzy, A."}
@String{pi3 = "Corsini, M.-M. and Le~Charlier, B. and Musumbu, K. and
Rauzy, A."}
%% National Conferences on Logic Programming %%
%% GULP %%
@String{gulp89 = "Proc. Fourth Italian Conference on Logic Programming
(GULP'89)"}
@String{edgulp89 = "Mello, P."}
@String{gulp90 = "Proc. Fifth Italian Conference on Logic Programming
(GULP'90)"}
@String{edgulp90 = "Bossi, A."}
@String{gulp91 = "Proc. Sixth Italian Conference on Logic Programming
(GULP'91)"}
@String{edgulp91 = "Asirelli, P."}
@String{gulp92 = "Proc. Seventh Italian Conference on Logic Programming
(GULP'92)"}
@String{edgulp92 = "Costantini, S."}
@String{gulp93 = "Proc. Eight Italian Conference on Logic Programming
(GULP'93)"}
@String{edgulp93 = "Sacc\`{a}, D."}
%% JFPL %%
@String{jfpl92 = "Proc. French Conference on Logic Programming
(JFPL92)"}
@String{ejfpl92 = "Delahaye, J.-P. and Devienne, P. and Mathieu, P. and
Yim, P."}
@String{jfpl93 = "Proc. French Conference on Logic Programming
(JFPL93)"}
@String{ejfpl93 = "Ezequel, P."}
@String{jfpl94 = "Proc. French Conference on Logic Programming
(JFPL94)"}
@String{ejfpl94 = "Corsini, M.-M."}
%%----------------------------------------------------------------------
%% Series abbreviations:
@String{lnai = "Lecture Notes in Artificial Intelligence"}
@String{lncs = "Lecture Notes in Computer Science"}
%% Journal abbreviations:
@String{tcs = "Journal of Theoretical Computer Science"}
@String{jlp = "Journal of Logic Programming"}
@String{toplas = "ACM Transactions on Programming Languages and Systems
(TOPLAS)"}
@String{loplas = "ACM Letters on Programming Languages and Systems
(LOPLAS)"}
@String{scp = "Science of Computer Programming"}
@String{ipl = "Information Processing Letters"}
@String{spe = "Software - Practice and Experience"}
@String{ngc = "New Generation Computing"}
@String{pc = "Parallel Computing"}
%% Publisher abbreviations:
@String{sv = "Springer-Verlag"}
@String{sv:adr = "New York, NY, USA"}
@String{acm = "Association for Computing Machinery"}
@String{elsev = "Elsevier Science"}
%%----------------------------------------------------------------------
%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe, Center for Scientific Computing,
University of Utah, Department of Mathematics, 322
INSCC, 155 S 1400 E RM 233, Salt Lake City, UT
84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 585
1640, +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|, \path|beebe@acm.org|,
\path|beebe@ieee.org| (Internet), URL:
\path|http://www.math.utah.edu/~beebe/|"}
@String{ack-mmc = "Marc-Michel Corsini, Universit{\'e} V.~Segalen
Bordeaux 2, UFR Sciences et Mod{\'e}lisation, 146, rue
L{\'e}o Saignat, 33076 Bordeaux Cedex, France, Tel:
(+33|+0) 557 571 448 e-mail:
\url{corsini@u-bordeaux2.fr},
\url{http://www.mi2s.u-bordeaux2.fr/~corsini/}"}
%%----------------------------------------------------------------------
%%%%%%%% DES INDIVIDUS %%%%%%%%%%%%%%
%
% Maurice Bruynooghe et al.
%
@TechReport{maurice:TR87,
author = maurice,
title = "{A} {F}ramework for the {A}bstract {I}nterpretation of
{L}ogic {P}rograms",
institution = "Department of Computer Science, Katholieke
Universiteit Leuven",
number = "CW 62",
month = oct,
year = "1987",
acknowledgement = ack-mmc,
}
@InProceedings{maurice:slp87,
author = "M. Bruynooghe and Janssens G. and A. Callebaut and B.
Demoen",
title = "Abstract {I}nterpretation: {T}owards the {G}lobal
{O}ptimization of {P}rolog {P}rograms",
pages = "192--204",
crossref = "SLP87",
acknowledgement = ack-mmc,
}
@Misc{maurice:tutorial,
author = maurice,
title = "A {P}ractical {F}ramework for the {A}bstract
{I}nterpretation of {L}ogic {P}rograms",
howpublished = "5$^{th}$ ICLP--SLP 88;tutorial N$^o$2",
year = "1988",
acknowledgement = ack-mmc,
}
@InProceedings{maurice:iclp88,
author = "M. Bruynooghe and G. Janssens",
title = "An {I}nstance of {A}bstract {I}nterpretation:
{I}ntegrating {T}ype and {M}ode {I}nferencing",
pages = "669--683",
crossref = "ICLP88",
acknowledgement = ack-mmc,
}
@InProceedings{maurice:plilp88,
author = "D. De Schreye and M. Bruynooghe",
title = "An {A}pplication of {A}bstract {I}nterpretation in
{S}ource {L}evel {P}rogram {T}ransformation",
crossref = "PLILP88",
pages = "35--57",
acknowledgement = ack-mmc,
}
@Article{maurice:jlp89,
author = "M. Bruynooghe and D. De Schreye and B. Krekels",
title = "Compiling Control",
journal = jlp,
year = "1989",
volume = "6",
number = "(1 \&\ 2)",
pages = "135--162",
acknowledgement = ack-mmc,
}
@Article{maurice:jlp91,
author = maurice,
title = "A {P}ractical {F}ramework for the {A}bstract
{I}nterpretation of {L}ogic {P}rograms",
journal = jlp,
number = "2",
volume = "10",
pages = "91--124",
year = "1991",
note = "revised version of K.U.L. technical report CW 62,
1987",
acknowledgement = ack-mmc,
}
@Article{maurice:jlp92,
author = "G. Janssens and M. Bruynooghe",
title = "Deriving {D}escriptions of {P}ossible {V}alues of
{P}rogram {V}ariables by Means of {A}bstract
{I}nterpretation",
journal = JLP,
volume = "13",
number = "1, 2, 3 and 4",
year = "1992",
pages = "205--258",
acknowledgement = ack-mmc,
}
@TechReport{maurice:TR92a,
author = "M. Bruynooghe and G. Janssens",
title = "Propagation: a {N}ew {O}peration in a {F}ramework for
{A}bstract {I}nterpretation of {L}ogic {P}rograms",
institution = leuven,
year = "1992",
type = "Research Report",
number = "CW 146",
month = mar,
acknowledgement = ack-mmc,
}
@TechReport{maurice:TR92b,
author = "M. Bruynooghe and W. Winsborough",
title = "Type {G}raph {U}nification",
institution = leuven,
year = "1992",
type = "Report",
number = "CW 160",
month = dec,
acknowledgement = ack-mmc,
}
@InProceedings{maurice:meta92,
author = "G. Janssens and M. Bruynooghe",
title = "Towards a {F}ramework for {A}bstract {I}nterpretation
of {C}onstraint {L}ogic {P}rograms",
booktitle = "META'92",
series = lncs,
editor = "A. Pettorossi",
volume = "649",
publisher = sv,
year = "1993",
acknowledgement = ack-mmc,
}
@TechReport{maurice:TR93a,
author = "M. Bruynooghe and D. Boulanger",
title = "Abstract {I}nterpretation for ({C}onstraint) {L}ogic
{P}rogramming",
institution = "KUL",
year = "1993",
month = nov,
type = "Technical Report",
number = "CW 183",
acknowledgement = ack-mmc,
}
@TechReport{maurice:TR93b,
author = "M. Bruynooghe and D. Boulanger",
title = "Using {A}bstract {I}nterpretation for {G}oal
{R}eplacement",
institution = "KUL",
year = "1993",
month = sep,
type = "Technical Report",
number = "CW 181",
note = "To appear in LOPSTR'93",
acknowledgement = ack-mmc,
}
@Article{maurice:jlp93,
author = "D. Boulanger and M. Bruynooghe",
title = "Deriving fold/unfold {T}ransformations of {L}ogic
{P}rograms using extended {OLDT}-based {A}bstract
{I}nterpretation",
journal = "Journal of Symbolic Computation",
year = "1993",
volume = "15",
number = "5 \& 6",
pages = "495--521",
note = "also, Report CW 163 December 1992 at KUL",
acknowledgement = ack-mmc,
}
@InProceedings{maurice:wsa93,
author = "M. Bruynooghe and M. Codish",
title = "Freeness, {S}haring, {L}inearity and {C}orrectness ---
all at {O}nce",
crossref = "WSA93",
pages = "153--164",
year = "1993",
note = "long version as Report CW 179, Sep. 1993, at KUL",
acknowledgement = ack-mmc,
}
@InProceedings{maurice:iclp94,
booktitle = "ICLP'94 post-conference workshop on the verification
and analysis of logic programs",
address = "Santa Margherita Ligure, Italy",
author = "M. Bruynooghe and M. Codish and A. Mulkers",
title = "Abstract {U}nification for a {C}omposite {D}omain
{D}eriving {S}haring and {F}reeness {P}roperties of
{P}rogram {V}ariables",
note = "June",
pages = "213--230",
year = "1994",
acknowledgement = ack-mmc,
}
@InProceedings{maurice:plilp94,
author = "G. Janssens and M. Bruynooghe and V. Englebert",
title = "Abstracting {N}umerical {V}alues in {CLP(H,N)}",
crossref = "PLILP94",
pages = "400--414",
acknowledgement = ack-mmc,
}
@InProceedings{maurice:Vol1000,
author = "M. Bruynooghe and M. Codish and A. Mulkers",
title = "Abstracting {U}nification: {A} {K}ey {S}tep in the
{D}esign of {L}ogic {P}rogram {A}nalyses",
booktitle = "Computer Science Today, Recent Trends and
Developments",
pages = "406--425",
year = "1995",
series = lncs,
volume = "1000",
publisher = sv,
ISSN = "0302-9743",
acknowledgement = ack-mmc,
}
%
% Michael Codish et al.
%
@Article{mike:ngc88,
author = "J. Gallagher and M. Codish and E. Shapiro",
title = "Specialization of {Prolog} and {FCP} {P}rograms using
{A}bstract {I}nterpretation",
journal = "New Generation Computing",
volume = "6",
number = "3",
pages = "159--186",
year = "1988",
acknowledgement = ack-mmc,
}
@InProceedings{mike:meta89,
author = "M. Codish and J. Gallagher and E. Shapiro",
title = "Using {S}afe {A}pproximations of {F}ixed {P}oints for
{A}nalysis of {L}ogic {P}rograms",
booktitle = "Meta-programming in Logic Programming",
editor = "H. Abramson and M. H. Rogers",
pages = "233--262",
publisher = "MIT Press",
year = "1989",
acknowledgement = ack-mmc,
}
@TechReport{codish:aliasing90,
author = "M. Codish and D. Dams and E. Yardeni",
title = "Abstract {U}nification for the {A}nalysis of
{G}roundness and {A}liasing in {L}ogic {P}rograms",
year = "1990",
month = aug,
number = "TR-CS90-10",
institution = "Weizmann Institute of Computer Science",
acknowledgement = ack-mmc,
}
@TechReport{mike:magic90,
author = "M. Codish and D. Dams and E. Yardeni",
title = "{B}ottom--{U}p {A}bstract {I}nterpretation of {L}ogic
{P}rograms",
number = "CS90--24",
year = "1990",
institution = weiz,
type = "Technical Report",
acknowledgement = ack-mmc,
}
@InProceedings{mike:iclp91,
author = "M. Codish and D. Dams and E. Yardeni",
title = "{D}erivation and {S}afety of an {A}bstract
{U}nification {A}lgorithm for {G}roundness and
{A}liasing {A}nalysis",
pages = "79--93",
crossref = "ICLP91",
acknowledgement = ack-mmc,
}
@InProceedings{mike:alp92,
author = "R. Barbuti and M. Codish and R. Giacobazzi and M.
Maher",
title = "Oracle {S}emantics for {PROLOG}",
note = "Also available as Tech. Report CW 152 of KUL",
booktitle = "Third Conference on Algebraic Logic Programming",
editor = "H. Kirchner and G. Levi",
series = "LNCS",
volume = "632",
pages = "100--114",
publisher = "Springer Verlag",
address = "Voltera, Italy",
month = sep,
year = "1992",
acknowledgement = ack-mmc,
}
@InProceedings{mike:iclp93,
author = "M. Codish and D. Dams and G. Fil{\'e} and M.
Bruynooghe",
title = "Freeness {A}nalysis for {L}ogic {P}rograms -- and
{C}orrectness ?",
crossref = "ICLP93",
pages = "116--131",
year = "1993",
month = jun,
note = "also Report CW 161, December 1992, at KUL",
acknowledgement = ack-mmc,
}
@InProceedings{mike:popl93,
author = "M. Codish and S. K. Debray and R. Giacobazzi",
title = "Compositional {A}nalysis of {M}odular {L}ogic
{P}rograms",
booktitle = "Proceedings of the Twentieth ACM symposium on
Principles of Programming Languages",
publisher = "ACM Press",
month = jan,
year = "1993",
pages = "451--464",
acknowledgement = ack-mmc,
}
@InProceedings{mike:ilps93,
author = "M. Codish and B. Demoen",
title = "Analysing {L}ogic {P}rograms using {\tt
{P}rop}-ositional {L}ogic {P}rograms and a {M}agic
{W}and",
crossref = "ILPS93",
pages = "114--129",
year = "1993",
acknowledgement = ack-mmc,
}
@InProceedings{mike:pepm93,
author = "M. Codish and A. Mulkers and M. Bruynooghe and M.
Garc\`\i a de la Banda and M. Hermenegildo",
title = "Improving {A}bstract {I}nterpretations by {C}ombining
{D}omains",
crossref = "PEPM93",
pages = "194--205",
note = "also Report CW 162 at KUL, December 1992",
acknowledgement = ack-mmc,
}
@TechReport{mike:TR93,
author = "M. Codish and M. Garc{\'\i}a de la Banda and M.
Bruynooghe and M. Hermenegildo",
title = "Top-down vs {B}ottom-up {A}nalysis of {L}ogic
{P}rograms - {C}losing the {C}ircle",
institution = "Department of Computer Science, KU Leuven, Belgium",
year = "1993",
month = may,
type = "Research Report",
number = "CW 177",
acknowledgement = ack-mmc,
}
@Article{mike:tcs94,
author = "M. Codish and D. Dams and E. Yardeni",
title = "{B}ottom--{U}p {A}bstract {I}nterpretation of {L}ogic
{P}rograms",
journal = "Theoretical Computer Science",
volume = "124",
number = "1",
year = "1994",
month = feb,
publisher = "Elsevier",
pages = "93--125",
acknowledgement = ack-mmc,
}
@InProceedings{mike:sas94,
author = "M. Codish and B. Demoen",
title = "Deriving {P}olymorphic {T}ype {D}ependencies for
{L}ogic {P}rograms using {M}ultiple {I}ncarnation of
{P}rop",
crossref = "SAS94",
pages = "281--296",
acknowledgement = ack-mmc,
}
@InProceedings{mike:lpar94,
author = "M. Codish and M. Garc{\'\i}a de la Banda and M.
Bruynooghe and M. Hermenegildo",
title = "Goal {D}ependent vs {G}oal {I}ndependent {A}nalysis of
{L}ogic {P}rograms",
pages = "305--320",
booktitle = "Fifth International Conference on Automated Reasoning
(LPAR'94)",
year = "1994",
editor = "F. Pfenning",
publisher = sv,
series = lncs,
volume = "822",
address = "Kiev, Ukraine",
month = jul,
acknowledgement = ack-mmc,
}
@Article{mike:acm95,
author = "M. Codish and A. Mulkers and M. Bruynooghe and M.
Garc{\`\i}a de la Banda and M. Hermenegildo",
title = "Improving {A}bstract {I}nterpretations by {C}ombining
{D}omains",
journal = toplas,
year = "1995",
volume = "17",
number = "1",
pages = "28--44",
month = jan,
publisher = acm,
acknowledgement = ack-mmc,
}
@Article{mike:ic95,
author = "R. Barbuti and M. Codish and R. Giacobazzi and M.
Maher",
title = "Oracle {S}emantics for {PROLOG} (extended version)",
journal = "Information and Computation",
volume = "122",
number = "2",
pages = "178--200",
year = "1995",
acknowledgement = ack-mmc,
}
@Article{codish95:prop,
author = "M. Codish and B. Demoen",
title = "Analysing Logic Programs using {"}Prop{"}-ositional
Logic and a Magic Wand",
journal = jlp,
year = "1995",
volume = "25",
number = "3",
pages = "249--274",
url = "http://www.cs.bgu.ac.il/~mcodish/Papers/ppapers.html",
acknowledgement = ack-mmc,
}
@Article{codish96:tcs,
author = "M. Codish and G. Mashevitzky",
title = "Proving Implications by Algebraic Approximation",
journal = tcs,
year = "1996",
volume = "165",
pages = "57--74",
url = "http://www.cs.bgu.ac.il/~mcodish/Papers/ppapers.html",
acknowledgement = ack-mmc,
}
@Article{codish96:jlp,
author = "M. Codish and D. Dams and G. Fil{\'e} and M.
Brynooghe",
title = "On the Design of Correct Freeness {AN}alysis of Logic
Programs",
journal = jlp,
year = "1996",
volume = "28",
number = "3",
pages = "181--206",
url = "http://www.cs.bgu.ac.il/~mcodish/Papers/ppapers.html",
acknowledgement = ack-mmc,
}
@Article{codish97:jlpa,
author = "M. Codish and M. Falaschi and K. Marriott and W.
Winsborough",
title = "A Confluent Semantic Basis for the Analysis of
Concurrent Constraint Logic Programs",
journal = jlp,
year = "1997",
volume = "30",
number = "1",
pages = "53--81",
url = "http://www.cs.bgu.ac.il/~mcodish/Papers/ppapers.html",
acknowledgement = ack-mmc,
}
@Article{codish97:jlpb,
author = "M. Codish and M. Garc\`\i a de la Banda and M.
Bruynooghe and M Hermenegildo",
title = "Exploiting Goal Independence in the Analysis of Logic
Programs",
journal = jlp,
year = "1997",
volume = "32",
number = "3",
pages = "247--261",
url = "http://www.cs.bgu.ac.il/~mcodish/Papers/ppapers.html",
acknowledgement = ack-mmc,
}
@Article{codish99:jlpa,
author = mike,
title = "Efficient Goal Directed Bottom-up Evaluation of Logic
Programs",
journal = jlp,
year = "1999",
volume = "38",
number = "3",
pages = "354--370",
url = "http://www.cs.bgu.ac.il/~mcodish/Papers/ppapers.html",
acknowledgement = ack-mmc,
}
@Article{codish99:jlpb,
author = "M. Codish and C. Taboch",
title = "A Semantic Basis for the Termination Analysis of Logic
Programs Goal",
journal = jlp,
year = "1999",
volume = "41",
number = "1",
pages = "103--123",
url = "http://www.cs.bgu.ac.il/~mcodish/Papers/ppapers.html",
acknowledgement = ack-mmc,
}
@Article{codish99:toplas,
author = "M. Codish and H. S{\o}ndergaard and P. Stuckey",
title = "Sharing and Groundness Dependencies in Logic
Programs",
journal = toplas,
year = "1999",
volume = "21",
number = "5",
pages = "948--976",
url = "http://www.cs.bgu.ac.il/~mcodish/Papers/ppapers.html",
acknowledgement = ack-mmc,
}
@Article{codish99:jlpc,
author = mike,
title = "Worst-Case Groundness Analysis using Positive Boolean
Functions",
journal = jlp,
year = "1999",
volume = "41",
number = "1",
pages = "125--18",
url = "http://www.cs.bgu.ac.il/~mcodish/Papers/ppapers.html",
acknowledgement = ack-mmc,
}
%
% Corsini et al.
%
@TechReport{mmc:gulp88,
author = "C. Codognet and M.-M. Corsini and G. Fil{\'e}",
title = "{O}ptimizations of {L}ogic {P}rograms based on their
{S}tatic {A}nalysis",
year = "1986",
institution = bxI,
number = "8624",
note = "also in Proc. of GULP88 (Italy)",
type = "Research Report",
acknowledgement = ack-mmc,
}
@TechReport{mmc:TR88,
author = "M.-M. Corsini and G. Fil{\'e}",
title = "The {A}bstract {I}nterpretation of {L}ogic {P}rograms:
{A} {G}eneral {A}lgorithm and its {C}orrectness",
type = "Research Report",
institution = "Department of Pure and Applied Mathematics, University
of Padova",
address = "Italy",
month = dec,
year = "1988",
acknowledgement = ack-mmc,
}
@TechReport{mmc:TR88b,
author = "M.-M. Corsini and G. Fil{\'e}",
title = "A {C}omplete {F}ramework for the {A}bstract
{I}nterpretation of {L}ogic {P}rograms: {T}heory and
{A}pplication",
year = "1988",
number = "3/88",
institution = "Univ. di Padov\`a, Italy",
type = "Technical Report",
acknowledgement = ack-mmc,
}
@InProceedings{mmc:spl90,
author = "C. Codognet and P. Codognet and M.-M. Corsini",
title = "{A}bstract {I}nterpretation from {P}rolog to
{C}oncurrent {P}rolog",
booktitle = "Actes du 8$^{\grave{e}me}$ S\'eminaire de
Programmation en Logique",
editor = "M. {Bourgault, S. et Dincbas}",
pages = "351--370",
address = "Tr\'egastel",
year = "1990",
acknowledgement = ack-mmc,
}
@InProceedings{mmc:informatika91,
author = "M.-M. Corsini and K. Musumbu",
title = "{T}ype {I}nference: a {N}ew {A}pproach",
booktitle = "Proc. of the French-Soviet Symposium Informatika'91",
pages = "231--244",
month = oct,
address = "Grenoble",
editor = "INRIA Rocquencourt",
year = "1991",
acknowledgement = ack-mmc,
}
@InProceedings{mmc:foret-noire91,
author = "M.-M. Corsini and K. Musumbu",
title = "{F}ailure {A}nalysis based on {A}bstract
{I}nterpretation",
booktitle = "{D}eclarative {P}rogramming {S}asbachwalden, 1991",
pages = "295--309",
publisher = "Springer Verlag",
editor = "J. Darlington and R. Dietrich",
series = "Workshops in Computing",
year = "1991",
acknowledgement = ack-mmc,
}
@InProceedings{mmc:jfpl92,
author = mmc,
title = "{I}ntelligent {B}acktracking based on {A}bstract
{I}nterpretation",
booktitle = jfpl92,
editor = ejfpl92,
year = "1992",
pages = "374--385",
acknowledgement = ack-mmc,
}
@InProceedings{mmc:preiclp91,
author = mmc,
title = "({Y}et) another {A}bstract and {U}nification for
{A}ccurate {G}roundness and {S}haring {A}nalysis based
on {G}raphs {T}raversing",
crossref = "Pre-ICLP91",
note = "Available as Research Report 92--56, LaBRI
Universit\'e Bordeaux I",
acknowledgement = ack-mmc,
}
@InProceedings{mmc:wsa92,
author = pi2,
title = "The $\mu$-calculus over {F}inite {D}omains as an
{A}bstract {S}emantics of {P}rolog",
pages = "51--59",
crossref = "WSA92",
acknowledgement = ack-mmc,
}
@Article{mmc:tcs93,
author = "M.-M. Corsini and K. Musumbu",
title = "{T}ype {I}nference: a {N}ew {A}pproach",
journal = "Theoretical Computer Science B",
publisher = "Elsevier",
year = "1993",
volume = "119",
pages = "23--38",
month = nov,
acknowledgement = ack-mmc,
}
@InProceedings{mmc:plilp93,
author = pi3,
title = "{E}fficient {A}bstract {I}nterpretation of {P}rolog
{P}rograms by means of {C}onstraint {S}olving over
{F}inite {D}omains (Extended Abstract)",
crossref = "PLILP93",
year = "1993",
acknowledgement = ack-mmc,
}
@TechReport{mmc:TR93,
author = pi3,
title = "{E}fficient {A}bstract {I}nterpretation of {P}rolog
{P}rograms by means of {C}onstraint {S}olving over
{F}inite {D}omains",
type = "Research Report",
institution = labri,
address = labriaddr,
number = "93--16",
note = "also Tech Report of University of Namur, Belgium",
year = "1993",
acknowledgement = ack-mmc,
}
%
% Cousot
%
@InProceedings{cousot:iclp91,
author = "P. Cousot",
title = "{A}bstract {I}nterpretation of {L}ogic {P}rograms",
month = jun,
year = "1991",
crossref = "ICLP91",
note = "Invited Talk",
acknowledgement = ack-mmc,
}
@Article{cousot:jlp92,
author = cousot,
title = "Abstract {I}nterpretation and {A}pplication to {L}ogic
{P}rograms",
journal = JLP,
volume = "13",
number = "2--3",
year = "1992",
note = "also Research Report 92--12, june 1992 at LIENS",
acknowledgement = ack-mmc,
}
%
% Debray et al.
%
@InProceedings{debray:iclp86,
author = "S. K. Debray and D. S. Warren",
title = "{D}etection and {O}ptimization of {F}unctional
{C}omputation in {P}rolog",
pages = "490--504",
crossref = "ICLP86",
acknowledgement = ack-mmc,
}
@InProceedings{debray:ieee86,
author = "S. K. Debray and D. S. Warren",
title = "{A}utomatic {M}ode {I}nference for {P}rolog
{P}rograms",
booktitle = "International Symposium on Logic Programming",
publisher = "{IEEE} Computer Society",
month = sep,
adress = "Salt Lake City",
pages = "78--88",
year = "1986",
acknowledgement = ack-mmc,
}
@TechReport{debray:TR87a,
author = "S. K. Debray",
title = "Approximation {D}omains for {E}fficient {F}low
{A}nalysis of {L}ogic {P}rograms",
institution = "Department of Computer Science, University of Arizona,
Tucson",
number = "TR 87/8-9",
year = "1987",
acknowledgement = ack-mmc,
}
@TechReport{debray:TR87b,
author = "S. K. Debray",
title = "{S}tatic {I}nference of {M}odes and {D}ata
{D}ependencies in {L}ogic {P}rograms",
year = "1987",
type = "Technical Report",
number = "87-24",
institution = "Dept. of Computer Science, University of Arizona",
month = aug,
acknowledgement = ack-mmc,
}
@InProceedings{debray:slp87,
author = "S. K. Debray",
title = "Flow {A}nalysis of a {S}imple {C}lass of {D}ynamic
{L}ogic {P}rograms",
pages = "307--317",
crossref = "SLP87",
acknowledgement = ack-mmc,
}
@InProceedings{debray:popl88,
author = "S. K. Debray",
title = "Efficient {D}ataflow {A}nalysis of {L}ogic
{P}rograms",
booktitle = "Proceedings of the Fifteenth Annual Symposium on
Principles of Programming Languages ({POPL}'88)",
address = "San Diego, California",
pages = "260--273",
year = "1988",
acknowledgement = ack-mmc,
}
@Article{debray:jlp88,
author = "S. K. Debray and D. S. Warren",
title = "Automatic {M}ode {I}nference for {L}ogic {P}rograms",
journal = "Journal of Logic Programming",
volume = "5",
number = "3",
month = sep,
pages = "207--230",
year = "1988",
acknowledgement = ack-mmc,
}
@Article{debray:toplas88,
author = "S. K. Debray and D. S. Warren",
title = "{F}unctional {C}omputations in {L}ogic {P}rograms",
journal = toplas,
volume = "11",
number = "3",
pages = "451--481",
month = jul,
publisher = acm,
year = "1988",
acknowledgement = ack-mmc,
}
@InProceedings{debray:iclp88,
author = "S. K. Debray",
title = "Static {A}nalysis of {P}arallel {L}ogic {P}rograms",
pages = "711--732",
crossref = "ICLP88",
acknowledgement = ack-mmc,
}
@Article{debray:acm89,
author = "S. K. Debray",
title = "{S}tatic {I}nference of {M}odes and {D}ata
{D}ependencies in {L}ogic {P}rograms",
year = "1989",
journal = toplas,
volume = "11",
number = "3",
pages = "418--450",
publisher = acm,
acknowledgement = ack-mmc,
}
@InProceedings{debray:sigplan90,
author = "S. K. Debray and N.-W. Lin and M. Hermenegildo",
title = "{T}ask {G}ranularity {A}nalysis in {L}ogic
{P}rograms",
pages = "174--188",
booktitle = "Proceedings of the ACM Sigplan'90 Conference on
Programming Language Design and Implementation",
year = "1990",
publisher = "ACM Press",
acknowledgement = ack-mmc,
}
@InProceedings{debray:preiclp91,
author = "S. K. Debray",
title = "The {M}ythical {F}ree {L}unch ({N}otes on the
{C}omplexity/{P}recision {T}radeoff in {D}ataflow
{A}nalysis of {L}ogic {P}rograms)",
crossref = "Pre-ICLP91",
year = "1991",
acknowledgement = ack-mmc,
}
@InProceedings{debray:iclp91,
author = "S. K. Debray and N.-W. Lin",
title = "{A}utomatic {C}omplexity {A}nalysis of {L}ogic
{P}rograms",
pages = "599--613",
crossref = "ICLP91",
acknowledgement = ack-mmc,
}
@Book{debray:jlp92,
editor = "S. K. Debray",
title = "Journal of {L}ogic {P}rogramming, {S}pecial {I}ssue:
{A}bstract {I}nterpretation",
publisher = "North-Holland",
volume = "13",
number = "1, 2",
month = jul,
year = "1992",
acknowledgement = ack-mmc,
}
@InProceedings{debray:icalp92,
author = "S. K. Debray",
title = "On the {C}omplexity of {D}ata--{Flow} {Logic}
{Programs}",
booktitle = "Proc. 19th International; Colloquium on Automata,
Languages and Programming (ICALP'92)",
series = "LNCS",
volume = "623",
pages = "509--520",
editor = "M. Kuich",
address = "Wien, Austria",
year = "1992",
acknowledgement = ack-mmc,
}
@Article{debray:jacm92,
author = "S. K. Debray",
title = "Efficient {D}ataflow {A}nalysis of {L}ogic
{P}rograms",
journal = jacm,
volume = "39",
number = "4",
year = "1992",
pages = "949--984",
acknowledgement = ack-mmc,
}
@InCollection{debray:collection94,
author = "S. K. Debray",
title = "Formal {B}ases for {D}ataflow {A}nalysis of {L}ogic
{P}rograms",
editor = "G. Levi",
booktitle = "Advances in logic programming theory",
publisher = "Oxford University Press",
year = "1994",
note = "To appear",
acknowledgement = ack-mmc,
}
@Article{debray:acm93,
author = "S. K. Debray and N.-W. Lin",
title = "Cost {A}nalysis of {L}ogic {P}rograms",
journal = toplas,
year = "1993",
number = "6",
volume = "15",
pages = "599--613",
publisher = acm,
acknowledgement = ack-mmc,
}
@Article{debray:JLP94,
author = "S. K. Debray and R. Ramakrishnan",
title = "Abstract {I}nterpretation of {L}ogic {P}rograms using
{M}agic {T}ransformations",
journal = jlp,
year = "1994",
volume = "18",
number = "2",
month = feb,
pages = "149--176",
acknowledgement = ack-mmc,
}
@TechReport{debray:tr94,
author = "S. K. Debray and P. L\'{o}pez Garc\'{\i}a and M.
Hermenegildo and N.-W. Lin",
title = "{L}ower {B}ound {C}ost {E}stimation for {L}ogic
{P}rograms",
type = "{T}echnical {R}eport {TR} {N}umber {CLIP}4/94.0",
institution = "T.U. of Madrid (UPM)",
address = "Facultad Inform\'atica UPM, 28660-Boadilla del Monte,
Madrid-Spain",
year = "1994",
month = mar,
acknowledgement = ack-mmc,
}
@InProceedings{debray:sas94,
author = "S. K. Debray and P. L{\'o}pez Garc{\'\i}a and M.
Hermenegildo and N.-W. Lin",
title = "Estimating the {C}omputational {C}ost of {L}ogic
{P}rograms",
crossref = "SAS94",
pages = "255--265",
note = "Invited Talk",
acknowledgement = ack-mmc,
}
@InProceedings{debray:IS1994,
author = "S. K. Debray and D. Gudeman and P. Bigot",
booktitle = "Logic Programming - Proceedings of the 1994
International Symposium",
title = "Detection and {O}ptimization of {S}uspension-free
{L}ogic {P}rograms",
pages = "487--501",
crossref = "IS1994",
acknowledgement = ack-mmc,
}
@Article{debray:toplas95,
author = "S. K. Debray",
title = "Abstract {I}nterpretation and {L}ow {L}evel {C}ode
{O}ptimization",
journal = toplas,
year = "1995",
volume = "17",
number = "2",
pages = "331--365",
month = mar,
acknowledgement = ack-mmc,
}
%
% Gilberto Fil{\'e} et al.
%
@InProceedings{gilberto:plilp91,
author = "G. Fil{\'e} and P. Sottero",
title = "Abstract {I}nterpretation for {T}ype {C}hecking",
crossref = "PLILP91",
pages = "311--322",
year = "1991",
acknowledgement = ack-mmc,
}
@InProceedings{gilberto:pepm91,
author = "A. Cortesi and G. Fil{\'e}",
title = "{A}bstract {I}nterpretation of {L}ogic {P}rograms: an
{A}bstract {D}omain for {G}roundness, {S}haring,
{F}reeness and {C}ompoundness {A}nalysis",
year = "1991",
editor = "P. Hudak and N. D. Jones",
booktitle = "Proceedings of the ACM SIGPLAN Symposium on partial
evaluation and semantics based program manipulation,
PEPM'91",
series = "Sigplan notices",
number = "26",
pages = "52--61",
note = "also available as Technical Report 4/91 of Dip. di
Matematica Universit\`a di Padova (Italy)",
acknowledgement = ack-mmc,
}
@InProceedings{gilberto:lics91,
author = "A. Cortesi and G. Fil{\'e} and W. Winsborough",
title = "{P}rop revisited: {P}ropositional {F}ormulas as
{A}bstract {D}omain for {G}roundness {A}nalysis",
pages = "322--327",
crossref = "LICS6",
acknowledgement = ack-mmc,
}
@InProceedings{gilberto:WSA91,
author = "P. Codognet and G. Fil{\'e}",
title = "Computations, {A}bstractions and {C}onstraints
(abstract)",
pages = "70--71",
crossref = "WSA91",
acknowledgement = ack-mmc,
}
@InProceedings{gilberto:iccl92,
author = "P. Codognet and G. Fil{\'e}",
title = "{C}omputations, {A}bstractions and {C}onstraints in
{L}ogic {P}rograms",
booktitle = "Proceedings of the IEEE International Conference on
Computer Languages, ICCL'92",
year = "1992",
publisher = "IEEE Press",
acknowledgement = ack-mmc,
}
@InProceedings{gilberto:gulp92,
author = "A. Cortesi and G. Fil{\'e} and S. Rossi",
title = "Abstract {I}nterpretation of {P}rolog: the {T}reatment
of the {B}uit-ins",
booktitle = gulp92,
year = "1992",
editor = edgulp92,
acknowledgement = ack-mmc,
}
@InProceedings{gilberto:icalp92,
author = "A. Cortesi and G. Fil{\'e} and W. Winsborough",
title = "Comparison of {A}bstract {I}nterpretations",
booktitle = "Proc. 19th International; Colloquium on Automata,
Languages and Programming (ICALP'92)",
series = lncs,
volume = "623",
pages = "521--532",
editor = "M. Kuich",
address = "Wien, Austria",
year = "1992",
ISSN = "0302-9743",
acknowledgement = ack-mmc,
}
@InProceedings{gilberto:gulp93a,
author = "A. Cortesi and G. Fil{\'e}",
title = "Comparison and {D}esign of {A}bstract {D}omains for
{S}haring {A}nalysis",
editor = edgulp93,
pages = "251--266",
booktitle = gulp93,
year = "1993",
publisher = "Mediterranean Press",
month = jun,
acknowledgement = ack-mmc,
}
@InProceedings{gilberto:gulp93b,
author = "G. Fil{\'e} and S. Rossi",
title = "Static {A}nalysis of {P}rolog with {CUT}",
editor = edgulp93,
pages = "325--340",
booktitle = gulp93,
year = "1993",
publisher = "Mediterranean Press",
month = jun,
acknowledgement = ack-mmc,
}
@InProceedings{gilberto:lpar93,
author = "G. Fil{\'e} and S. Rossi",
title = "Static {A}nalysis of {P}rolog with {CUT}",
crossref = "LPAR93",
pages = "134--145",
acknowledgement = ack-mmc,
}
@InProceedings{gilberto:IS1994,
author = "G. Fil{\'e} and F. Ranzato",
booktitle = "Logic Programming - Proceedings of the 1994
International Symposium",
title = "Improving {A}bstract {I}nterpretations by {S}ystematic
lifting to the {P}owerset",
pages = "655--669",
crossref = "IS1994",
acknowledgement = ack-mmc,
}
@TechReport{gilberto:TR94,
author = gilberto,
title = "Share $\times$ {F}ree: {S}imple and {C}orrect",
institution = padova,
year = "1994",
type = "Technical Report",
number = "TR 15",
acknowledgement = ack-mmc,
}
@InProceedings{gilberto:SAS95,
author = "A. Cortesi and G. Fil{\'e} and R. Giacobazzi and C.
Palamidessi and F. Ranzato",
title = "Complementation in {A}bstract {I}nterpretation",
crossref = "SAS95",
pages = "100--117",
acknowledgement = ack-mmc,
}
@Article{gilberto:toplas97,
author = "A. Cortesi and G. Fil{\'e} and R. Giacobazzi and C.
Palamidessi and F. Ranzato",
title = "Complementation in Abstract Interpretation",
journal = toplas,
year = "1997",
volume = "19",
number = "1",
pages = "7--47",
acknowledgement = ack-mmc,
}
@Article{gilberto:jlp99,
author = "A. Cortesi and G. Fil{\'e}",
title = "Sharing is Optimal",
journal = jlp,
year = "1999",
volume = "38",
number = "3",
pages = "371--386",
month = mar,
abstract = "One of the most popular abstract domains used for the
analysis of logic programs is the domain Sharing which
expresses the fact that computed substitutions bind
variables to terms containing common variables. Despite
the fact that this domain is widely used and studied,
it is not yet known whether its abstract operations are
complete or at least optimal. We solve this open
question showing that the operations of lub and
projection of Sharing are complete (and thus optimal),
whereas that of unification is optimal, but not
complete.",
acknowledgement = ack-mmc,
}
@Article{gilberto:tcs99,
author = "G. Fil{\'e} and F. Ranzato",
title = "The Powerset Operator on Abstract Interpretations",
journal = tcs,
year = "1999",
volume = "222",
number = "1-2",
pages = "77--111",
month = jul,
acknowledgement = ack-mmc,
}
%
% Giacobazzi
%
@InProceedings{roberto:gulp90,
author = "R. Barbuti and R. Giacobazzi",
title = "A {S}pecialization of {B}ottom-up {A}bstract
{I}nterpretation for {T}ype {I}nference in {L}ogic
{P}rogramming",
year = "1990",
editor = edgulp90,
pages = "229--244",
booktitle = gulp90,
acknowledgement = ack-mmc,
}
@InProceedings{roberto:iclp90,
author = "R. Giacobazzi and L. Ricci",
title = "Pipeline {O}ptimizations in {A}{N}{D}-{P}arallelism by
{A}bstract {I}nterpretation",
pages = "291--305",
year = "1990",
crossref = "ICLP90",
acknowledgement = ack-mmc,
}
@InProceedings{roberto:esop92,
author = "R. Giacobazzi and L. Ricci",
title = "Detecting {D}eterminate {C}omputations by a
{B}ottom-up {A}bstract {I}nterpretation",
booktitle = "Proceedings ESOP '92",
series = lncs,
volume = "582",
editor = "B. Krieg-Br{\"u}ckner",
publisher = sv,
pages = "167--181",
year = "1992",
acknowledgement = ack-mmc,
}
@Article{roberto:jscp92,
author = "R. Barbuti and R. Giacobazzi",
title = "A {B}ottom-up {P}olymorphic {T}ype {I}nference in
{L}ogic {P}rogramming",
journal = "Science of Computer Programming",
year = "1992",
volume = "19",
number = "3",
pages = "281--313",
acknowledgement = ack-mmc,
}
@InProceedings{roberto:fgcs92,
author = "R. Giacobazzi and S. K. Debray and G. Levi",
title = "A {G}eneralized {S}emantics for {C}onstraint {L}ogic
{P}rograms",
crossref = "ICOT92",
year = "1992",
pages = "581--591",
acknowledgement = ack-mmc,
}
@InProceedings{roberto:acm93a,
author = "M. Gabbrielli and R. Giacobazzi",
title = "Goal {I}ndependency and {C}all {P}atterns in the
{A}nalysis of {L}ogic {P}rograms",
booktitle = "Proceedings of the Ninth ACM Symposium on Applied
Computing",
pages = "394--399",
publisher = "ACM Press",
address = "Phoenix AZ",
month = mar,
year = "1994",
acknowledgement = ack-mmc,
}
@InProceedings{roberto:acm93b,
author = "B.-M. Chang and K.-M. Choe and R. Giacobazzi",
title = "Abstract {F}ilters: {I}mproving {B}ottom-up
{E}xecutions of {L}ogic {P}rograms by {T}wo-phase
{A}bstract {I}nterpretation",
booktitle = "Proceedings of the Ninth ACM Symposium on Applied
Computing",
publisher = "ACM Press",
address = "Phoenix AZ",
year = "1994",
month = mar,
note = "Also available as Research Report 93/06 LIX, France
Nov. 1993",
acknowledgement = ack-mmc,
}
@InProceedings{roberto:ilps95,
author = "R. Giacobazzi and F. Ranzato",
title = "Functional {D}ependencies and {M}oore--set
{C}ompletions of {A}bstract {I}nterpretations and
{S}emantics",
booktitle = "Logic Programming - Proceedings of the 1995
International Symposium",
pages = "321--335",
crossref = "IS1995",
acknowledgement = ack-mmc,
}
@Article{roberto:jlp95,
author = "R. Giacobazzi and S. K. Debray and G. Levi",
title = "Generalized {S}emantics and {A}bstract
{I}nterpretation for {C}onstraint {L}ogic {P}rograms",
journal = jlp,
year = "1995",
volume = "25",
number = "3",
pages = "191--247",
acknowledgement = ack-mmc,
}
@InProceedings{roberto:esop96,
author = "R. Giacobazzi and F. Ranzato",
title = "Compositional {O}ptimization of {D}isjunctive
{A}bstract {I}nterpretations",
editor = "H. R. Nielson",
volume = "1058",
series = lncs,
pages = "141--??",
booktitle = "Proc. of the 1996 European Symposium on Programming
(ESOP'96)",
year = "1996",
publisher = sv,
address = "Linkoping (Sweden)",
month = apr,
ISSN = "0302-9743",
url = "http://www.di.unipi.it/~giaco/giaco.html",
acknowledgement = ack-mmc,
}
@InProceedings{roberto:stacs96,
author = "R. Giacobazzi",
title = "Optimal {C}ollecting {S}emantics for {A}nalysis in a
{H}ierarchy of {L}ogic {P}rogram {S}emantics",
editor = "C. Puech",
volume = "1046",
series = lncs,
pages = "503--514",
booktitle = "Proc. of the 13th International Symposium on
Theoretical Aspects of Computer Science (STACS'96)",
year = "1996",
publisher = sv,
address = "Grenoble, (France)",
month = jan,
note = "(to appear)",
url = "http://www.di.unipi.it/~giaco/giaco.html",
acknowledgement = ack-mmc,
}
@Article{roberto:au96,
author = "R. Giacobazzi and C. Palamidessi and F. Ranzato",
title = "Weak {R}elative {P}seudo-{C}omplements of {C}losure
{O}perators",
journal = "Algebra Universalis",
year = "1996",
note = "Also available as Technical Report LIX/95/04, LIX,
Ecole Polytechnique, 91128 Palaiseau Cedex, France.",
acknowledgement = ack-mmc,
}
@InProceedings{roberto:alp96,
author = "R. Giacobazzi and F. Ranzato",
title = "Complementing {L}ogic {P}rogram {S}emantics",
crossref = "ALP96",
pages = "238--253",
acknowledgement = ack-mmc,
}
@Article{roberto:scp98,
author = "R. Giacobazzi and F. Ranzato",
title = "Optimal Domains for Disjunctive Abstract
Interpretation",
journal = scp,
year = "1998",
volume = "32",
number = "1-3",
pages = "177--210",
month = sep,
acknowledgement = ack-mmc,
}
@Article{roberto:tcs99,
author = "R. Giacobazzi and F. Ranzato",
title = "The Reduced Relative Power Operation on Abstract
Domains",
journal = tcs,
year = "1999",
volume = "216",
number = "1-2",
pages = "159--211",
month = mar,
acknowledgement = ack-mmc,
}
%
% Manuel Hermenegildo et al.
%
@TechReport{manuel:TR89,
author = "K. Muthukumar and M. Hermenegildo",
title = "{D}etermination of {V}ariable {D}ependence
{I}nformation at {C}ompile-{T}ime {T}hrough {A}bstract
{I}nterpretation",
month = mar,
type = "Technical Report",
year = "1989",
number = "ACA-ST-232-89",
institution = "Microelectronics and Computer Technology Corporation
(MCC), Austin, TX 78759",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:naclp89a,
author = "K. Muthukumar and M. Hermenegildo",
title = "{D}etermination of {V}ariable {D}ependence
{I}nformation through {A}bstract {I}nterpretation",
pages = "166--188",
crossref = "NACLP89",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:naclp89b,
author = "M. Hermenegildo and F. Rossi",
title = "On the {C}orrectness and {E}fficiency of {I}ndependent
{A}nd-{P}arallelism in {L}ogic {P}rograms",
crossref = "NACLP89",
pages = "369--389",
acknowledgement = ack-mmc,
}
@Misc{manuel:tutorial,
author = manuel,
title = "{A}bstract {I}nterpretation and its {A}pplications",
month = sep,
year = "1990",
howpublished = "Advanced School on Foundations of LP, Alghero Italy",
acknowledgement = ack-mmc,
}
@TechReport{manuel:TR90a,
author = "K. Muthukumar and M. Hermenegildo",
title = "{D}eriving {A} {F}ixpoint {C}omputation {A}lgorithm
for {T}op-down {A}bstract {I}nterpretation of {L}ogic
{P}rograms",
month = apr,
type = "Technical Report",
year = "1990",
number = "ACT-DC-153-90",
institution = "Microelectronics and Computer Technology Corporation
(MCC), Austin, TX 78759",
acknowledgement = ack-mmc,
}
@TechReport{manuel:TR90b,
author = "K. Muthukumar and M. Hermenegildo",
title = "{C}ombined {D}etermination of {S}haring and {F}reeness
of {P}rogram {V}ariables {T}hrough {A}bstract
{I}nterpretation",
institution = "Microelectronics and Computer Technology Corporation
(MCC), Austin, TX 78759",
number = "STP-368-90",
month = dec,
year = "1990",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:iclp90,
author = "M. Hermenegildo and F. Rossi",
title = "Non-{S}trict {I}ndependent {A}nd-{P}arallelism",
year = "1990",
crossref = "ICLP90",
pages = "237--252",
acknowledgement = ack-mmc,
}
@InCollection{manuel:iske90,
author = manuel,
title = "Bridging the {P}erformance {G}ap {B}etween
{D}eclarative and {I}mperative {L}anguages",
booktitle = "Fourth International Symposium on Knowledge
Engineering; Technical Sessions",
pages = "91--104",
publisher = "Univ. Politec. Madrid",
year = "1990",
keywords = "functional parallel logic prolog lisp",
abstract = "Symbolic languages of a more or less declarative
nature such as logic and functional programming
languages, appear ideally suited for the implementation
of knowledge-based systems. However, lower-level
languages are very often used in more 'practical'
applications and some commercial products. Arguments
often quoted as justifying such a move are the higher
execution speed of languages such as C and their
availability on standard platforms, in particular on
UNIX-based systems. In fact, modern versions of well
established languages such as Prolog and Lisp run well
on these platforms, often having excellent public
domain implementations apparently leaving speed as the
real argument. The thesis of this paper is that this
argument may very soon be unfounded: efficient,
high-performance multiprocessors are now a practical
reality and in the very short term desktop workstations
with several processors will be the norm. The paper
shows how using a parallelizing compiler performing an
abstract interpretation of the program an order of
magnitude speedup over state of the art sequential
systems can be obtained automatically in Prolog
programs, thus more than bridging the performance gap
with imperative languages. This claim is supported by
experimental results.",
acknowledgement = ack-mmc,
}
@TechReport{manuel:TR91a,
author = "M. Garc{\'\i}a de la Banda and M. Hermenegildo",
title = "Analyzing {C}onstraint {L}ogic {P}rograms",
institution = "Computer Science Dept, Universidad Politecnica de
Madrid",
address = "Facultad Informatica UPM, 28660-Boadilla del Monte,
Madrid-Spain",
type = "Technical Report",
month = sep,
year = "1991",
acknowledgement = ack-mmc,
}
@TechReport{manuel:TR91,
title = "Some {C}onsiderations on the {C}ompile-{T}ime
{A}nalysis of {C}onstraint {L}ogic {P}rograms",
author = "M. Garc{\'\i}a de la Banda and M. Hermenegildo",
year = "1991",
type = "Technical Report",
institution = "U. of Madrid (UPM)",
address = "Facultad Informatica UPM, 28660-Boadilla del Monte,
Madrid-Spain",
nore = "also published in PRODE'91, pp=97--117",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:preiclp91,
author = "F. Giannotti and M. Hermenegildo",
title = "A {T}echnique for {R}ecursive {I}nvariance {D}etection
and {S}elective {P}rogram {S}pecialization {U}sing
{A}bstract {I}nterpretation and {P}rogram
{T}ransformation",
crossref = "Pre-ICLP91",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:PLILP91,
author = "F. Giannotti and M. Hermenegildo",
title = "A {T}echnique for {R}ecursive {I}nvariance {D}etection
and {S}elective {P}rogram {S}pecialization {U}sing
{A}bstract {I}nterpretation and {P}rogram
{T}ransformation",
crossref = "PLILP91",
year = "1991",
pages = "323--334",
acknowledgement = ack-mmc,
}
@TechReport{manuel:cont-iclp91,
author = "M. Garc\'{\i}a de la Banda and M. Hermenegildo",
title = "{A}nalyzing {C}onstraint {L}ogic {P}rograms",
type = "Technical Report",
institution = "U. of Madrid (UPM)",
address = "Facultad Informatica UPM, 28660-Boadilla del Monte,
Madrid-Spain",
year = "1991",
note = "Presented in ICLP-91 Workshop on Constraint Logic
Programming, Paris",
abstract = "This paper addresses the issue of dataflow analysis
and implementation techniques for constraint logic
programming (CLP) languages, applying the technique of
abstract interpretation. First, the types of
optimizations possible in some CLP systems and the
information that has to be obtained at compile-time in
order to implement such optimizations are discussed.
Two approaches are then proposed and discussed for
obtaining this information for a CLP program: one based
on an analysis of a CLP metainterpreter using standard
Prolog analysis tools and a second one based on direct
analysis of the CLP program. Some experimental
conclusions are presented for the first approach. For
the second approach an abstract interpretation
framework is proposed and four abstract domains are
presented which approximate the information needed to
detect different constraint solver optimizations and to
exploit independent AND-parallelism. It is then shown
how these abstract domains can be merged obtaining a
powerful tool for analyzing CLP languages. A
particularization of this ``compound'' abstract domain
for CLP($\Re$) is also presented.",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:iclp91,
author = "K. Muthukumar and M. Hermenegildo",
title = "Combined {D}etermination of {S}haring and {F}reeness
of {P}rogram {V}ariables Through {A}bstract
{I}nterpretation",
pages = "49--63",
crossref = "ICLP91",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:wsa92,
author = "M. Garc\'{\i}a de la Banda and M. Hermenegildo",
title = "A {P}ractical {A}pplication of {S}haring and
{F}reeness {I}nference (Extended Abstract)",
crossref = "WSA92",
pages = "118--125",
year = "1992",
month = sep,
acknowledgement = ack-mmc,
}
@Article{manuel:jlp92a,
author = "M. Hermenegildo and R. Warren and S. K. Debray",
title = "{G}lobal {F}low {A}nalysis as a {P}ractical
{C}ompilation {T}ool",
year = "1992",
month = aug,
journal = JLP,
pages = "349--366",
volume = "13",
number = "4",
acknowledgement = ack-mmc,
}
@Article{manuel:jlp92b,
author = "K. Muthukumar and M. Hermenegildo",
title = "{C}ompile-time {D}erivation of {V}ariable {D}ependency
{U}sing {A}bstract {I}nterpretation",
journal = "Journal of Logic Programming",
volume = "13",
number = "1, 2, 3 and 4",
year = "1992",
pages = "315--347",
acknowledgement = ack-mmc,
}
@TechReport{manuel:TR92a,
author = "D. Cabeza and M. Hermenegildo",
title = "{E}xtracting {N}on-Strict {I}ndependent
{A}nd-Parallelism {U}sing {S}haring and {F}reeness
{I}nformation",
type = "{T}echnical {R}eport {TR} {N}umber {CLIP}5/92.0",
institution = "U. of Madrid (UPM)",
address = "Facultad Informatica UPM, 28660-Boadilla del Monte,
Madrid-Spain",
year = "1992",
month = aug,
acknowledgement = ack-mmc,
}
@TechReport{manuel:TR92b,
author = "D. Cabeza and M. Hermenegildo",
title = "{T}owards {E}xtracting {N}on-Strict {I}ndependent
{A}nd-Parallelism {U}sing {S}haring and {F}reeness
{I}nformation",
type = "{T}echnical {R}eport {TR} {N}umber {CLIP}5/92.1",
institution = "U. of Madrid (UPM)",
address = "Facultad Informatica UPM, 28660-Boadilla del Monte,
Madrid-Spain",
year = "1992",
month = aug,
acknowledgement = ack-mmc,
}
@TechReport{manuel:TR92c,
author = "M. Garc\'{\i}a de la Banda and M. Hermenegildo",
title = "A {P}ractical {A}pproach to the {G}lobal {A}nalysis of
{C}onstraint {L}ogic {P}rograms",
type = "Technical Report",
institution = "U. of Madrid (UPM)",
address = "Facultad Informatica UPM, 28660-Boadilla del Monte,
Madrid-Spain",
year = "1992",
month = apr,
note = "Presented at the 1992 FGCS Post-Conference Workshop on
Constraint Logic Programming",
acknowledgement = ack-mmc,
}
@TechReport{manuel:TR92d,
author = "K. Muthukumar and M. Garc\'{\i}a de la Banda and M.
Hermenegildo",
title = "Sharing and {F}reeness {A}nalysis of {L}ogic
{P}rograms using {A}bstract {I}nterpretation",
type = "Technical Report",
institution = "U. of Madrid (UPM)",
address = "Facultad Informatica UPM, 28660-Boadilla del Monte,
Madrid-Spain",
year = "1992",
month = nov,
acknowledgement = ack-mmc,
}
@InProceedings{manuel:ilps93a,
author = "M. Garc\`\i a de la Banda and M. Hermenegildo",
title = "A {P}ractical {A}pproach to the {G}lobal {A}nalysis of
{C}onstraint {L}ogic {P}rograms",
crossref = "ILPS93",
year = "1993",
pages = "437--455",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:ilps93b,
author = "M. Garc\`\i a de la Banda and M. Hermenegildo and K.
Marriott",
title = "Independence in {C}onstraint {L}ogic {P}rograms",
crossref = "ILPS93",
year = "1993",
pages = "130--146",
acknowledgement = ack-mmc,
}
@TechReport{manuel:TR93a,
author = "F. Bueno and M. Garc\'{\i}a de la Banda and M.
Hermenegildo",
title = "{E}ffectiveness of {G}lobal {A}nalysis in {S}trict
{I}ndependence-{B}ased {A}utomatic {P}rogram
{P}arallelization",
type = "{T}echnical {R}eport {TR} {N}umber {CLIP}7/93.0",
institution = "T.U. of Madrid (UPM)",
address = "Facultad Inform\'atica UPM, 28660-Boadilla del Monte,
Madrid-Spain",
year = "1993",
month = oct,
acknowledgement = ack-mmc,
}
@TechReport{manuel:TR93b,
author = "F. Bueno and M. Garc\'{\i}a de la Banda and M.
Hermenegildo",
title = "{C}ompile-time {O}ptimizations and {A}nalysis
{R}equirements for {CC} {P}rograms",
institution = "T.U. of Madrid (UPM)",
type = "Technical Report",
number = "{CLIP}6/93.0",
month = jul,
year = "1993",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:LOPSTR93,
author = "M. Olmedilla and F. Bueno and M. Hermenegildo",
title = "Automatic {E}xploitation of {N}on--{D}eterminate
{I}ndependent {A}nd--{P}arallelism in the {B}asic
{Andorra} {M}odel",
pages = "177--195",
crossref = "LOPSTR93",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:sas94,
author = "D. Cabeza Gras and M. Hermenegildo",
title = "Extracting {N}on--{S}trict {I}ndependent
{A}nd--{P}arallelism using {S}haring and {F}reeness
{I}nformation",
crossref = "SAS94",
pages = "297--313",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:IS1994,
author = "F. Bueno and M. Garc\'{\i}a de la Banda and M.
Hermenegildo",
booktitle = "Logic Programming - Proceedings of the 1994
International Symposium",
title = "Effectiveness of {G}lobal {A}nalysis in {S}trict
{I}ndependence-based {A}utomatic {P}arallelization",
pages = "320--336",
crossref = "IS1994",
acknowledgement = ack-mmc,
}
@Article{manuel:jlp95,
author = "M. Hermenegildo and F. Rossi",
title = "Strict and {N}on--{S}trict {A}nd-{P}arallelism in
{L}ogic {P}rograms: {C}orrectness, {E}fficiency and
{C}ompile--{T}ime {C}onditions",
journal = jlp,
year = "1995",
volume = "22",
pages = "1--46",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:pepm95,
author = "G. Puebla and M. Hermenegildo",
title = "Implementation of {M}ultiple {S}pecialization in
{L}ogic {P}rograms",
crossref = "PEPM95",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:plilp96,
author = "M. Garc{\'\i}a de la Banda and F. Bueno and M.
Hermenegildo",
title = "Towards {I}ndependent {A}nd--{P}arallelism in {CLP}",
crossref = "PLILP96",
pages = "77--91",
acknowledgement = ack-mmc,
}
@InProceedings{manuel:sas96,
author = "G. Puebla and M. Hermenegildo",
title = "Optimized {A}lgorithms for {I}ncremental {A}nalysis of
{L}ogic {P}rograms",
crossref = "SAS96",
pages = "270--284",
acknowledgement = ack-mmc,
}
@Article{manuel:jlp99,
author = "G. Puebla and M. Hermenegildo",
title = "Abstract Multiple Specialization and its Application
to Program Parallelization",
journal = jlp,
year = "1999",
volume = "41",
number = "2-3",
pages = "279--316",
abstract = "Program specialization optimizes programs for known
values of the input. It is often the case that the set
of possible input values is unknown, or this set is
infinite. However, a form of specialization can still
be performed in such cases by means of abstract
interpretation, specialization then being with respect
to abstract values (substitutions), rather than
concrete ones. We study the multiple specialization of
logic programs based on abstract interpretation. This
involves in principle, and based on information from
global analysis, generating several versions of a
program predicate for different uses of such predicate,
optimizing these versions, and, finally, producing a
new, {"}multiply specialized{"} program. While multiple
specialization has received theoretical attention,
little previous evidence exists on its practicality. In
this paper, we report on the incorporation of multiple
specialization in a parallelizing compiler and quantify
its effects. A novel approach to the design and
implementation of the specialization system is
proposed. The resulting implementation techniques
result in identical specializations to those of the
best previously proposed techniques but require little
or no modification of some existing abstract
interpreters. Our results show that, using the proposed
techniques, the resulting {"}abstract multiple
specialization{"} is indeed a relevant technique in
practice. In particular, in the parallelizing compiler
application, a good number of run-time tests are
eliminated and invariants extracted automatically from
loops, resulting generally in lower overheads and in
several cases in increased speedups.",
acknowledgement = ack-mmc,
}
@Article{manuel:parallelComp00,
author = manuel,
title = "Parallelizing Irregular and Pointer-Based Computations
Automatically: Perspectives from Logic and Constraint
Programming",
journal = pc,
year = "2000",
volume = "26",
number = "13-14",
pages = "1685--1708",
month = dec,
url = "http://www.clip.dia.fi.upm.es/~herme/",
acknowledgement = ack-mmc,
}
%
% Kim Mariott et Harald Sondergaard
%
@InProceedings{kim:iclp88,
author = "K. Marriott and H. S{\o}ndergaard",
title = "Bottom-up {A}bstract {I}nterpretation of {L}ogic
{P}rograms",
pages = "733--748",
year = "1988",
crossref = "ICLP88",
acknowledgement = ack-mmc,
}
@TechReport{kim:TR88,
author = "K. Marriott and H. S{\o}ndergaard",
title = "On {D}escribing {S}uccess {P}atterns of {L}ogic
{P}rograms",
institution = "The University of Melbourne",
number = "12",
year = "1988",
acknowledgement = ack-mmc,
}
@Unpublished{kim:tutorial,
author = "K. Marriott and H. S{\o}ndergaard",
title = "A {T}utorial on {A}bstract {I}nterpretation on {L}ogic
{P}rograms",
note = "Tutorial Notes for 1989 North American Conf.\ Logic
Programming. Assoc.\ for Logic Programming.",
year = "1989",
acknowledgement = ack-mmc,
}
@InProceedings{kim:ip89,
author = "K. Marriott and H. S{\o}ndergaard",
title = "Semantics-based {D}ataflow {A}nalysis of {L}ogic
{P}rograms",
editor = "G. Ritter",
pages = "601--606",
booktitle = "Information Processing 89",
publisher = "North-Holland",
year = "1989",
acknowledgement = ack-mmc,
}
@InProceedings{kim:gulp90,
author = "K. Marriott and H. S{\o}ndergaard",
title = "{A}bstract {I}nterpretation of {L}ogic {P}rograms :
the {D}enotational {A}pproach",
pages = "399--425",
year = "1990",
booktitle = gulp90,
editor = edgulp90,
acknowledgement = ack-mmc,
}
@InProceedings{kim:naclp90a,
author = "K. Marriott and H. S{\o}ndergaard",
title = "{A}nalysis of {C}onstraint {L}ogic {P}rograms",
pages = "531--547",
crossref = "NACLP90",
acknowledgement = ack-mmc,
}
@InProceedings{kim:naclp90b,
author = "K. Marriott and H. S{\o}ndergaard and P. Dart",
title = "A {C}haracterization of {N}on-{F}loundering {L}ogic
{P}rograms",
pages = "661--680",
year = "1990",
crossref = "NACLP90",
acknowledgement = ack-mmc,
}
@InProceedings{kim:slp91,
author = "N. J{\o}rgensen and K. Marriott and M. Spiro",
title = "Some {G}lobal {C}ompile-{T}ime {O}ptimizations for
{CLP(R)}",
pages = "420--434",
crossref = "SLP91",
acknowledgement = ack-mmc,
}
@TechReport{kim:TR92,
author = "K. Marriott and H. S{\o}ndergaard and N. Jones",
title = "Denotational {A}bstract {I}nterpretation of {L}ogic
{P}rograms",
type = "Technical Report",
number = "92/20",
institution = "Dept. of Comp. Sci. of the University of Melbourne",
year = "1992",
acknowledgement = ack-mmc,
}
@InProceedings{kim:jicslp92,
author = "P. Bigot and S. K. Debray and K. Marriott",
title = "Understanding {F}initeness {A}nalysis {U}sing
{A}bstract {I}nterpretation",
pages = "735--749",
crossref = "JICSLP92",
acknowledgement = ack-mmc,
}
@Article{kim:jlp92,
author = "K. Marriott and H. S{\o}ndergaard",
title = "Bottom-Up {D}ataflow {A}nalysis of {N}ormal {L}ogic
{P}rograms",
journal = JLP,
volume = "13",
number = "2 \& 3",
year = "1992",
month = jul,
pages = "181--204",
abstract = "A theory of semantics-based dataflow analysis using a
notion of ``insertion'' is presented. This notion
relaxes the Galois connections used in P. and R.
Cousot's theory of abstract interpretation. The aim is
to obtain a firm basis for the development of dataflow
analyses of normal logic programs. A dataflow analysis
is viewed as a non-standard semantics that approximates
the standard semantics by manipulating descriptions of
data objects rather than the objects themselves. A
Kleene logic-based semantics for normal logic programs
is defined, similar to Fitting's $\Phi_P$ semantics.
This provides the needed semantic base for
``bottom-up'' dataflow analyses. Such analyses give
information about the success and failure sets of a
program. A major application of bottom-up analysis is
therefore type inference. We detail a dataflow analysis
using descriptions similar to Sato and Tamaki's depth
$k$ abstractions and another using Marriott, Naish and
Lassez's ``singleton'' abstractions. We show that both
are sound with respect to our semantics and outline
various uses of the analyses. Finally we justify our
choice of semantics by showing that it is the most
abstract of a number of possible semantics. This means
that every analysis based on our semantics is correct
with respect to these other semantics, including
Kunen's semantics, SLDNF resolution, and the common
(sound) Prolog semantics.",
acknowledgement = ack-mmc,
}
@InProceedings{kim:popl93,
author = "K. Marriott and P. Stuckey",
title = "{T}he 3 {R}'s of {O}ptimizing {C}onstraint {L}ogic
{P}rograms: {R}efinement, {R}emoval, and {R}eordering",
year = "1993",
pages = "334--344",
booktitle = "Proceedings of the 19th. Annual {ACM} Conf. on
Principles of Programming Languages",
publisher = acm,
acknowledgement = ack-mmc,
}
@Article{kim:acta93,
author = "K. Marriott",
title = "Frameworks for {A}bstract {I}nterpretation",
journal = "Acta Informatica",
number = "2",
volume = "30",
pages = "103--125",
year = "1993",
acknowledgement = ack-mmc,
}
@InProceedings{kim:ilps93,
author = "K. Marriott and H. S{\o}ndergaard",
title = "On {P}ropagation-{B}ased {A}nalysis of {L}ogic
{P}rograms",
booktitle = "ILPS Workshop on Global Compilation",
pages = "45--65",
address = "Vancouver Canada",
month = nov,
year = "1993",
abstract = "Notions such as ``reexecution'' and ``propagation''
have recently attracted attention in dataflow analysis
of logic programs. Both techniques promise more
accurate dataflow analysis without requiring more
complex description domains. Propagation, however, has
never been given a formal definition. It has therefore
been difficult to discuss properties such as
correctness, precision, and termination of propagation.
We suggest a definition of propagation. Comparing
propagation-based analysis with the more conventional
approach based on abstract interpretation, we find that
propagation involves a certain inherent loss of
precision when dataflow analyses are based on
description domains which are not ``downwards closed''
(including mode analysis). In the archetypical
downwards closed case, groundness analysis, we contrast
approaches using Boolean functions as descriptions with
those using propagation or reexecution.",
acknowledgement = ack-mmc,
}
@TechReport{kim:TR93,
author = "K. Marriott and M. Garc{\'\i}a de la Banda and M.
Hermenegildo",
title = "{A}nalyzing {L}ogic {P}rograms with {D}ynamic
{S}cheduling",
type = "Technical Report",
number = "{CLIP}6/93.1",
institution = "T.U. of Madrid (UPM)",
address = "Facultad Informatica UPM, 28660-Boadilla del Monte,
Madrid-Spain",
year = "1992",
month = oct,
acknowledgement = ack-mmc,
}
@TechReport{kim:TR93a,
author = "K. Marriott and H. S{\o}ndergaard",
title = "Precise and {E}fficient {G}roundness {A}nalysis for
{L}ogic {P}rograms",
type = "Technical Report",
number = "93/7",
institution = "Dept. of Comp. Sci. of the University of Melbourne",
year = "1993",
acknowledgement = ack-mmc,
}
@Article{kim:loplas93,
author = "K. Marriott and H. S{\o}ndergaard",
title = "Precise and {E}fficient {G}roundness {A}nalysis for
{L}ogic {P}rograms",
journal = loplas,
volume = "2",
number = "1--4",
pages = "181--196",
month = mar,
year = "1993",
abstract = "We show how precise groundness information can be
extracted from logic programs. The idea is to use
abstract interpretation with Boolean functions as
``approximations'' to groundness dependencies between
variables. This idea is not new, and different classes
of Boolean functions have been used. We argue, however,
that one class, the \emph{positive} functions, is more
suitable than others. Positive Boolean functions have a
certain property which we (inspired by A. Langen) call
``condensation.'' This property allows for rapid
computation of groundness information.",
acknowledgement = ack-mmc,
}
@TechReport{kim:TR93b,
author = "K. Marriott and H. S{\o}ndergaard and N. D. Jones",
title = "Denotational {A}bstract {I}nterpretation of {L}ogic
{P}rograms",
institution = "Dept. Computer Science, Monash University",
number = "93/179",
month = mar,
year = "1993",
keywords = "TR 93 179, TR179, semantics, logic programming LP",
url = "http://www.cs.monash.edu.au/ (Comp Sci Monash home)",
acknowledgement = ack-mmc,
}
@Article{kim:ngc93,
author = "K. Marriott and H. S{\o}ndergaard",
title = "Difference-list {T}ransformation for {P}rolog",
journal = "New Generation Computing",
year = "1993",
volume = "11",
number = "2",
pages = "125--157",
month = oct,
abstract = "Difference-lists are terms that represent lists. The
use of difference-lists can speed up most
list-processing programs considerably. Prolog
programmers routinely use ``difference-list versions''
of programs, but very little investigation has taken
place into difference-list transformation. Thus, to
most programmers it is either unknown that the use of
difference-lists is far from safe in all contexts, or
else this fact is known but attributed to Prolog's
infamous ``occur check problem.'' In this paper we
study the transformation of list-processing programs
into programs that use difference-lists. In particular
we are concerned with finding circumstances under which
the transformation is safe. We show that dataflow
analysis can be used to determine whether the
transformation is applicable to a given program,
thereby allowing for automatic transformation. We prove
that our transformation preserves strong operational
equivalence.",
acknowledgement = ack-mmc,
}
@TechReport{kim:TR94,
author = "T. Armstrong and K. Marriott and P. Schachte and H.
S{\o}ndergaard",
title = "Two {C}lasses of {B}oolean {F}unctions for
{D}ependency {A}nalysis",
institution = "Dept. Computer Science, Monash University",
year = "1994",
number = "94/211",
type = "Technical Report",
acknowledgement = ack-mmc,
}
@InProceedings{kim:popl94,
author = "K. Marriott and M. Garc{\'\i}a de la Banda and M.
Hermenegildo",
title = "{A}nalyzing {L}ogic {P}rograms with {D}ynamic
{S}cheduling",
year = "1994",
month = jan,
pages = "240--253",
crossref = "POPL94",
acknowledgement = ack-mmc,
}
@InProceedings{kim:sas94,
author = "T. Armstrong and K. Marriott and P. Schachte and H.
S{\o}ndergaard",
title = "Boolean {F}unctions for {D}ependency {A}nalysis:
{A}lgebraic {P}roperties and {E}fficient
{R}epresentation",
crossref = "SAS94",
pages = "266--280",
acknowledgement = ack-mmc,
}
@Article{kim:toplas94,
author = "K. Marriott and H. S{\o}ndergaard and N. D. Jones",
title = "Denotational {A}bstract {I}nterpretation of {L}ogic
{P}rograms.",
journal = toplas,
volume = "16",
number = "3",
pages = "607--648",
month = may,
year = "1994",
acknowledgement = ack-mmc,
}
@InProceedings{kim:IS1994,
author = "K. Marriott and P. J. Stuckey",
booktitle = "Logic Programming - Proceedings of the 1994
International Symposium",
title = "Approximating {I}nteraction between {L}inear
{A}rithmetic {C}onstraints",
pages = "571--585",
crossref = "IS1994",
acknowledgement = ack-mmc,
}
%
% Baudouin et al.
%
@TechReport{baudouin:TR90,
author = "B. Le~Charlier and K. Musumbu and P. Van Hentenryck",
title = "{E}fficient and {A}ccurate {A}lgorithms for the
{A}bstract {I}nterpretation of {Prolog} {P}rograms",
institution = "Institute of Computer Science, University of Namur,
Belgium",
year = "1990",
type = "Technical Report",
number = "37/90",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:plilp90,
author = "P. De Boeck and B. Le~Charlier",
title = "{S}tatic {T}ype {A}nalisys of {Prolog} {P}rocedures
for ensuring {C}orrectness",
pages = "222--237",
crossref = "PLILP90",
acknowledgement = ack-mmc,
}
@TechReport{baudouin:TR91,
author = "V. Englebert and B. Le~Charlier and D. Roland and P.
Van Hentenryck",
title = "{G}eneric {A}bstract {I}nterpretation {A}lgorithms for
{P}rolog: {T}wo {O}ptimization {T}echniques and their
{E}xperimental {E}valuation",
institution = "Institute of Computer Science, University of Namur
Belgium",
year = "1991",
note = "also Brown University: Technical Report No. CS-91-67",
month = dec,
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:iclp91,
author = "B. Le~Charlier and K. Musumbu and P. Van Hentenryck",
title = "A {G}eneric {A}bstract {I}nterpretation {A}lgorithm
and its {C}omplexity {A}nalysis",
pages = "64--78",
crossref = "ICLP91",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:preiclp91,
author = "P. De Boeck and B. Le~Charlier",
title = "Using {S}tatic {T}ype {A}nalysis for {C}onstructing
{C}orrect {Prolog} {P}rocedures",
crossref = "Pre-ICLP91",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:wsa91,
author = "P. De Boeck and B. Le~Charlier",
title = "Automatic {C}onstruction of {P}rolog {P}rimitives for
{T}ype {C}hecking {A}nalysis",
pages = "165--172",
crossref = "WSA91",
acknowledgement = ack-mmc,
}
@TechReport{baudouin:TR92,
author = "B. Le~Charlier and S. Rossi",
title = "{A}n {A}ccurate {A}bstract {I}nterpretation
{F}ramework for {P}rolog with {C}ut",
year = "1993",
institution = "Institute of Computer Science, University of Namur,
Belgium",
month = dec,
number = "92-51",
acknowledgement = ack-mmc,
}
@TechReport{baudouin:TR92a,
author = "B. Le~Charlier and P. Van Hentenryck",
title = "A {U}niversal {T}op--{D}own {F}ixpoint {A}lgorithm",
institution = brown,
year = "1992",
type = "Technical Report",
number = "CS--92--25",
address = brownaddr,
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:jfpl92,
author = "B. Le~Charlier and K. Musumbu",
title = "Une {S}\'emantique {O}p\'erationnelle {I}nstrumentale
pour {P}rolog et son application \`a la {P}reuve de
{C}onsistance d'un mod\`ele d'{I}nterpr\'etation
{A}bstraite",
booktitle = jfpl92,
editor = ejfpl92,
pages = "386--400",
year = "1992",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:wsa92,
author = "B. Le~Charlier and P. Van Hentenryck",
title = "On the {D}esign of {G}eneric {A}bstract
{I}nterpretation {F}rameworks",
year = "1992",
pages = "229--246",
crossref = "WSA92",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:plilp92,
author = "V. Englebert and B. Le~Charlier and D. Roland and P.
Van Hentenryck",
title = "{G}eneric {A}bstract {I}nterpretation {A}lgorithms for
{P}rolog: {T}wo {O}ptimization {T}echniques and their
{E}xperimental {E}valuation ({E}xtended {A}bstract)",
crossref = "PLILP92",
pages = "310--325",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:iccl92,
author = "B. Le~Charlier and P. Van Hentenryck",
title = "{E}xperimental {E}valuation of a {G}eneric {A}bstract
{I}nterpretation {A}lgorithm for {Prolog}",
crossref = "ICCL92",
pages = "137--146",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:jicslp92,
author = "B. Le~Charlier and P. Van Hentenryck",
title = "{R}eexecution in {A}bstract {I}nterpretation of
{P}rolog",
pages = "750--764",
crossref = "JICSLP92",
acknowledgement = ack-mmc,
}
@TechReport{baudouin:TR93a,
author = "O. Degimbe and B. Le~Charlier and L. Michel and P. Van
Hentenryck",
title = "{A}bstract {I}nterpretation of {P}rolog {B}ased on
{OLDT}-{R}esolution",
institution = "Institute of Computer Science, University of Namur,
Belgium",
year = "1993",
type = "Report",
number = "93-10",
note = "(also Brown University)",
url = "ftp://ftp.cs.brown.edu/pub/reports/93/cs93-05.ps.Z",
acknowledgement = ack-mmc,
}
@TechReport{baudouin:TR93b,
author = "O. Degimbe and B. Le~Charlier and L. Michel and P. Van
Hentenryck",
title = "The {Impact} of {Granularity} in {Abstract}
{Interpretation} of {P}rolog",
institution = "Institute of Computer Science, University of Namur,
Belgium",
year = "1993",
type = "Report",
number = "93-11",
note = "(also Brown University)",
acknowledgement = ack-mmc,
}
@TechReport{baudouin:TR93c,
author = "A. Cortesi and B. Le~Charlier and P. Van Hentenryck",
title = "Conceptual and {S}oftware {S}upport for {A}bstract
{D}omain {D}esign: {G}eneral {S}tructural {D}omain and
{O}pen {P}roduct",
institution = brown,
year = "1993",
type = "Technical Report",
number = "CS-93-13",
acknowledgement = ack-mmc,
}
@Article{baudouin:SPE93,
author = "V. Englebert and B. Le~Charlier and D. Roland and P.
Van Hentenryck",
title = "{G}eneric {A}bstract {I}nterpretation {A}lgorithms for
{P}rolog: {T}wo {O}ptimization {T}echniques and their
{E}xperimental {E}valuation",
year = "1993",
journal = "Software -- Practice and Experience",
volume = "23",
number = "4",
pages = "419--459",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:pepm93,
author = "B. Le~Charlier and P. Van Hentenryck",
title = "{G}roundness {A}nalysis for {P}rolog: {I}mplementation
and {E}valuation of the {D}omain {P}rop",
crossref = "PEPM93",
year = "1993",
pages = "99--110",
note = "(extended abstract)",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:wsa93a,
author = "O. Degimbe and B. Le~Charlier and L. Michel and P. Van
Hentenryck",
title = "Optimization {T}echniques for {G}eneral {P}urpose
{F}ixpoint {A}lgorithms: {P}ractical {E}fficiency for
the {A}bstract {I}nterpretation of {P}rolog",
crossref = "WSA93",
pages = "15--26",
year = "1993",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:wsa93b,
author = "O. Degimbe and B. Le~Charlier and L. Michel and P. Van
Hentenryck",
title = "The {I}mpact of {G}ranualrity in {A}bstract
{I}nterpretation of {P}rolog",
crossref = "WSA93",
pages = "1--14",
year = "1993",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:LOPSTR93,
author = "P. De Boeck and B. Le~Charlier",
title = "Mechanical {T}ransformation of {L}ogic {D}efinitions
{A}ugmented with {T}ype {I}nformation into {Prolog}
{P}rocedures: {S}ome {E}xperiments",
crossref = "LOPSTR93",
acknowledgement = ack-mmc,
}
@Article{baudouin:toplas94,
author = "B. Le~Charlier and P. Van Hentenryck",
title = "{E}xperimental {E}valuation of a {G}eneric {A}bstract
{I}nterpretation {A}lgorithm for {Prolog}",
journal = toplas,
year = "1994",
volume = "16",
number = "1",
pages = "35--101",
publisher = acm,
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:popl94,
author = "A. Cortesi and B. Le~Charlier and P. Van~Hentenryck",
title = "Combinations of {A}bstract {D}omains for {L}ogic
{P}rogramming",
crossref = "POPL94",
pages = "227--239",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:sigplan94,
author = "P. Van~Hentenryck and A. Cortesi and B. Le~Charlier",
title = "Type {A}nalysis of {P}rolog using {T}ype {G}raphs",
volume = "29",
number = "6",
series = "SIGPLAN Notices",
pages = "337--348",
booktitle = "Proceedings of the ACM SIGPLAN'94 Conference on
Programming Language Design and Implementation",
year = "1994",
publisher = acm,
month = jun,
note = "also Tech. Report CS--93--52 at Brown University",
acknowledgement = ack-mmc,
}
@TechReport{baudouin:TR94a,
author = "B. Le~Charlier and S. Rossi and P. Van~Hentenryck",
title = "An {A}bstract {I}nterpretation {F}ramework for
(almost) {F}ull {P}rolog",
institution = brown,
address = brownaddr,
year = "1994",
type = "Technical Report",
number = "CS--94--16",
month = apr,
acknowledgement = ack-mmc,
}
@TechReport{baudouin:TR94b,
author = "C. Braem and B. Le~Charlier and S. Modart and P.
Van~Hentenryck",
title = "Cardinality {A}nalysis of {P}rolog",
institution = brown,
address = brownaddr,
year = "1994",
type = "Technical Report",
number = "CS--94--17",
month = apr,
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:IS1994a,
author = "B. Le~Charlier and S. Rossi and P. van Hentenryck",
booktitle = "Logic Programming - Proceedings of the 1994
International Symposium",
title = "An {A}bstract {I}nterpretation {F}ramework which
{A}ccurately {H}andles {P}rolog {S}earch-{R}ule and the
{C}ut",
pages = "157--171",
crossref = "IS1994",
acknowledgement = ack-mmc,
}
@InProceedings{baudouin:IS1994b,
author = "C. Braem and B. Le~Charlier and S. Modar and P. Van
Hentenryck",
booktitle = "Logic Programming - Proceedings of the 1994
International Symposium",
title = "Cardinality {A}nalysis of {P}rolog",
pages = "457--471",
crossref = "IS1994",
acknowledgement = ack-mmc,
}
@Article{baudouin:acta95,
author = "B. Le~Charlier and P. Van~Hentenryck",
title = "Reexecution in {A}bstract {I}nterpretation of
{P}rolog",
journal = "Acta Informatica",
year = "1995",
volume = "32",
number = "3",
pages = "209--253",
acknowledgement = ack-mmc,
}
@Article{baudouin:jlp99,
author = "B. Le~Charlier and C. Lecl{\`e}re and S. Rossi and A.
Cortesi",
title = "Automated Verification of Prolog Programs",
journal = jlp,
year = "1999",
volume = "39",
number = "1-3",
pages = "3--42",
month = apr,
abstract = "Although Prolog is (still) the most widely used logic
language, it suffers from a number of drawbacks which
prevent it from being truely declarative. The
nondeclarative features such as the depth-first search
rule are nevertheless necessary to make Prolog
reasonably efficient. Several authors have proposed
methodologies to reconcile declarative programming with
the algorithmic features of Prolog. The idea is to
analyse the logic program with respect to a set of
properties such as modes, types, sharing, termination,
and the like in order to ensure that the operational
behaviour of the Prolog program complies with its logic
meaning. Such analyses are tedious to perform by hand
and can be automated to some extent. This paper
presents a state-of-the-art analyser which allows one
to integrate many individual analyses previously
proposed in the literature as well as new ones.
Conceptually, the analyser is based on the notion of
abstract sequence which makes it possible to collect
all kinds of desirable information, including relations
between the input and output sizes of terms,
multiplicity, and termination.",
acknowledgement = ack-mmc,
}
@Article{baudouin:scp00,
author = "A. Cortesi and B. Le~Charlier and P. Van~Hentenryck",
title = "Combinations of Abstract Domains for Logic
Programming: Open Product and Generic Pattern
Construction",
journal = scp,
year = "2000",
volume = "38",
number = "1-3",
pages = "27--71",
month = aug,
acknowledgement = ack-mmc,
}
%
% Pascal
%
@TechReport{pvh:TR95,
author = "V. Ramachandran and P. Van~Hentenryck",
title = "{LS}ign {R}eordered",
institution = brown,
year = "1995",
type = "Technical Report",
number = "CS--95--12",
address = brownaddr,
month = apr,
acknowledgement = ack-mmc,
}
@Article{pvh:jlp95a,
author = "P. Van Hentenryck and A. Cortesi and B. Le~Charlier",
title = "Type {A}nalysis of {P}rolog using {T}ype {G}raphs",
journal = jlp,
year = "1995",
volume = "22",
number = "3",
pages = "179--210",
acknowledgement = ack-mmc,
}
@Article{pvh:jlp95b,
author = "P. Van Hentenryck and A. Cortesi and B. Le~Charlier",
title = "Evaluation of the {D}omain {{\tt PROP}}",
journal = jlp,
year = "1995",
volume = "23",
number = "3",
month = jun,
pages = "237--278",
note = "Extended version of~\cite{baudouin:pepm93}",
acknowledgement = ack-mmc,
}
@InProceedings{pvh:SAS95,
author = "V. Ramachandran and P. Van Hentenryck",
title = "{LS}ign {R}eordered",
crossref = "SAS95",
pages = "330--347",
acknowledgement = ack-mmc,
}
%
% Will
%
@TechReport{will:TR87,
author = "W. Winsborough",
title = "A {M}inimal {F}unction {G}raph {S}emantics for {L}ogic
{P}rograms",
institution = "Computer Science Department",
year = "1987",
type = "Technical Report",
number = "TR-711",
address = "Univ. of Winsconsin at Madison",
month = aug,
acknowledgement = ack-mmc,
}
@InProceedings{will:iclp88,
author = "W. Winsborough and A. Waern",
title = "Transparent {A}nd-{P}arallelism in the {P}resence of
{S}hared {F}ree {V}ariables",
pages = "749--764",
crossref = "ICLP88",
acknowledgement = ack-mmc,
}
@InProceedings{will:naclp89,
title = "Path-{D}ependent {R}eachability {A}nalysis for
{M}ultiple {S}pecialization",
author = "W. Winsborough",
pages = "133--153",
year = "1989",
crossref = "NACLP89",
acknowledgement = ack-mmc,
}
@InProceedings{will:slp91,
author = "I. Foster and W. Winsborough",
title = "Copy {A}voidance through {C}ompile-{T}ime {A}nalysis
and {L}ocal {R}euse",
pages = "455--469",
crossref = "SLP91",
acknowledgement = ack-mmc,
}
@Article{will:jlp92,
author = "W. Winsborough",
title = "Multiple {S}pecialization using {M}inimal--{F}unction
{G}raph {S}emantics",
journal = jlp,
year = "1992",
volume = "13",
number = "2 \& 3",
pages = "259--290",
acknowledgement = ack-mmc,
}
@InProceedings{will:plilp96,
author = "G. Weyer and W. Winsborough",
title = "Annotated {S}tructure {S}hape {G}raphs for {A}bstract
{A}nalysis of {P}rolog",
crossref = "PLILP96",
pages = "92--106",
acknowledgement = ack-mmc,
}
%%%%%%% DES EQUIPES %%%%%%%%%
% Equipe Pisane...
@InProceedings{pise:plilp88,
author = "R. Barbuti and M. Martelli",
title = "A {T}ool to {C}heck the {N}on--{F}loundering {L}ogic
{P}rograms and {G}oals",
crossref = "PLILP88",
pages = "58--67",
acknowledgement = ack-mmc,
}
@TechReport{pise:TR89,
author = "R. Barbuti and R. Giacobazzi and G. Levi",
title = "Declarative {A}pproach to {A}bstract {I}nterpretation
of {L}ogic {P}rogramming",
institution = pise,
number = "20/89",
type = "Technical Report",
year = "1989",
acknowledgement = ack-mmc,
}
@InProceedings{pise:ictcs89,
author = "R. Barbuti and R. Giacobazzi and G. Levi",
title = "A {D}eclarative {A}bstract {S}emantics for {L}ogic
{P}rograms",
booktitle = "Proc. of the Third Italian Conference on Theoretical
Computer Science",
editor = "A. Bertoni and C. B{\"o}hm and P. Miglioli",
publisher = "World Scientific",
year = "1989",
pages = "84--96",
acknowledgement = ack-mmc,
}
@TechReport{pise:TR91,
title = "A {G}eneral {F}ramework for {S}emantics based
{B}ottom-{U}p {A}bstract {I}nterpretation for {L}ogic
{P}rogramming",
author = "R. Barbuti and R. Giacobazzi and G. Levi",
number = "TR-12/91",
institution = pise,
month = jun,
year = "1992",
type = "Technical Report",
acknowledgement = ack-mmc,
}
@InProceedings{pise:WSA91,
author = "R. Barbuti and M. Codish and R. Giacobazzi and G.
Levi",
title = "Modelling {P}rolog {C}ontrol",
pages = "117--124",
crossref = "WSA91",
acknowledgement = ack-mmc,
}
@InProceedings{pise:wsa92,
author = "R. Bagnara and R. Giacobazzi and G. Levi",
title = "Static {A}nalysis of {CLP} {P}rograms over {N}umeric
{D}omains (Extended Abstract)",
crossref = "WSA92",
year = "1992",
pages = "43--50",
acknowledgement = ack-mmc,
}
@InProceedings{pise:popl92,
author = "R. Barbuti and M. Codish and R. Giacobazzi and G.
Levi",
title = "Modelling {P}rolog {C}ontrol",
booktitle = "Proceedings of the Nineteenth ACM Symposium on
Principles of Programming Languages",
pages = "95--104",
year = "1992",
month = jan,
address = "New Mexico",
acknowledgement = ack-mmc,
}
@MastersThesis{pise:bagnaraMS92,
author = "R. Bagnara",
title = "Interpretazione {A}stratta di {L}inguaggi {L}ogici con
{V}incoli su {D}omini {F}initi",
school = "University of Pisa",
year = "1992",
month = jul,
note = "(in Italian)",
acknowledgement = ack-mmc,
}
@Article{pise:pls93,
author = "R. Barbuti and R. Giacobazzi and G. Levi",
title = "A {G}eneral {F}ramework for {S}emantics based
{B}ottom-{U}p {A}bstract {I}nterpretation for {L}ogic
{P}rogramming",
journal = toplas,
number = "1",
volume = "15",
month = jan,
year = "1993",
pages = "133--181",
publisher = acm,
acknowledgement = ack-mmc,
}
@Article{pise:jlp93,
author = "R. Barbuti and M. Codish and R. Giacobazzi and G.
Levi",
title = "Modelling {P}rolog {C}ontrol",
journal = "The Journal of Logic and Computation",
year = "1993",
volume = "3",
number = "6",
pages = "579--604",
acknowledgement = ack-mmc,
}
@TechReport{pise:TR93,
title = "Generalized {S}emantics and {A}bstract
{I}nterpretation for {C}onstaint {L}ogic
{P}rogramming",
author = "R. Giacobazzi and S. K. Debray and G. Levi",
institution = pise,
number = "TR 22/93",
year = "1993",
type = "Technical Report",
acknowledgement = ack-mmc,
}
@InProceedings{pise:amast93,
author = "R. Giacobazzi and S. K. Debray and G. Levi",
title = "Joining {A}bstract and {C}oncrete {C}omputations in
{C}onstraint {L}ogic {P}rogramming",
editor = "M. Nivat and C. Rattray and T. Rus and G. Scollo",
booktitle = "Proc. of Third Int. Conf. on Algebraic Methodology and
Software Technology, AMAST'93",
series = "Workshops in Computing",
publisher = "Springer-Verlag",
year = "1993",
pages = "111--130",
acknowledgement = ack-mmc,
}
@InProceedings{pise:lics93,
author = "M. Falaschi and M. Gabbrielli and K. Marriott and C.
Palamidessi",
title = "Compositional {A}nalysis for {C}oncurrent {C}onstraint
{P}rogramming",
crossref = "LICS8",
pages = "210--221",
year = "1993",
acknowledgement = ack-mmc,
}
@InProceedings{pise:ieee93,
author = "R. Bagnara and R. Giacobazzi and G. Levi",
title = "An {A}pplication of {C}onstraint {P}ropagation to
{D}ata-flow {A}nalysis",
booktitle = "Proc of Ninth IEEE Conference on AI Applications",
year = "1993",
month = mar,
publisher = "IEEE Computer Society Press",
address = "Orlando FL",
pages = "270--276",
acknowledgement = ack-mmc,
}
@InProceedings{pise:gulp93a,
author = "J.-M. Andreoli and T. Castagnetti and R. Pareschi",
title = "Abstract {I}nterpretation of {C}oncurrent {L}anguages
based on {L}inear {L}ogic",
editor = edgulp93,
pages = "267--281",
booktitle = gulp93,
year = "1993",
publisher = "Mediterranean Press",
month = jun,
acknowledgement = ack-mmc,
}
@InProceedings{pise:gulp93b,
author = "M. Gabbrielli and R. Giacobazzi and D. Montesi",
title = "Modular {L}ogic {P}rograms over {F}inite {D}omains",
editor = edgulp93,
pages = "663--678",
booktitle = gulp93,
year = "1993",
publisher = "Mediterranean Press",
month = jun,
acknowledgement = ack-mmc,
}
@InProceedings{pise:ilps93,
author = "J.-M. Andreoli and R. Pareschi and T. Castagnetti",
title = "Abstract {I}nterpretation of {L}inear {L}ogic
{P}rogramming",
crossref = "ILPS93",
year = "1993",
pages = "295--314",
acknowledgement = ack-mmc,
}
@InProceedings{pise:gulp94,
author = "R. Bagnara",
title = "On the {D}etection of {I}mplicit and {R}edundant
{N}umeric {C}onstraints in {CLP} {P}rograms",
booktitle = "Joint Conference on Declarative Programming
(GULP-PRODE'94)",
year = "1994",
address = "Pe{\~ n}{\' \i}scola, Spain",
month = sep,
pages = "312--326",
acknowledgement = ack-mmc,
}
@InProceedings{pise:gulp95,
author = "G. Levi and D. Micciancio",
title = "Analysis of pure {PORLOG} programs",
crossref = "GULP95",
pages = "521--532",
booktitle = "Proceedings of the 1995 Joint Conference on
Declarative Programming (GULP--PRODE'95)",
acknowledgement = ack-mmc,
}
@TechReport{pise:bagnara96,
author = "R. Bagnara",
title = "On the {D}etaction of {I}mplicit and {R}edundant
{N}umeric {C}onstraints in {CLP} {P}rograms",
institution = pise,
year = "1996",
type = "Technical Report",
number = "TR-96-10",
note = "To Appear on a special issue of Science of Computer
Programming",
acknowledgement = ack-mmc,
}
@InProceedings{pise:plilp96,
author = "R. Bagnara",
title = "A {R}eactive {I}plementation of {P}os using {ROBDDs}",
crossref = "PLILP96",
pages = "107--121",
acknowledgement = ack-mmc,
}
@Article{pise:bagnara98,
author = "R. Bagnara",
title = "A Hierarchy of Constraint Systems for Data-Flow
Analysis of Constraint Logic-based Languages",
journal = scp,
year = "1998",
volume = "30",
number = "1-2",
pages = "119--155",
month = jan,
abstract = "Many interesting analyses for constraint logic-based
languages are aimed at the detection of monotonic
properties, that is to say, properties that are
preserved as the computation progresses. Our basic
claim is that most, if not all, of these analyses can
be described within a unified notion of constraint
domains. We present a class of constraint systems that
allows for a smooth integration within an appropriate
framework for the definition of non- standard semantics
of constraint logic-based languages. Such a framework
is also presented and motivated. We then show how such
domains can be built, as well as construction
techniques that induce a hierarchy of domains with
interesting properties. In particular, we propose a
general methodology for domain combination with
asynchronous interaction (i.e., the interaction is not
necessarily synchronized with the domains' operations).
By following this methodology, interesting combinations
of domains can be expressed with all the semantic
elegance of concurrent constraint programming
languages.",
acknowledgement = ack-mmc,
}
% padoue
@TechReport{padoue:TR,
author = "A. Cortesi and G. Fil{\'e}",
title = "Comparing and {I}mproving: {A}bstract {D}omains for
{S}haring {A}nalysis",
institution = padova,
type = "Rapporto Interno",
acknowledgement = ack-mmc,
}
@TechReport{padoue:TR91a,
author = "A. Cortesi and G. Fil{\'e} and W. Winsborough",
title = "Equivalence of {A}bstract {D}omains for {G}roundness
{A}nalysis",
institution = padova,
year = "1991",
type = "Rapporto Interno",
number = "8/91",
acknowledgement = ack-mmc,
}
@TechReport{padoue:TR91b,
author = "A. Cortesi and G. Fil{\'e}",
title = "{A}bstract {I}nterpretation of {P}rolog: the
{T}reatment of the {B}uilt-ins",
institution = padova,
year = "1991",
type = "Rapporto Interno",
number = "11",
month = oct,
acknowledgement = ack-mmc,
}
@TechReport{padoue:TR91c,
author = "A. Cortesi and G. Fil{\'e} and W. Winsborough",
title = "Comparison of {A}bstract {I}nterpretations",
institution = padova,
year = "1991",
type = "Rapporto Interno",
number = "14",
month = nov,
acknowledgement = ack-mmc,
}
@TechReport{padoue:TR92,
author = "A. Cortesi and G. Fil{\'e}",
title = "Freeness {C}omputation in {A}bstract
{I}nterpretation",
institution = padova,
year = "1992",
type = "Rapporto Interno",
number = "2/92",
month = mar,
acknowledgement = ack-mmc,
}
@TechReport{padoue:TR94,
author = "A. Cortesi and G. Fil{\'e} and W. Winsborough",
title = "Optimal {G}roundness {A}nalysis {U}sing
{P}ropositional {F}ormulas",
institution = padova,
year = "1994",
type = "Rapporto Interno",
number = "94/11",
acknowledgement = ack-mmc,
}
@Article{padoue:jlp96,
author = "A. Cortesi and G. Fil{\'e} and W. Winsborough",
title = "Optimal {G}roundness {A}nalysis {U}sing
{P}ropositional {L}ogic",
journal = jlp,
year = "1996",
volume = "27",
number = "2",
pages = "137--167",
month = may,
acknowledgement = ack-mmc,
}
% Des belges ....
@InProceedings{belge:iclp89,
author = "A. Mari{\"{e}}n and G. Janssens and A. Mulkers and M.
Bruynooghe",
title = "The {I}mpact of {A}bstract {I}nterpretation: An
{E}xperiment in {C}ode {G}eneration",
pages = "33--47",
crossref = "ICLP89",
acknowledgement = ack-mmc,
}
@InProceedings{belge:plilp90,
title = "On the {A}utomatic {G}eneration of {E}vents in {D}elta
{P}rolog",
author = "V. Dumortier and M. Bruynooghe",
pages = "324--339",
crossref = "PLILP90",
acknowledgement = ack-mmc,
}
@InProceedings{belge:iclp90a,
author = "K. Verschaetse and D. De Schreye and M. Bruynooghe",
title = "Generation and {C}ompilation of {E}fficient
{C}omputation {R}ules",
crossref = "ICLP90",
pages = "700--714",
acknowledgement = ack-mmc,
}
@InProceedings{belge:iclp90b,
author = "A. Mulkers and W. Winsborough and M. Bruynooghe",
title = "Analysis of {S}hared {D}ata {S}tructures for
{C}ompile--{T}ime {G}arbage {C}ollection in {L}ogic
{P}rograms",
crossref = "ICLP90",
pages = "747--762",
acknowledgement = ack-mmc,
}
@InProceedings{belge:iclp91,
author = "K. Verschaetse and D. De Schreye",
title = "{D}eriving {T}ermination {P}roofs for {L}ogic
{P}rograms, using {A}bstract {P}rocedures",
pages = "301--315",
crossref = "ICLP91",
acknowledgement = ack-mmc,
}
@InProceedings{belge:meta92,
author = "M. Bruynooghe and G. Janssens",
title = "Propagation: {A} {N}ew {O}peration in a {F}ramework
for {A}bstract {I}nterpretation of {L}ogic {P}rograms",
crossref = "META92",
pages = "294--307",
acknowledgement = ack-mmc,
}
@InProceedings{belge:lopstr92a,
author = "D. Boulanger and M. Bruynooghe",
title = "Deriving {T}ransformations for {L}ogic {P}rograms
using {A}bstract {I}nterpretation",
crossref = "LOPSTR92",
pages = "99--117",
acknowledgement = ack-mmc,
}
@InProceedings{belge:lopstr92b,
author = "K. Verschaetse and S. Decorte and D. De~Schreye",
title = "Automatic {T}ermination {A}nalysis",
crossref = "LOPSTR92",
pages = "168--183",
acknowledgement = ack-mmc,
}
@TechReport{belge:TR92a,
author = "K. Verschaetse and D. De Schreye",
title = "{A}utomatic {D}erivation of {L}inear {S}ize
{R}elations",
number = "CW 139",
type = "Report",
institution = "Department of Computer Science, K.U. Leuven",
year = "1992",
month = jan,
acknowledgement = ack-mmc,
}
@TechReport{belge:TR92b,
author = "V. Dumortier and G. Janssens and M. Bruynooghe",
title = "{D}etection of {F}ree {V}ariables in the {P}resence of
{N}umeric {C}onstraints by means of {A}bstract
{I}nterpretation",
number = "CW 145",
type = "Report",
institution = "Department of Computer Science, K.U. Leuven",
year = "1992",
month = mar,
acknowledgement = ack-mmc,
}
@TechReport{belge:TR92c,
author = "G. Janssens and M. Hermenegildo and F. Bueno and M.
Garc\'{\i}a de la Banda and A. Mulkers",
title = "{A} {R}eview of some {A}bstract {I}nterpretation
{S}ystems",
institution = "Department of Computer Science, Katholieke
Universiteit Leuven",
type = "Report",
number = "CW 143",
month = feb,
year = "1992",
acknowledgement = ack-mmc,
}
@InProceedings{belge:fgcs92,
author = "D. De Schreye and K. Verchaetse and M. Bruynooghe",
title = "A {F}ramework for {A}nalyzing the {T}ermination of
{D}efinite {L}ogic {P}rograms with respect to {C}all
{P}atterns",
year = "1992",
crossref = "ICOT92",
volume = "2",
pages = "481--488",
acknowledgement = ack-mmc,
}
@InProceedings{belge:plilp92,
title = "Derivation of {L}inear {S}ize {R}elations by
{A}bstract {I}nterpretation",
author = "K. Verschaetse and D. De Schreye",
year = "1992",
pages = "296--310",
crossref = "PLILP92",
acknowledgement = ack-mmc,
}
@InProceedings{belge:lp92,
author = "D. Boulanger",
title = "Deep {L}ogic {P}rogram {T}ransformation {U}sing
{A}bstract {I}nterpretation",
booktitle = "Logic Programming, Irkutsk, Russia, September 1990,
and St. Petersburg, Russia, September 1992",
journal = lnai,
volume = "592",
year = "1992",
editor = "A. Voronkov",
pages = "79--101",
publisher = sv,
ISSN = "0302-9743",
acknowledgement = ack-mmc,
}
@InProceedings{belge:iclp93,
author = "V. Dumortier and G. Janssens and M. Bruynooghe and M.
Codish",
title = "Freeness {A}nalysis in the {P}resence of {N}umerical
{C}onstraints",
crossref = "ICLP93",
pages = "100--115",
note = "also Report CW 158, nov. 1992, at KUL",
acknowledgement = ack-mmc,
}
@TechReport{belge:TR93a,
author = "A. Mulkers and W. Winsborough and M. Bruynooghe",
title = "A {L}ive--structure {D}ata--flow {A}nalysis for
{P}rolog: {T}heory",
institution = leuven,
year = "1993",
type = "Report",
number = "CW 167",
month = jan,
acknowledgement = ack-mmc,
}
@TechReport{belge:TR93b,
author = "A. Mulkers and W. Winsborough and M. Bruynooghe",
title = "A {L}ive--structure {D}ata--flow {A}nalysis for
{P}rolog: {D}esign and {E}valuation",
institution = leuven,
year = "1993",
type = "Report",
number = "CW 166",
month = jan,
acknowledgement = ack-mmc,
}
@InProceedings{belge:LOPSTR93a,
author = "D. Boulanger and M. Bruynooghe",
title = "Using {A}bstract {I}nterpretation for {G}oal
{R}eplacement",
pages = "210--228",
crossref = "LOPSTR93",
acknowledgement = ack-mmc,
}
@InProceedings{belge:LOPSTR93b,
author = "G. Janssens and W. Simoens",
title = "On The {I}mplementation of {A}bstract {I}nterpretation
{S}ystems for ({C}onstraint) {L}ogic {P}rograms",
year = "1993",
crossref = "LOPSTR93",
acknowledgement = ack-mmc,
}
@InProceedings{belge:CC94,
author = "G. Janssens and W. Simoens",
title = "{O}n the {I}mplementation of {A}bstract
{I}nterpretation {S}ystems for ({C}onstraint) {L}ogic
{P}rograms",
crossref = "CC94",
pages = "172--187",
acknowledgement = ack-mmc,
}
@TechReport{belge:TR94a,
author = "G. Janssens and M. Bruynooghe and V. Englebert",
title = "Abstracting {N}umerical {V}alues in {CLP(H,N)}",
institution = leuven,
year = "1993",
type = "Report",
number = "CW 189",
month = mar,
note = "Also published in PLILP'94",
acknowledgement = ack-mmc,
}
@TechReport{belge:TR94b,
author = "M. Bruynooghe and M. Codish and A. Mulkers",
title = "A {C}omposite {D}omain for {F}reeness, {S}haring, and
{C}ompoundness {A}nalysis of {L}ogic {P}rograms",
institution = leuven,
year = "1994",
type = "Report",
number = "CW 196",
month = jul,
note = "ftp available at ftp.cs.kuleuven.ac.be",
acknowledgement = ack-mmc,
}
@TechReport{belge:TR94c,
author = "A. Mulkers and W. Simoens and G. Janssens and M.
Bruynooghe",
title = "On the {P}racticality of {A}bstract {E}quation
{S}ystems",
institution = leuven,
year = "1994",
type = "Report",
number = "CW 198",
month = nov,
note = "ftp available at ftp.cs.kuleuven.ac.be",
acknowledgement = ack-mmc,
}
@InProceedings{belge:sas94,
author = "D. Boulanger and M. Bruynooghe",
title = "A {S}ystematic {C}onstruction of {A}bstract
{D}omains",
crossref = "SAS94",
pages = "61--77",
acknowledgement = ack-mmc,
}
@InProceedings{belge:iclp94a,
author = "V. Dumortier and G. Janssens",
title = "Towards a {P}ractical {F}ull {M}ode {I}nference
{S}ystem for {CLP(H,N)}",
crossref = "ICLP94",
pages = "569--583",
year = "1994",
acknowledgement = ack-mmc,
}
@InProceedings{belge:iclp94b,
author = "D. Boulanger and D. De~Schreye",
title = "Compiling {C}ontrol {R}evisited: {A N}ew {A}pproach
based upon {A}bstract {I}nterpretation",
crossref = "ICLP94",
pages = "699--713",
year = "1994",
acknowledgement = ack-mmc,
}
@InProceedings{belge:lopstr94,
author = "D. Boulanger and M. Bruynooghe",
title = "Using {C}all/{E}xit {A}nalysis for {L}ogic {P}rogram
{T}ransformation",
crossref = "LOPSTR94",
pages = "36--50",
acknowledgement = ack-mmc,
}
@Article{belge:toplas94,
author = "A. Mulkers and W. Winsborough and M. Bruynooghe",
title = "Live-{S}tructure {D}ataflow {A}nalysis for {Prolog}",
journal = toplas,
volume = "16",
number = "2",
pages = "205--258",
month = mar,
year = "1994",
acknowledgement = ack-mmc,
}
@InProceedings{belge:nato94,
author = "M. Bruynooghe and D. Boulanger",
title = "Abstract {I}nterpretation for ({C}onstraint) {L}ogic
{P}rogramming",
series = "NATO Advanced Science Institutes",
year = "1994",
volume = "F/131",
pages = "228--258",
editor = "B. Mayoh and E. Tyugu and J. Penjam",
booktitle = "Constraint Programming",
publisher = "Springer Verlag",
address = "Berlin",
acknowledgement = ack-mmc,
}
@InProceedings{belge:ICLP95,
author = "A. Mulkers and W. Simoens and G. Janssens and M.
Bruynooghe",
title = "On the {P}racticability of {A}bstract {E}quation
{S}ystems",
crossref = "ICLP95",
pages = "781--795",
acknowledgement = ack-mmc,
}
@TechReport{belge:TR95a,
author = "G. Janssens and M. Bruynooghe and A. Mulkers",
title = "{A}bstract {E}quation {S}ystems: {D}escription and
{I}nsights",
institution = leuven,
year = "1995",
type = "Report",
number = "CW 217",
month = nov,
acknowledgement = ack-mmc,
}
@TechReport{belge:TR95b,
author = "G. Janssens and M. Bruynooghe and A. Mulkers",
title = "{A}bstract {E}quation {S}ystems: {S}ome {P}ractical
{E}xperiments",
institution = leuven,
year = "1995",
type = "Report",
number = "CW 218",
month = nov,
acknowledgement = ack-mmc,
}
@InProceedings{belge:post-iclp95,
author = "G. Janssens and M. Bruynooghe and V. Dumortier",
title = "A {B}lueprint for an {A}bstract {M}achine for
{A}bstract {I}nterpretation of {(Constraint)} {L}ogic
{P}rograms",
editor = "Maria Garcia de la Banda and Gerda Janssens and Peter
Stuckey",
booktitle = "Proceedings of the ICLP'95 Post-Conference Workshop on
Abstract Interpretation of Logic Languages",
pages = "18--35",
month = jun,
address = "Kanagawa, Japan",
year = "1995",
acknowledgement = ack-mmc,
}
@TechReport{belge:TR95c,
author = "G. Janssens and M. Bruynooghe and V. Dumortier",
title = "A {B}lueprint for an {A}bstract {M}achine for
{A}bstract {I}nterpretation of {(Constraint)} {L}ogic
{P}rograms",
institution = leuven,
year = "1995",
month = jun,
number = "CW 212",
type = "Report",
note = "also published in \cite{belge:post-iclp95}",
acknowledgement = ack-mmc,
}
@TechReport{belge:TR96,
author = "M. Bruynooghe and B. Demoen and D. Boulanger and M.
Denecker and A. Mulkers",
title = "A {F}reeness and {S}haring {A}nalysis of {L}ogic
{P}rograms {B}ased on a {P}re-{I}nterpretation",
institution = leuven,
number = "CW 233",
type = "Report",
month = may,
year = "1996",
url = "http://www.cs.kuleuven.ac.be/~lpai",
acknowledgement = ack-mmc,
}
@InProceedings{belge:sas96,
author = "M. Bruynooghe and B. Demoen and D. Boulanger and M.
Denecker and A. Mulkers",
title = "A {F}reeness and {S}haring {A}nalysis of {L}ogic
{P}rograms based on a {P}re--{I}nterpretation",
crossref = "SAS96",
pages = "128--142",
acknowledgement = ack-mmc,
}
@Article{belge:acm96,
author = "M. Garc\'\i a de la Banda and M. Hermenegildo and M.
Bruynooghe and V. Dumortier and G. Janssens and W.
Simoens",
title = "Global {A}nalysis of {C}onstraint {L}ogic
{P}rogramming",
journal = toplas,
year = "1996",
volume = "18",
number = "5",
pages = "564--614",
month = sep,
acknowledgement = ack-mmc,
}
% ICOT
@TechReport{icot:TR87,
author = "T. Kanamori and T. Kawamura",
title = "Analysing {S}uccess {P}atterns of {L}ogic {P}rograms
by {A}bstract {H}ybrid {I}nterpretation",
institution = "ICOT",
year = "1987",
type = "Technical Report",
number = "TR-279",
address = "Japan",
month = dec,
acknowledgement = ack-mmc,
}
@TechReport{icot:TR88a,
year = "1988",
month = jan,
author = "T. Kanamori and K. Horiuchi and T. Kawamura",
title = "{D}etecting {F}unctionality of {L}ogic {P}rograms
{B}ased on {A}bstract {H}ybrid {I}nterpretation",
type = "Technical Report",
number = "TR--331",
institution = "ICOT",
acknowledgement = ack-mmc,
}
@InProceedings{icot:tokyo87,
author = "T. Kanomori and K. Horiuchi",
title = "Polymorphic {T}ype {I}nference in {P}rolog by
{A}bstract {I}nterpretation",
booktitle = "Proceedings of the Sixth Logic Programming",
series = lncs,
volume = "315",
publisher = sv,
address = "Tokyo, Japan",
pages = "195--214",
year = "1987",
acknowledgement = ack-mmc,
}
@TechReport{icot:TR88b,
author = "H. Fujita",
title = "Abstract {I}nterpretation and {P}artial {E}valuation
of {Prolog} {P}rograms",
institution = "Institute for New Generation Computer Technology,
Tokyo",
year = "1988",
type = "ICOT technical memorandum",
number = "484",
note = "Neil Jones, Bibliography at DIKU",
acknowledgement = ack-mmc,
}
@TechReport{icot:TR90a,
author = "T. Kanamori",
title = "{A}bstract {I}nterpretation based on {A}lexander
{T}emplates",
type = "Technical Report",
number = "TR--549",
institution = "ICOT",
month = mar,
year = "1990",
acknowledgement = ack-mmc,
}
@TechReport{icot:TR90b,
author = "T. Kanamori and T. Kawamura",
title = "Abstract {I}nterpretation {B}ased on {OLDT}
{R}esolution",
type = "Technical Report",
number = "TR--619",
institution = "ICOT",
year = "1990",
acknowledgement = ack-mmc,
}
@Article{icot:jlp93a,
author = "T. Kanamori and T. Kawamura",
title = "Abstract {I}nterpretation {B}ased on {OLDT}
{R}esolution",
journal = JLP,
volume = "15",
number = "1 \& 2",
year = "1993",
month = jan,
pages = "1--30",
acknowledgement = ack-mmc,
}
@Article{icot:jlp93b,
author = "T. Kanamori",
title = "Abstract {I}nterpretation {B}ased on {Alexander}
{T}emplates",
journal = JLP,
volume = "15",
number = "1 \& 2",
year = "1993",
month = jan,
pages = "31--54",
acknowledgement = ack-mmc,
}
% Lillois,
@InProceedings{lecoutre:lopstr91,
author = "C. Lecoutre and P. Devienne and Lebegue P.",
title = "Abstract {I}nterpretation and {R}ecursive {B}ehavior
of {L}ogic {P}rograms",
crossref = "LOPSTR91",
pages = "147--166",
acknowledgement = ack-mmc,
}
@InProceedings{lifl:WSA91,
author = "C. Lecoutre and P. Devienne and Leb{\`e}gue P.",
title = "Une analyse du comportement r{\'e}cursif de programmes
{P}rolog par une interpr{\'e}tation abstraite",
pages = "62--69",
crossref = "WSA91",
acknowledgement = ack-mmc,
}
@InProceedings{lifl:jfpl92,
title = "Termination {I}nduction by means of an {A}bstract
{OLDT} {R}esolution",
author = "C. Lecoutre and P. Devienne and P. Leb\`egue",
editor = ejfpl92,
pages = "353--373",
booktitle = jfpl92,
year = "1992",
acknowledgement = ack-mmc,
}
@InProceedings{lifl:WSA92,
author = "A. Parrain and P. Devienne and P. Leb{\`e}gue",
title = "Towards {O}ptimization of {F}ull {P}rolog {P}rograms
guided by {A}bstract {I}nterpretation",
pages = "295--303",
crossref = "WSA92",
acknowledgement = ack-mmc,
}
@InProceedings{lifl:lopstr92,
author = "A. Parrain and P. Devienne and P. Leb{\`e}gue",
title = "Towards {O}ptimization of {F}ull {P}rolog {P}rograms
guided by {A}bstract {I}nterpretation",
pages = "228--241",
crossref = "WSA92",
acknowledgement = ack-mmc,
}
@InProceedings{lifl:jfpl94,
author = "C. Lecoutre",
title = "Une {I}nterpr{\'e}tation {A}bstraite en
{P}rogrammation {L}ogique avec {C}ontraintes",
editor = ejfpl94,
pages = "189--204",
booktitle = jfpl94,
year = "1994",
month = may,
note = "(In French)",
acknowledgement = ack-mmc,
}
%%%%%% Divers %%%%%%%%
@InProceedings{aiken:sas94,
author = "A. Aiken and T. K. Lakshman",
title = "Directional {T}ype {C}hecking of {L}ogic {P}rograms",
crossref = "SAS94",
pages = "43--60",
acknowledgement = ack-mmc,
}
@InProceedings{banda:is1995,
author = "M. Garc\'\i a de la Banda and K. Marriott and P.
Stuckey",
title = "Efficient {A}nalysis of {C}onstraint {L}ogic
{P}rograms with {D}ynamic {S}cheduling",
crossref = "IS1995",
acknowledgement = ack-mmc,
}
@Article{bansal:ngc90,
author = "A. Bansal and L. Sterling",
title = "{A}n {A}bstract {I}nterpretation {S}cheme for
{I}dentifying {I}nherent {P}arallelism in {L}ogic
{P}rograms",
year = "1990",
journal = "New Generation Computing",
volume = "7",
pages = "273--324",
acknowledgement = ack-mmc,
}
@TechReport{bansal:TR91,
author = "A. K. Bansal and D. S. Poduval",
title = "Static {A}nalysis to {I}dentify {V}ectorizable
{N}umerical {D}omain in {L}ogic {P}rograms for
{E}fficient {E}xecution of {S}cientific {E}xpert
{S}ystems",
institution = "Kent State University",
number = "CS-9101-05",
year = "1991",
url = "mailto:sommers@mcs.kent.edu",
abstract = "Scientific expert systems require the efficient
integration of numerical and symbolic computation.
However, the numerical execution in logic programs on
conventional computers is very slow, due to the use of
recursive procedures and lists which support
declarative style of programming. In this paper, we
propose compile time data flow analysis of logic
programs to identify vectorizable numerical computation
for efficient execution on vector supercomputers. The
scheme uses abstract interpretation - a compile time
data flow analysis scheme to derive program properties.
Abstract interpretation first uses the abstract domain
of type expressions to derive the numeric computation
and then extends the abstract domain to identify
vectors, vector-sizes, indices, bounds, and constant
values. The abstract interpretation in the vector
domain is based upon the traversal of an AND-OR tree in
the vector domain and solving a system of linear
equations to derive unknown vector-sizes.
$\backslash$nd$\lbrace$tabular$\rbrace$",
note = "(Scandinavian Conference of Artificial Intelligence
91.)",
acknowledgement = ack-mmc,
}
@InProceedings{bansal:fgcs88,
author = "A. Bansal and L. Sterling",
title = "An {A}bstract {I}nterpretation {S}cheme for {L}ogic
{P}rograms based on {T}ype {E}xpression",
pages = "422--429",
crossref = "ICOT88",
acknowledgement = ack-mmc,
}
@TechReport{barbar:TR93,
author = "K. Barbar and K. Musumbu",
title = "Expressing {A}bstract {I}nterpretation of {P}rolog by
{A}ttribute {G}rammars",
institution = labri,
address = labriaddr,
year = "1993",
type = "Rapport de Recherche",
number = "93--9",
month = mar,
acknowledgement = ack-mmc,
}
@InProceedings{barbar:ieee94,
author = "K. Barbar and K. Musumbu",
title = "Implementation of {A}bstract {I}nterpretation
{A}lgorithm by means of {A}ttribute {G}rammars",
booktitle = "Proceedings of the 26th Southeastern Symposium on
System Theory",
year = "1994",
pages = "87--92",
publisher = "IEEE Computer Society",
month = mar,
acknowledgement = ack-mmc,
}
@InProceedings{boer:popl94,
author = "F. S. de~Boer and E. Marchiori and M. Gabbrielli and
C. Palamidessi",
title = "Proving {C}oncurrent {C}ontraint {P}rograms
{C}orrect.",
year = "1994",
crossref = "POPL94",
pages = "98--108",
acknowledgement = ack-mmc,
}
@InProceedings{boer:sas96,
author = "F. S. de~Boer and M. Gabbrielli and C. Palamidessi",
title = "Proving {C}orrectness of {C}onstraints {L}ogic
{P}rograms with {D}ynamic {S}cheduling",
crossref = "SAS96",
pages = "83--97",
acknowledgement = ack-mmc,
}
@InProceedings{boye:wsa93,
author = "J. Boye and J. Paaki and J. Maluszy\'nski",
title = "Synthesis of {D}irectionality {I}nformation for
{F}unctional {L}ogic {P}rogramming",
crossref = "WSA93",
pages = "165--177",
year = "1993",
acknowledgement = ack-mmc,
}
@InProceedings{chang:slp85,
author = "J.-H. Chang and A. M. Despain",
title = "Semi-{I}ntelligent {B}acktracking of {P}rolog {B}ased
on {S}tatic {D}ata {D}ependency {A}nalysis",
pages = "10--21",
crossref = "SLP85",
acknowledgement = ack-mmc,
}
@InProceedings{chang:compcon85,
author = "J.-H. Chang and A. M. Despain and D. DeGroot",
title = "{AND}--{P}arallelism of {L}ogic {P}rograms based on a
{S}tatic {D}ata {D}ependency {A}nalysis",
pages = "218--225",
booktitle = "Digest of Papers of COMPCON Spring'85",
year = "1985",
acknowledgement = ack-mmc,
}
@TechReport{changBM:TR92,
author = "B.-M. Chang and K.-M. Choe and T. Han",
title = "A {N}ew {T}wo--{P}hase {A}bstract {I}nterpretation of
{L}ogic {P}rograms",
institution = "KAIST",
year = "1992",
type = "Tech. Report",
number = "CS--TR--92--73",
address = "Dep. of Comp. Science, 373-1, Kusung-dong, Taejon
305-701, South Korea",
acknowledgement = ack-mmc,
}
@Article{changBM:ipl93,
author = "B.-M. Chang and K.-M. Choe and T. Han",
title = "Efficient {B}ottom--{U}p {E}xecution of {L}ogic
{P}rograms using {A}bstract {I}nterpretation",
journal = "Information Processing Letters",
year = "1993",
volume = "47",
number = "3",
pages = "149--157",
month = sep,
acknowledgement = ack-mmc,
}
@Article{changBM:etri94,
author = "B.-M. Chang and K.-M. Choe and R. Giacobazzi",
title = "Improving {E}xecution {M}odels of {L}ogic {P}rograms
by {T}wo-phase {A}bstract {I}nterpretation",
journal = "ETRI",
year = "1994",
volume = "16",
number = "4",
pages = "27--47",
month = jan,
acknowledgement = ack-mmc,
}
@InProceedings{dawson:iclp93,
author = "S. Dawson and C. Ramakrishnan and I. Ramakrishnan and
R. Sekar",
title = "Extracting {D}eterminacy in {L}ogic {P}rograms",
crossref = "ICLP93",
pages = "424--438",
acknowledgement = ack-mmc,
}
@InProceedings{deWaal:CADE12,
author = "D. A. de Waal and J. Gallagher",
title = "The {A}pplicability of {L}ogic {P}rogram {A}nalysis
and {T}ransformation to {T}heorem {P}roving",
booktitle = "Proceedings of the 12th International Conference on
Automated Deduction (CADE-12), Nancy",
year = "1994",
acknowledgement = ack-mmc,
}
@InProceedings{fecht:SAS95,
author = "C. Fecht",
title = "{GENA} -- a {T}ool for {G}enerating {P}rolog
{A}nalyzers from {S}pecifications",
crossref = "SAS95",
pages = "418--419",
acknowledgement = ack-mmc,
}
@InProceedings{fecht:plilp96,
author = "C. Fecht",
title = "An {E}fficient and {P}recise {S}haring {D}omain for
{L}ogic {P}rograms",
crossref = "PLILP96",
pages = "469--470",
notes = "Poster session",
acknowledgement = ack-mmc,
}
@InProceedings{gallardo:gulp93,
author = "M. Gallardo and J. Troja",
title = "Parlog {P}rograms {N}on--{T}ermination {A}nalysis",
editor = edgulp93,
pages = "237--250",
booktitle = gulp93,
year = "1993",
publisher = "Mediterranean Press",
month = jun,
acknowledgement = ack-mmc,
}
@InProceedings{gallagher:WSA92,
author = "J. Gallagher",
title = "Static {A}nalysis for {L}ogic {P}rogram
{S}pecification",
pages = "285--294",
crossref = "WSA92",
acknowledgement = ack-mmc,
}
@InProceedings{gallagher:ICLP94,
author = "J. Gallagher and D. A. de Waal",
title = "Fast and {P}recise {R}egular {A}pproximation of
{L}ogic {P}rograms",
crossref = "ICLP94",
year = "1994",
pages = "599--613",
acknowledgement = ack-mmc,
}
@InProceedings{getzinger:sas94,
author = "T. W. Getzinger",
title = "The {C}osts and {B}enefits of {A}bstract
{I}nterpretation--{D}riven {P}rolog {O}ptimization",
crossref = "SAS94",
pages = "1--25",
note = "Invited Talk",
acknowledgement = ack-mmc,
}
@InProceedings{handjieva:sas96,
author = "M. Handjieva",
title = "{STAN}: a {S}tatic {A}nalyzer for {CLP}($\cal {R}$)
based on {A}bstract {I}nterpretation",
crossref = "SAS96",
pages = "383--384",
note = "System descriptions",
acknowledgement = ack-mmc,
}
@TechReport{hans:TR92a,
author = "W. Hans and S. Winkler",
title = "Abstract Interpretation of Functional Logic
Languages",
institution = "Technical University of Aachen (RWTH Aachen)",
number = "92-43",
pages = "17",
year = "1992",
url = "ftp://ftp.informatik.rwth-aachen.de/pub/reports/92-43.ps.gz",
abstract = "The technique of abstract interpretation is used in
functional and logic programming with various
applications. In this paper, we show how methods of
abstract interpretation for logic programming can be
adapted for purposes of functional logic languages. But
these extensions are not straightforward --- especially
the presence of non-strict operations and a
three-valued boolean domain cause additional problems.
It is shown how the usage of slightly modified original
techniques together with a program transformation that
incorporates a result directed analysis can yield good
results.",
acknowledgement = ack-mmc,
}
@TechReport{hans:TR92b,
author = "W. Hans and S. Winkler",
title = "Aliasing and {G}roundness {A}nalysis of {L}ogic
{P}rograms through {A}bstract {I}nterpretation and its
{S}afety",
institution = "Technical University of Aachen (RWTH Aachen)",
number = "92-27",
pages = "30",
year = "1992",
url = "ftp://ftp.informatik.rwth-aachen.de/pub/reports/92-27.ps.gz",
abstract = "This paper describes a safe method, which derives
aliasing and groundness properties of logic programs
(with equality). The abstract domain bases on the one
proposed by Jacobs and Langen, which has the advantage
of great potential precision and supports the simple
computation through abstract interpretation. The
abstract execution follows the framework suggested by
Bruynooghe determining useful information for all
points within the program. The abstract operations as
well as the embedding in this framework are formulated
in a precise manner and are proven correct; the latter
is the crucial topic here. In addition, several
refinements are examined.",
acknowledgement = ack-mmc,
}
@InProceedings{hanus:WSA92,
author = "M. Hanus",
title = "An {A}bstract {I}nterpretation {A}lgorithm for
{R}esiduating {L}ogic {P}rograms (Extended Abstract)",
pages = "304--312",
crossref = "WSA92",
acknowledgement = ack-mmc,
}
@TechReport{hanus:TR92,
author = "M. Hanus",
title = "An {A}bstract {I}nterpretation {A}lgorithm for
{R}esiduating {L}ogic {P}rograms",
institution = "Max Planck Insitute",
number = "MPI-I-92-217",
month = apr,
year = "1992",
url = "ftp://mpii02000.cs.uni-sb.de/pub/papers/reports/MPI-I-92-217.dvi.Z",
abstract = "Residuation is an operational mechanism for the
integration of functions into logic programming
languages. The residuation principle delays the
evaluation of functions during the unification process
until the arguments are sufficiently instantiated. This
has the advantage that the deterministic nature of
functions is preserved but the disadvantage of
incompleteness: if the variables in a delayed function
call are not instantiated by the logic program, this
function can never be evaluated and some answers which
are logical consequences of the program are lost. In
order to detect such situations at compile time, we
present an abstract interpretation algorithm for this
kind of programs. The algorithm approximates the
possible residuations and instantiation states of
variables during program execution. If the algorithm
computes an empty residuation set for a goal, then it
is ensured that the concrete execution of the goal does
not end with a nonempty set of residuations which
cannot be evaluated due to insufficient instantiation
of argument variables.",
acknowledgement = ack-mmc,
}
@InProceedings{hanus:plilp92,
author = "M. Hanus",
title = "Improving {C}ontrol of {L}ogic {P}rograms by using
{F}unctional {L}ogic {L}anguages",
crossref = "PLILP92",
pages = "1--23",
acknowledgement = ack-mmc,
}
@InProceedings{hanus:CC94,
author = "M. Hanus",
title = "Towards the {G}lobal {O}ptimization of {F}unctional
{L}ogic {P}rograms",
year = "1994",
pages = "68--82",
publisher = "Springer LNCS 786",
booktitle = "Proc.\ 5th International Conference on Compiler
Construction",
url = "http://www-i2.informatik.rwth-aachen.de/~hanus/publications/papers/CC94.html",
acknowledgement = ack-mmc,
}
@InProceedings{hanus:iclp93,
author = "M. Hanus",
title = "Analysis of {N}onlinear {C}onstraints in {CLP($\cal
R$)}",
crossref = "ICLP93",
pages = "83--99",
acknowledgement = ack-mmc,
}
@InProceedings{hanus:sas94,
author = "M. Hanus and F. Zartmann",
title = "Mode {A}nalysis of {F}unctional {L}ogic {P}rograms",
crossref = "SAS94",
pages = "26--42",
acknowledgement = ack-mmc,
}
@Article{hanus:NGC95,
author = "M. Hanus",
title = "Compile-Time Analysis of Nonlinear Constraints in
{CLP}($\cal {R}$)",
year = "1995",
journal = "New Generation Computing",
volume = "13",
number = "2",
pages = "155--186",
url = "http://www-i2.informatik.rwth-aachen.de/~hanus/papers/NGC95.html",
acknowledgement = ack-mmc,
}
@Article{hanus:jlp95,
author = "M. Hanus",
title = "Analysis of {R}esiduating {L}ogic {P}rograms",
journal = jlp,
year = "1995",
volume = "24",
number = "3",
pages = "219--245",
url = "http://www-i2.informatik.rwth-aachen.de/~hanus/papers/JLP95.html",
acknowledgement = ack-mmc,
}
@InProceedings{harald:esop86,
author = "H. S{\o}ndergaard",
title = "An {A}pplication of {A}bstract {I}nterpretation of
{L}ogic {P}rograms: {O}ccur {C}heck {R}eduction",
pages = "327--338",
booktitle = "Proc. ESOP'86",
series = "LNCS",
number = "213",
year = "1986",
acknowledgement = ack-mmc,
}
@InCollection{harald:abramsky87,
author = "N. D. Jones and H. S{\o}ndergaard",
title = "A {S}emantic-{B}ased {F}ramework for the {A}bstract
{I}nterpretation of {Prolog}",
chapter = "6",
pages = "123--142",
year = "1987",
crossref = "Abramski87",
acknowledgement = ack-mmc,
}
@InProceedings{harald:ACSC93,
author = "N. Baker and H. S{\o}ndergaard",
title = "Definiteness {A}nalysis for {CLP(${\cal R}$)}",
editor = "G. Gupta and G. Mohay and R. Topor",
booktitle = "Proc.\ Sixteenth Australian Computer Science Conf.",
series = "Australian Computer Science Communications",
volume = "15",
number = "1",
pages = "321--332",
year = "1993",
abstract = "Constraint logic programming (CLP) languages
generalise logic programming languages, amalgamating
logic programming and constraint programming. Combining
the best of two worlds, they provide powerful tools for
wide classes of problems. As with logic programming
languages, code optimization by compilers is an
important issue in the implementation of CLP languages.
A compiler needs sophisticated global information,
collected by dataflow analyses, to generate competitive
code. One kind of useful dataflow information concerns
the point at which variables become definite, that is,
constrained to take a unique value. In this paper we
present a very precise dataflow analysis to determine
definiteness, and we discuss its applications. By
separating the two concerns: correctness and
implementation techniques, abstract interpretation
enables us to develop a sophisticated dataflow analysis
in a straightforward manner, in fact in a framework
where the correctness of the analysis is easily
established---a feature which is uncommon when complex
analyses are developed in an ad hoc way. We use a class
of Boolean functions, the positive functions, to
represent the definiteness relationship between
variables. A Boolean function is interpreted as
expressing a relation which holds not simply at the
given point in an evaluation, but in fact during the
rest of the evaluation branch. The nature of variables
in a CLP language makes this treatment both possible
and natural.",
acknowledgement = ack-mmc,
}
@InProceedings{harald:ACSC94,
author = "K. Marriott and H. S{\o}ndergaard and P. Stuckey and
R. Yap",
title = "Optimizing {C}ompilation for {CLP(${\cal R}$)}",
editor = "G. Gupta",
booktitle = "Proc.\ Seventeenth Australian Computer Science Conf.",
series = "Australian Computer Science Communications",
volume = "16",
number = "1",
pages = "551--560",
year = "1994",
abstract = "Constraint Logic Programming (CLP) is a recent
innovation in programming language design. CLP
languages extend logic programming by allowing
constraints from different domains such as real numbers
or Boolean functions. This gives considerable
expressive power and flexibility and CLP programs have
proven to be a high-level programming paradigm for
applications based on interactive mathematical
modelling. These advantages, however, are not without
cost. Implementations of CLP languages must include
expensive constraint solving algorithms tailored to the
specific domains. Indeed, performance of the current
generation of CLP compilers and interpreters is one of
the main obstacles to the widespread use of CLP. Here
we outline the design of a highly optimizing compiler
for CLP($\Re$), a CLP language which extends Prolog by
allowing linear arithmetic constraints. This compiler
is intended to overcome the efficiency problems of the
current implementation technology. The main innovation
in the compiler is a comprehensive suite of program
optimizations and associated global analyses which
determine applicability of each optimization. We
describe these optimizations and report very promising
results from preliminary experiments.",
acknowledgement = ack-mmc,
}
@TechReport{harald:TR95a,
author = "M. Garc{\'\i}a de la Banda and K. Marriott and H.
S{\o}ndergaard and P. Stuckey",
title = "Improved {A}nalysis of {L}ogic {P}rograms {U}sing a
{D}ifferential {A}pproach",
number = "95/15",
institution = "Dept.\ of Computer Science, The University of
Melbourne",
year = "1995",
annote = "Abstract interpretation based program analysis has
proven very useful in compilation of constraint and
logic programming languages. Unfortunately, existing
theoretical frameworks are inherently imprecise. This
is because of the way the frameworks handle call and
return from an atom evaluation --- in effect the same
information may be added twice, leading to a loss of
precision in many description domains. For this reason
some implementations use seemingly {\em ad hoc\/}
tricks. Here we formalize these tricks and suggest
three methods for overcoming this loss of precision.
Experimental and theoretical results indicate that use
of these methods leads to more accurate and faster
analyses for little extra implementation effort.",
acknowledgement = ack-mmc,
}
@InCollection{harald:ppcp95,
author = "A. Kelly and A. Macdonald and K. Marriott and H.
S{\o}ndergaard and P. Stuckey and R. Yap",
title = "An Optimizing Compiler for {CLP(R)}",
editor = "U. Montanari and F. Rossi",
booktitle = "Principles and Practice of Constraint
Programming---CP'95",
series = "Lecture Notes in Computer Science 976",
pages = "222--239",
publisher = "Springer-Verlag",
year = "1995",
acknowledgement = ack-mmc,
}
@TechReport{harald:TR95b,
author = "H. S{\o}ndergaard",
title = "Immediate Fixpoints and Their Use in Groundness
Analysis",
number = "95/40",
institution = "Dept.\ of Computer Science, The University of
Melbourne",
year = "1995",
acknowledgement = ack-mmc,
}
@InProceedings{harald:FSTTCS96,
author = "H. S{\o}ndergaard",
title = "Immediate Fixpoints and Their Use in Groundness
Analysis",
editor = "V. Chandru and V. Vinay",
booktitle = "Foundations of Software Technology and Theoretical
Computer Science",
series = "(Lecture Notes in Computer Science 1180)",
pages = "359--370",
publisher = "Springer-Verlag",
year = "1996",
abstract = "A theorem by Schr{\"o}der says that for a certain
natural class of functions $F : B \rightarrow B$
defined on a Boolean lattice $B$, $F(x) = F(F(F(x)))$
for all $x \in B$. An immediate corollary is that if
such a function is monotonic then it is also
idempotent, that is, $F(x) = F(F(x))$. We show how this
corollary can be extended to recognize cases where
recursive definitions can immediately be replaced by an
equivalent closed form, that is, they can be solved
without Kleene iteration. Our result applies more
generally to distributive lattices. It has applications
for example in the abstract interpretation of
declarative programs and deductive databases. We
exemplify this by showing how to accelerate simple
cases of strictness analysis for first-order functional
programs and, perhaps more successfully, groundness
analysis for logic programs.",
acknowledgement = ack-mmc,
}
@InProceedings{harald:sas96,
author = "L. Crnogorac and A. Kelly and H. S{\o}ndergaard",
title = "A {C}omparison of {T}hree {O}ccur--{C}heck
{A}nalysers",
crossref = "SAS96",
pages = "159--173",
acknowledgement = ack-mmc,
}
@InProceedings{Bai-Crn-Ram-Son:ICDT97,
author = "J. Bailey and L. Crnogorac and K. Ramamohanarao and H.
S{\o}ndergaard",
title = "Abstract {I}nterpretation of {A}ctive {R}ules and Its
{U}se in {T}ermination {A}nalysis",
editor = "F. Afrati and P. Kolaitis",
booktitle = "Database Theory --- ICDT'97",
series = "(Lecture Notes in Computer Science 1186)",
pages = "188--202",
publisher = sv,
year = "1997",
abstract = "The behaviour of rules in an active database system
can be difficult to predict, and much work has been
devoted to the development of automatic support for
reasoning about properties such as confluence and
termination. We show how abstract interpretation can
provide a generic framework for analysis of active
rules. Abstract interpretation is a well-understood,
semantics-based method for static analysis. Its
advantage, apart from generality, lies in the
separation of concerns: Once the underlying semantics
has been captured formally, a variety of analyses can
be derived, almost for free, as \emph{approximations}
to the semantics. Moreover, powerful general theorems
enable simple proofs of global correctness and uniform
termination of specific analyses. We outline these
ideas and present, as an example application, a new
method for termination analysis. In terms of precision,
the method compares favourably with previous solutions
to the problem. This is because the method investigates
the flow of data rather than just the syntax of
conditions and actions.",
acknowledgement = ack-mmc,
}
@Unpublished{Arm-Mar-Sch-Son:SCP9x,
author = "T. Armstrong and K. Marriott and P. Schachte and H.
S{\o}ndergaard",
title = "Two Classes of {Boolean} Functions for Dependency
Analysis",
note = "To appear in \emph{Science of Computer Programming}",
year = "199x",
abstract = "Many static analyses for declarative
programming/database languages use Boolean functions to
express dependencies among variables or argument
positions. Examples include groundness analysis,
arguably the most important analysis for logic
programs, finiteness analysis and functional dependency
analysis for databases. We identify two classes of
Boolean functions that have been used: positive and
definite functions, and we systematically investigate
these classes and their efficient implementation for
dependency analyses. On the theoretical side we provide
syntactic characterizations and study the
expressiveness and algebraic properties of the classes.
In particular, we show that both are closed under
existential quantification. On the practical side we
investigate various representations for the classes
based on reduced ordered binary decision diagrams
(ROBDDs), disjunctive normal form, conjunctive normal
form, Blake canonical form, dual Blake canonical form,
and a form specific to definite functions. We compare
the resulting implementations of groundness analyzers
based on the representations for precision and
efficiency.",
acknowledgement = ack-mmc,
}
@Unpublished{Gar-Mar-Stu-Son:jlp9x,
author = "M. Garc{\'\i}a de la Banda and K. Marriott and P.
Stuckey and H. S{\o}ndergaard",
title = "Differential {M}ethods in {L}ogic {P}rogram
{A}nalysis",
note = "To appear in \emph{Journal of Logic Programming}",
year = "199x",
abstract = "Program analysis based on abstract interpretation has
proven very useful in compilation of constraint and
logic programming languages. Unfortunately, the
traditional goal-dependent framework is inherently
imprecise. This is because it handles call and return
in such a way that dataflow information may be
re-asserted unnecessarily, leading to a loss of
precision for many description domains. For a few
specific domains, the literature contains proposals to
overcome the problem, and some implementations use
various unpublished tricks that sometimes avoid the
precision loss. The purpose of this paper is to map the
landscape of goal-dependent, goal-independent, and
combined approaches to generic analysis of logic
programs. This includes formalising existing methods
and tricks in a way that is independent of specific
description domains. Moreover, we suggest new methods
for overcoming the loss of precision---altogether eight
different semantics are considered and compared. We
provide theoretical results determining the relative
accuracy of the approaches. These show that two of our
new semantics are uniformally more accurate than
existing approaches. Experiments that we have performed
(for two description domains) with implementations of
the eight different approaches enable a discussion of
their relative runtime performances. We discuss the
expected effect on other domains as well and conclude
that our new methods can be trusted to yield
significantly more accurate analysis for a small extra
implementation effort, without compromising the
efficiency of analysis.",
acknowledgement = ack-mmc,
}
@Article{harald:scp98,
author = "A. Kelly and K. Marriott and H. S{\o}ndergaard and P.
Stuckey",
title = "Practical Object-Oriented Analysis Engine for {CLP}",
journal = scp,
year = "1998",
volume = "28",
number = "2",
pages = "199--224",
month = feb,
abstract = "The incorporation of global program analysis into
recent compilers for Constraint Logic Programming (CLP)
languages has greatly improved the efficiency of
compiled programs. We present a global analyzer based
on abstract interpretation. Unlike traditional
optimizers, whose designs tend to be ad hoc, the
analyzer has been designed with flexibility in mind.
The analyzer is incremental, allowing substantial
program transformations by a compiler without requiring
redundant re-computation of analysis data. The analyzer
is also generic in that it can perform a large number
of different program analyses. Furthermore, the
analyzer has an object-oriented design, enabling it to
be adapted to different applications easily and
allowing it to be used with various CLP languages with
simple modifications. As an example of this generality,
we sketch the use of the analyzer in two different
applications involving two distinct CLP languages: an
optimizing compiler for CLP(R) programs and an
application for detecting occur-check problems in
Prolog programs.",
acknowledgement = ack-mmc,
}
@InProceedings{heintze:lics92,
title = "An {E}ngine for {L}ogic {P}rogram {A}nalysis",
author = "N. Heintze and J. Jaffar",
pages = "318--328",
crossref = "LICS7",
acknowledgement = ack-mmc,
}
@Article{howe:ipl00,
author = "J. Howe and A. King",
title = "Abstracting Numeric Constraints with Boolean
Functions",
journal = ipl,
year = "2000",
volume = "75",
number = "1-2",
pages = "17--23",
month = jul,
abstract = "A simple, syntactic algorithm for abstracting numeric
constraints for groundness analysis is presented and
proved correct. The technique uses neither projection
nor temporary variables, and plugs a gap in the
abstract interpretation literature.",
acknowledgement = ack-mmc,
}
@InProceedings{jacobs:naclp89,
author = "D. Jacobs and A. Langen",
title = "{A}ccurate and {E}fficient {A}pproximation of
{V}ariable {A}liasing in {L}ogic {P}rograms",
pages = "154--165",
crossref = "NACLP89",
acknowledgement = ack-mmc,
}
@InProceedings{jacobs:iclp90,
author = "D. Jacobs and A. Langen and W. Winsborough",
title = "Multiple {S}pecialization of {L}ogic {P}rograms with
{R}un--{T}ime {T}ests",
crossref = "ICLP90",
pages = "717--731",
acknowledgement = ack-mmc,
}
@Article{jacobs:jlp92,
author = "D. Jacobs and A. Langen",
title = "Static {A}nalysis of {L}ogic {P}rograms for
{I}ndependent and {P}arallelism",
journal = JLP,
volume = "13",
number = "1, 2, 3 and 4",
year = "1992",
pages = "291--314",
acknowledgement = ack-mmc,
}
@TechReport{Jones:TR85,
author = "N. D. Jones",
title = "Concerning the {A}bstract {I}nterpretation of
{P}rolog",
type = "Tech. {R}ep.",
institution = "DIKU, Univ. of Copenhagen, Denmark",
year = "1985",
acknowledgement = ack-mmc,
}
@InProceedings{Jones:IS1994,
author = "N. D. Jones",
booktitle = "Logic Programming - Proceedings of the 1994
International Symposium",
title = "Abstract {I}nterpretation and {P}artial {E}valuation
in {F}unctional and {L}ogic {P}rogramming",
pages = "17--22",
crossref = "IS1994",
acknowledgement = ack-mmc,
}
@InProceedings{kelly:sas96,
author = "A. Kelly and K. Marriott and H. S{\o}ndergaard and P.
Stuckey",
title = "Two {A}pplications of an {I}ncremental {A}nalysis
{E}ngine for ({C}onstraint) {L}ogic {P}rograms",
crossref = "SAS96",
pages = "385--386",
note = "System descriptions",
acknowledgement = ack-mmc,
}
@InProceedings{Kemp:naclp90,
author = "R. Kemp and G. Ringwood",
title = "An {A}lgebraic {F}ramework for {A}bstract
{I}nterpretation of {D}efinite Programs",
pages = "516--530",
crossref = "NACLP90",
acknowledgement = ack-mmc,
}
@InProceedings{Kemp:iclp93,
author = "R. Kemp and P. Stuckey",
title = "Analysis based {C}onstraint {Q}uery {O}ptimization",
crossref = "ICLP93",
pages = "666--682",
acknowledgement = ack-mmc,
}
@InProceedings{kemp:plppe94,
author = "B. Kemp and A. King",
title = "Generators, {S}haring and {F}reeness: the {T}heory and
{P}ractice of {D}eriving {D}ata--{D}ependencies",
year = "1994",
address = "Oregon, USA",
month = mar,
booktitle = "NSF/ICOT Workshop on Parallel Logic Programming and
its Programming Environments",
acknowledgement = ack-mmc,
}
@Article{kemp:jlp96,
author = "D. Kemp and P. Stuckey",
title = "Optimizing Bottom-Up Evaluation of Constraint
Queries",
journal = jlp,
year = "1996",
volume = "26",
number = "1",
pages = "1--30",
month = jan,
abstract = "We consider a class of constraint logic programs
including negation that can be executed bottom up
without constraint solving, by replacing constraints
with tests and assignments. We show how to optimize the
bottom-up evaluation of queries for such programs using
transformations based on analysis obtained using
abstract interpretation. Although the paper
concentrates on a class of efficiently executable
programs, the optimizations we describe are correct and
applicable for arbitrary constraint logic programs. Our
approach generalizes earlier work on constraint
propagation.",
acknowledgement = ack-mmc,
}
@InProceedings{king:iclp94,
author = "A. King and P. Soper",
title = "Depth--$k$ {S}haring and {F}reeness",
pages = "553--568",
crossref = "ICLP94",
year = "1994",
acknowledgement = ack-mmc,
}
@InProceedings{king:esop94,
author = "A. King",
year = "1994",
title = "A {S}ynergistic {A}nalysis for {S}haring and
{G}roundness which {T}races {L}inearity",
pages = "363--378",
address = "Edinburgh, UK",
booktitle = "ESOP'94",
publisher = sv,
acknowledgement = ack-mmc,
}
@Article{king:jlp00,
author = "A. King",
title = "Pair-Sharing over Rational Trees",
journal = jlp,
year = "2000",
volume = "46",
number = "1-2",
pages = "139--155",
abstract = "Sharing information is useful in specialising,
optimising and parallelising logic programs and thus
sharing analysis is an important topic of both abstract
interpretation and logic programming. Sharing analyses
infer which pairs of program variables can never be
bound to terms that contain a common variable. We
generalise a classic pair-sharing analysis from
Herbrand unification to trace sharing over rational
tree constraints. This is useful for reasoning about
programs written in SICStus and Prolog-III because
these languages use rational tree unification as the
default equation solver.",
acknowledgement = ack-mmc,
}
@InProceedings{kluzniak:iclp87,
author = "F. Klu\'zniak",
title = "Type {S}ynthesis for {G}round {Prolog}",
pages = "788--816",
year = "1987",
crossref = "ICLP87",
acknowledgement = ack-mmc,
}
@Unpublished{Kral95,
author = "A. Krall",
title = "{Fast Abstract Interpretation of Prolog with an
Abstract Machine}",
note = "4th Workshop on Functional Logic Programming,
Schwarzenberg",
year = "1995",
url = "http://www.complang.tuwien.ac.at/papers/REFS.bib",
acknowledgement = ack-mmc,
}
@InProceedings{mannila:slp87,
author = "H. Mannila and E. Ukkonen",
title = "Flow {A}nalysis of {P}rolog {P}rograms",
pages = "205--114",
crossref = "SLP87",
acknowledgement = ack-mmc,
}
@InProceedings{marchiori:alp96,
author = "E. Marchiori",
title = "Prime {F}actorizations of {A}bstract {D}omains {U}sing
{F}irst {O}rder {L}ogic",
crossref = "ALP96",
pages = "209--223",
acknowledgement = ack-mmc,
}
@MastersThesis{maria:ms92,
author = "M. J. Garc\'{\i}a de la Banda",
title = "{I}mplementaci\'{o}n de un {I}nt\'{e}rprete
{A}bstracto de {P}rogramas {P}rolog sobre el {D}ominio
{"}sharing + freeness{"} ({I}mplementation and
{E}valuation of an {A}bstract {I}nterpreter over the
{"}sharing + freeness{"} {D}omain)",
year = "1992",
school = "University of Madrid (UPM)",
address = "Facultad de Inform\'{a}tica, Madrid, 28660",
acknowledgement = ack-mmc,
}
@InProceedings{mcdonald:ilps93,
author = "A. D. McDonald and Peter J. Stuckey and Roland H. C.
Yap",
title = "Redundancy of Variables in {CLP}($\cal{R}$)",
crossref = "ILPS93",
pages = "75--93",
acknowledgement = ack-mmc,
}
@TechReport{mellish:TR81,
author = "C. S. Mellish",
title = "The {A}utomatic {G}eneration of {M}ode {D}eclarations
for {Prolog} {P}rograms",
institution = "Department of Artificial Intelligence, University of
Edinburgh",
address = "England",
number = "163",
type = "DAI Report",
year = "1981",
note = "Also available in Workshop on Logic Programming for
Intelligent Systems",
acknowledgement = ack-mmc,
}
@Article{mellish:jlp85,
author = "C. S. Mellish",
title = "Some {G}lobal {O}ptimizations for a {Prolog}
{C}ompiler",
journal = "Journal of Logic Programming",
volume = "2",
pages = "43--66",
year = "1985",
acknowledgement = ack-mmc,
}
@InProceedings{mellish:iclp86,
author = "C. S. Mellish",
title = "{A}bstract {I}nterpretation of {P}rolog {P}rograms",
pages = "463--474",
crossref = "ICLP86",
acknowledgement = ack-mmc,
}
@InCollection{mellish:abramsky87,
author = "C. S. Mellish",
title = "Abstract {I}nterpretation of {Prolog} {P}rograms",
pages = "181--198",
chapter = "8",
crossref = "Abramski87",
acknowledgement = ack-mmc,
}
@InProceedings{mesnard:jfpl94,
author = "F. Mesnard",
title = "{\'E}tude de la terminaison des {P}rogrammes
{L}ogiques avec {C}ontraintes au moyen
d'approximations",
editor = ejfpl94,
pages = "205--220",
booktitle = jfpl94,
year = "1994",
month = may,
note = "(In French)",
acknowledgement = ack-mmc,
}
@InProceedings{muller:sas96a,
author = "M. M{\"u}ller and T. Gla{$\beta$} and K. Stroetmann",
title = "Automated {M}odular {T}ermination {P}roofs for {R}eal
{P}rolog {P}rograms",
crossref = "SAS96",
pages = "220--237",
note = "This is not really Abstract Interpretation but it
could be of some interests",
acknowledgement = ack-mmc,
}
@InProceedings{muller:sas96b,
author = "M. M{\"u}ller and T. Gla{$\beta$} and K. Stroetmann",
title = "{PAN} -- The {P}rolog {A}nalyzer",
crossref = "SAS96",
pages = "387--388",
note = "System descriptions",
acknowledgement = ack-mmc,
}
@InProceedings{musumbu:WSA91,
author = "K. Musumbu",
title = "Interpr{\'e}tation abstraite au moyen de grammaires
attribu{\'e}es",
pages = "144--150",
crossref = "WSA91",
acknowledgement = ack-mmc,
}
@InProceedings{musumbu:gwic95,
author = "K. Musumbu",
title = "Towards a {B}roader {T}heory for {A}bstract
{I}nterpretation",
editor = "E. A. Yfantis",
volume = "1",
series = "Theory and Decision Library, series D",
pages = "95--108",
booktitle = "{I}ntelligent {S}ystems, 3rd {G}old {W}est
{I}nternational {C}onference",
year = "1995",
publisher = "Kluwer Academic Publishers",
month = jun,
note = "ISBN 0-7923-3420-5",
acknowledgement = ack-mmc,
}
@InProceedings{musumbu:CARI94,
author = "K. Musumbu",
title = "{S}{\'e}mantique {A}bstraite et {I}nstrumentale pour
{P}rolog",
booktitle = "CARI'94",
pages = "727--742",
year = "1994",
address = "Ouagadoudou",
acknowledgement = ack-mmc,
}
@Article{nielson:sigplan86,
author = "F. Nielson",
title = "A {B}ibliography on abstract interpretation",
journal = "ACM SIGPLAN Not.",
volume = "21",
number = "5",
pages = "31--38",
year = "1986",
acknowledgement = ack-mmc,
}
@TechReport{nilsson:TR88a,
author = "U. Nilsson",
title = "Inferring {R}estricted {AND}--{P}arallelism in {L}ogic
{P}rograms {U}sing {A}bstract {I}nterpretation",
institution = "University of Link{\"o}ping",
year = "1988",
type = "Research Report",
number = "LiTH-IDA-R-88-02",
month = jan,
acknowledgement = ack-mmc,
}
@TechReport{nilsson:TR88B,
author = "U. Nilsson",
title = "Towards a framework for the abstract interpretation of
logic programs",
number = "LITH-IDA-R-88-44",
type = "Tech. {R}ep.",
institution = "Link{\"o}ping Univ.",
year = "1988",
abstract = "V108-377",
acknowledgement = ack-mmc,
}
@InProceedings{nilsson:plilp88,
author = "U. Nilsson",
title = "Towards a {F}ramework for the {A}bstract
{I}nterpretation of {L}ogic {P}rograms",
crossref = "PLILP88",
pages = "68--82",
acknowledgement = ack-mmc,
}
@InProceedings{nilsson:plilp90,
title = "Systematic {S}emantic {A}pproximations of {L}ogic
{P}rograms",
author = "U. Nilsson",
pages = "293--306",
year = "1990",
crossref = "PLILP90",
acknowledgement = ack-mmc,
}
@InProceedings{nilsson:plilp91,
author = "U. Nilsson",
title = "Abstract {I}nterpretation: {A} {K}ind of {M}agic",
crossref = "PLILP91",
year = "1991",
pages = "299--309",
note = "Extended version in Theoretical Computer Science",
acknowledgement = ack-mmc,
}
@Article{nillson:tcs95,
author = "U. Nilsson",
title = "Abstract {I}nterpretation: a {K}ind of {M}agic",
journal = "Theoretical Computer Science",
year = "1995",
volume = "142",
number = "1",
pages = "125--138",
publisher = "Elsevier",
month = may,
acknowledgement = ack-mmc,
}
@InProceedings{nordin:SAS95,
author = "M. Nordin and T. Lindgren and H. Millroth",
title = "{IGOR}: a {T}ool for {D}eveloping {P}rolog {D}ataflow
{A}nalyzers",
crossref = "SAS95",
pages = "420--421",
acknowledgement = ack-mmc,
}
@InProceedings{puebla:plilp96,
author = "G. Puebla and M. Hermenegildo",
title = "Automatic {O}ptimization of {D}ynamic {S}cheduling in
{L}ogic {P}rograms",
crossref = "PLILP96",
pages = "475--476",
note = "Poster session",
acknowledgement = ack-mmc,
}
@InProceedings{cram:pepm95,
author = "C. R. Ramakrishnan and I. V. Ramakrishnan and R. C.
Sekar",
title = "A {S}ymbolic {C}onstraint {S}olving {F}ramework for
{A}nalysis of {L}ogic {P}rograms",
booktitle = "Proceedings of the {ACM SIGPLAN} {S}ymposium on
{P}artial {E}valuation and {S}emantics-based {P}rogram
{M}anipulation ({PEPM'95})",
year = "1995",
month = jun,
notes = "To Appear.",
url = "http://www.cs.sunysb.edu:80/~cram/papers/analysis/framework.html",
acknowledgement = ack-mmc,
}
@TechReport{renga:TR91,
author = "R. Sundarajan",
title = "{A}n {A}bstract {I}nterpretation {S}cheme for
{G}roundness, {F}reeness, and {S}haring {A}nalysis of
{L}ogic {P}rograms",
type = "Technical Report",
number = "CIS-TR-91-06",
institution = "U. of Oregon",
address = "Eugene, Oregon 97403",
year = "1991",
month = oct,
acknowledgement = ack-mmc,
}
@InProceedings{renga:fst92,
author = "R. Sundararajan and S. Conery",
title = "An {A}bstract {I}nterpretation {S}cheme for
{G}roundness, {F}reeness, and {S}haring {A}nalysis of
{L}ogic {P}rograms",
booktitle = "Proceedings twelfth FST \& TCS conf.",
year = "1992",
month = dec,
series = lncs,
volume = "652",
pages = "203--216",
address = "New Dehli, India",
acknowledgement = ack-mmc,
}
@InProceedings{somoguyi:iclp86,
author = "Z. Somogy",
title = "A {S}ystem of {P}recise {M}odes for {L}ogic
{P}rograms",
year = "1986",
crossref = "ICLP86",
pages = "769--787",
acknowledgement = ack-mmc,
}
@Article{spoto:jlp00,
author = "F. Spoto",
title = "Operational and Goal-Independant Denotational
Semantics for Prolog with Cut",
journal = jlp,
year = "2000",
volume = "42",
number = "1",
pages = "1--46",
month = jan,
abstract = "In this paper we propose an operational and a
denotational semantics for Prolog. We deal with the
control rules of Prolog and the cut operator. Our
denotational semantics provides a goal-independent
semantics. This means that the behaviour of a goal in a
program is defined as the evaluation of the goal in the
denotation (semantics) of the program. We show how our
denotational semantics can be specialised into a
computed answer semantics and into a call pattern
semantics. Our work provides a basis for a precise
abstract interpretation of Prolog programs.",
acknowledgement = ack-mmc,
}
@InProceedings{Tan:acm92,
author = "J. Tan and I.-P. Lin",
title = "Compiling {D}ataflow {A}nalysis of {L}ogic
{P}rograms",
booktitle = "ACM Programming Language Design and Implementation",
series = "SIGPLAN Notices",
volume = "27",
pages = "106--115",
publisher = "ACM Press",
year = "1992",
acknowledgement = ack-mmc,
}
@InProceedings{taylor:iclp89,
author = "A. Taylor",
title = "Removal of {D}ereferencing and {T}railing in {P}rolog
{C}ompilation",
crossref = "ICLP89",
pages = "48--60",
year = "1989",
acknowledgement = ack-mmc,
}
@InProceedings{tick:lpar93,
author = "B. C. Massey and E. Tick",
title = "Sequentialisation of {P}arallel {L}ogic {P}rograms
with {M}ode {A}nalysis",
crossref = "LPAR93",
pages = "205--216",
year = "1993",
acknowledgement = ack-mmc,
}
@Article{tick:ngc93,
author = "E. Tick and X. Zhong",
title = "A {C}ompile-{T}ime {G}ranularity {A}nalysis
{A}lgorithm and its {P}erformance {E}valuation",
journal = "New Generation Computing",
year = "1993",
volume = "11",
number = "3 \& 4",
pages = "271--295",
acknowledgement = ack-mmc,
}
@InProceedings{tung:parallel86,
author = "Y.-W. Tung and D. Moldovan",
title = "Detection of {AND}--{P}arallelism in {L}ogic
{P}rogramming",
pages = "984--991",
booktitle = "Proceedings of the Conference on Parallel Processing",
year = "1986",
publisher = "IEEE",
acknowledgement = ack-mmc,
}
@InProceedings{vanroy:tapsoft87,
author = "B. Demoen and P. Van Roy and Y. D. Willems",
title = "Improving the {E}xecution {S}peed of {C}ompiled
{P}rolog with {M}odes, {C}lause {S}election and
{D}eterminism",
booktitle = "Proc. TAPSOFT 1987",
editor = "H. Ehrig and R. Kowalski and G. Levi and U.
Montanari",
series = lncs,
volume = "250",
publisher = sv,
pages = "111--125",
year = "1987",
acknowledgement = ack-mmc,
}
@InProceedings{vanroy:naclp90,
author = "P. Van Roy and A. Despain",
title = "The {B}enefits of {G}lobal {D}ataflow {A}nalysis for
an {O}ptimizing {P}rolog {C}ompiler",
pages = "501--515",
crossref = "NACLP90",
acknowledgement = ack-mmc,
}
@InProceedings{vanroy:wsa93,
author = "P. Van~Roy",
title = "Challenges in Developing Useful and Practical Static
Analysis for Logic Programs",
year = "1993",
crossref = "WSA93",
pages = "111--111",
acknowledgement = ack-mmc,
}
@InProceedings{waern:iclp88,
author = "A. W{\ae}rn",
title = "An {I}mplementation {T}echnique for the {A}bstract
{I}nterpretation of {P}rolog",
pages = "700--710",
crossref = "ICLP88",
acknowledgement = ack-mmc,
}
@TechReport{warren:TR88,
author = "Warren and M. Hermenegildo",
title = "{O}n the {P}racticality of {G}lobal {F}low {A}nalysis
of {L}ogic {P}rograms",
year = "1988",
month = jan,
type = "Technical Report",
number = "ACA-126-88",
institution = "Microelectronics and Computer Technology Corporation
(MCC), Austin, TX 78759",
acknowledgement = ack-mmc,
}
@InProceedings{warren:iclp88,
author = "D. S. Warren and M. Hermenegildo and S. K. Debray",
title = "On the {P}racticality of {G}lobal {F}low {A}nalysis of
{L}ogic {P}rograms",
pages = "684--699",
crossref = "ICLP88",
year = "1988",
acknowledgement = ack-mmc,
}
@TechReport{warren:TR92,
author = "D. S. $<$warren@cs.sunysb.edu$>$ Warren",
title = "Memoing for Logic Programs, with Application to
Abstract Interpretation and Partial Deduction",
institution = "Sate University of New York, Stony Brook",
type = "Technical Report",
year = "1992",
month = apr,
url = "ftp://ftp.cs.sunysb.edu/pub/TechReports/warren/lpmemoing.dvi.Z",
acknowledgement = ack-mmc,
}
@Article{warren:cacm92,
author = "D. S. $<$warren@cs.sunysb.edu$>$ Warren",
title = "Memoing for {L}ogic {P}rograms, with {A}pplication to
{A}bstract {I}nterpretation and {P}artial {D}eduction",
year = "1992",
month = mar,
journal = "CACM",
volume = "35",
number = "3",
acknowledgement = ack-mmc,
}
@InProceedings{xia:ifip88,
author = "H. Xia and W. K. Giloi",
title = "A new {A}pplication of {A}bstract {I}nterpretation in
{P}rolog {P}rograms: {D}ata--{D}ependency analysis",
booktitle = "IFIP WG 10.0 Workshop on Concepts and Characteristics
of Declarative Systems",
year = "1988",
acknowledgement = ack-mmc,
}
@InProceedings{xia:super88,
author = "H. Xia and W. K. Giloi",
title = "A {H}ybrid {S}cheme for {D}etecting
{AND}--{P}arallelism in {P}rolog {P}rograms",
pages = "550--559",
booktitle = "Proceedings of the International Conference on
Supercomputing",
year = "1988",
publisher = acm,
address = "Saint Malo, France",
month = jul,
acknowledgement = ack-mmc,
}
@TechReport{yan:TR92,
author = "S.-W. Yan",
title = "Efficiently {E}stimating {R}elative {G}rain {S}ize for
{L}ogic {P}rograms on {B}asis of {A}bstract
{I}nterpretation",
institution = "ECRC, Munich Germany",
year = "1992",
type = "Technical Report",
number = "DPS--22",
month = nov,
note = "also presented at IJCSLP'92, Workshop 6B",
acknowledgement = ack-mmc,
}
@TechReport{yan:TR93,
author = "S.-W. Yan",
title = "{A G}eneral {P}urpose {A}bstract {I}nterpreter and its
application to {C}ost {A}nalysis of {L}ogic
{P}rograms",
institution = "ECRC, Munich Germany",
type = "Technical Report",
number = "D.WP1.2.1.M1.1",
month = jul,
year = "1993",
acknowledgement = ack-mmc,
}
@InProceedings{Zhon:fgcs92,
author = "X. Zhon and E. Tick and S. Duvvuru and L. Hansen and
A. Sastry and R. Sundararajan",
title = "Towards an {E}fficient {C}ompile-{T}ime {G}ranularity
{A}nalysis {A}lgorithm",
pages = "809--816",
crossref = "ICOT92",
acknowledgement = ack-mmc,
}
%%%%%%% DES THEMES %%%%%%%
%
% Concurrent Logic Programming
%
@InProceedings{ccc:naclp90,
author = "C. Codognet and P. Codognet and M.-M. Corsini",
title = "{A}bstract {I}nterpretation for {C}oncurrent {L}ogic
{P}rograms",
pages = "215--232",
crossref = "NACLP90",
note = "also Univ. Bordeaux I, Research Report 90--92",
acknowledgement = ack-mmc,
}
@InProceedings{codognet:csam93,
author = "C. Codognet and P. Codognet",
title = "A general semantics for {C}oncurrent {C}onstraint
{L}anguages and their {A}bstract {I}nterpretation",
booktitle = "Workshop on Constraint Processing at the International
Congress on Computer Systems and Applied Mathematics,
CSAM'93",
year = "1993",
editor = "M. Meyer",
acknowledgement = ack-mmc,
}
@InProceedings{horiushi:fgcs92,
author = "K. Horiuchi",
title = "{L}ess {A}bstract {S}emantics for {A}bstract
{I}nterpretation of {FGHC} {P}rograms",
year = "1992",
pages = "897--906",
crossref = "ICOT92",
acknowledgement = ack-mmc,
}
@Misc{codish:wsa92,
author = "M. Codish and M. Falaschi and K. Marriott and W.
Winsborough",
title = "{E}fficient {A}nalysis of {C}oncurrent {C}onstraint
{L}ogic {P}rograms (Extended Abstract)",
year = "1992",
crossref = "WSA92",
pages = "35--43",
acknowledgement = ack-mmc,
}
@InProceedings{codish:icalp93,
author = "M. Codish and M. Falaschi and K. Marriott and W.
Winsborough",
title = "{E}fficient {A}nalysis of {C}oncurrent {C}onstraint
{L}ogic {P}rograms",
booktitle = "Proc. of the 20th International Colloquium on
Automata, Languages, and Programming",
series = lncs,
editor = "A. Lingas and R. Karlsson and S. Carlsson",
volume = "700",
pages = "633--644",
year = "1993",
acknowledgement = ack-mmc,
}
@InProceedings{codish:iclp91,
author = "M. Codish and M. Falaschi and K. Marriott",
title = "{S}uspension {A}nalysis for {C}oncurrent {L}ogic
{P}rograms",
pages = "331--345",
crossref = "ICLP91",
acknowledgement = ack-mmc,
}
@Unpublished{codish:TR92,
author = "M. Codish and M. Falaschi and K. Marriott",
title = "{S}uspension {A}nalysis for {C}oncurrent {L}ogic
{P}rograms",
year = "1992",
note = "long version of~\cite{codish:iclp91}",
acknowledgement = ack-mmc,
}
@TechReport{padoue:TR93,
author = "M. Falaschi and M. Gabbrielli and K. Marriott and C.
Palamidessi",
title = "Confluence and {C}oncurrent {C}onstraint
{P}rogramming",
institution = "University of Padova",
year = "1993",
type = "Technical Report",
address = "Dipartimento di Elettronica e Informatica",
acknowledgement = ack-mmc,
}
@InProceedings{pise:plilp94,
author = "E. Zaffanella and G. Levi and R. Giacobazzi",
title = "Abstracting {S}ynchronization in {C}oncurrent
{C}onstraint {P}rogramming",
crossref = "PLILP94",
pages = "57--72",
year = "1994",
acknowledgement = ack-mmc,
}
@InProceedings{tick:jicslp92,
author = "R. Sundarajan and A. V. S. Sastry and E. Tick",
title = "Variable {T}hreadedness {A}nalysis for {C}oncurrent
{L}ogic {P}rograms",
crossref = "JICSLP92",
pages = "493--508",
year = "1992",
acknowledgement = ack-mmc,
}
@InProceedings{king:jicslp92,
author = "A. King and P. Soper",
title = "{S}chedule {A}nalysis of {C}oncurrent {L}ogic
{P}rograms",
crossref = "JICSLP92",
pages = "478--492",
year = "1992",
acknowledgement = ack-mmc,
}
@InProceedings{bagnara95,
author = "R. Bagnara",
title = "Constraint {S}ystems for {P}attern {A}nalysis of
{C}onstraint {L}ogic--{B}ased {L}anguages",
crossref = "CCP95",
year = "1995",
acknowledgement = ack-mmc,
}
@InProceedings{sahlin:wsa93,
author = "D. Sahlin and T. Sj{\" o}land",
title = "Static {A}nalysis of {AKL}",
crossref = "WSA93",
pages = "282--283",
note = "Demonstration and Poster Session",
acknowledgement = ack-mmc,
}
@TechReport{sahlin:TR94,
author = "D. Sahlin and T. Sj{\" o}land",
title = "Fixpoint {A}nalysis of {T}ype and {A}lias in {AKL}
{P}rograms",
institution = "SICS",
year = "1994",
type = "Research Report",
number = "R94:13",
acknowledgement = ack-mmc,
}
@Unpublished{sjoland95,
author = "T. Sj{\" o}land and D. Sahlin",
title = "Derivation of {T}pe and {A}lias {I}nformation for a
{C}oncurrent {C}onstraint {L}anguage",
note = "Submitted to CCP'95",
year = "1995",
month = feb,
acknowledgement = ack-mmc,
}
@Unpublished{zaffanella95,
title = "Domain {I}ndependent {A}sk {A}pproximation in {CCP}",
author = "E. Zaffanella",
crossref = "CCP95",
year = "1995",
acknowledgement = ack-mmc,
}
%%%%% DES THESES %%%%%%
%
% Theses
%
@PhdThesis{banda:phd94,
author = "M. Garc\'\i a de la Banda",
title = "Independence, Global Analysis and Parallelism in
Dynamic Scheduled Constraint Logic Programming",
school = "Universidad Polit\'ecnica de Madrid (UPM)",
year = "1994",
month = jul,
acknowledgement = ack-mmc,
}
@PhdThesis{changBM:phd94,
author = "B.-M. Chang",
title = "Efficient {B}ottom-up {E}execution of {L}ogic
{P}rograms using {C}ompile-{T}ime {A}nalysis",
school = "Korea Advanced Institute of Science and Technology
(KAIST)",
year = "1994",
address = "Department of Computer Science",
month = feb,
acknowledgement = ack-mmc,
}
@PhdThesis{debray:phd,
author = "S. K. Debray",
title = "Global {O}ptimizations of {L}ogic {P}rograms",
school = "Department of Computer Science, S.U.N.Y. Stony Brook",
year = "1986",
acknowledgement = ack-mmc,
}
@PhdThesis{dumortier:phd94,
author = "Veroniek Dumortier",
school = "K.U.Leuven, Dept. of Computer Science",
title = "{F}reeness and {R}elated {A}nalyses of {C}onstraint
{L}ogic {P}rograms using {A}bstract {I}nterpretation",
month = oct,
year = "1994",
acknowledgement = ack-mmc,
}
@PhdThesis{fred:phd,
author = "F. Mesnard",
title = "\'Etude de la terminaison des programmes logiques avec
contraintes, au moyen d'approximation",
school = "Universit\'e Paris 6",
year = "1993",
month = jan,
note = "(in French)",
acknowledgement = ack-mmc,
}
@PhdThesis{getzinger:phd,
author = "T. W. Getzinger",
title = "Abstract {I}nterpretation for the {C}ompile--{T}ime
{A}nalysis of {L}ogic {P}rograms",
school = "University of Southern California",
year = "1993",
month = dec,
note = "also as Technical Report ACAL--TR--93--09",
acknowledgement = ack-mmc,
}
@PhdThesis{harald:phd,
author = "H. S{\o}ndergaard",
title = "Semantics-{B}ased {A}nalysis and {T}ransformation of
{L}ogic {P}rograms",
school = "The University of Melbourne",
year = "1990",
month = jun,
note = "Revised version of PhD thesis, University of
Copenhagen, December 1989",
acknowledgement = ack-mmc,
}
@PhdThesis{janssens:phd,
author = "G. Janssens",
title = "{D}eriving {R}un {T}ime {P}roperties of {L}ogic
{P}rograms by {M}eans of {A}bstract {I}nterpretation",
school = "Department of Computer Science, Katholieke
Universiteit Leuven, Belgium",
year = "1990",
month = mar,
acknowledgement = ack-mmc,
}
@PhdThesis{kaninda:phd,
author = "K. Musumbu",
title = "Interpr\'etation Abstraite des Programmes Prolog",
school = "Facult\'es Universitaires Notre-Dame de la Paix --
Namur Institut d'Informatique, Belgium",
year = "1990",
month = sep,
note = "(in French)",
acknowledgement = ack-mmc,
}
@PhdThesis{Langen:phd,
author = "A. Langen",
title = "Static analysis for independent {A}nd-parallelism in
logic programs",
school = "Univ. of Southern California",
year = "1990",
acknowledgement = ack-mmc,
}
@PhdThesis{lecoutre:phd,
author = "C. Lecoutre",
title = "Interpr\'etation abstraite en programmation logique
avec contraintes",
school = "Universit\'e des sciences et technologies de Lille",
year = "1994",
month = feb,
note = "(in French)",
acknowledgement = ack-mmc,
}
@PhdThesis{mallet:phd,
author = "O. Mallet",
title = "Interpr\'etation Abstraite appliqu\'ee \`a la
Compilation et \`a la parall\'elisation en
Programmation Logique",
school = "\'Ecole Polytechnique, Paris, France",
year = "1992",
month = jun,
note = "(in French)",
acknowledgement = ack-mmc,
}
@PhdThesis{mike:phd,
author = mike,
school = "The {W}eizmann {I}nstitute of {S}cience",
title = "Abstract {I}nterpretation of {S}equential and
{C}oncurrent {L}ogic {P}rograms",
month = jan,
year = "1991",
acknowledgement = ack-mmc,
}
@PhdThesis{mmc:phd,
author = mmc,
title = "Interpr\'etation abstraite en programmation logique:
th\'eorie et applications",
school = bxI,
note = "(in French)",
year = "1989",
month = jan,
acknowledgement = ack-mmc,
}
@PhdThesis{mulkers:phd,
author = "A. Mulkers",
title = "{D}eriving {L}ive {D}ata {S}tructures in {L}ogic
{P}rograms by {M}eans of {A}bstract {I}nterpretation",
school = "Department of Computer Science, Katholieke
Universiteit Leuven, Belgium",
year = "1991",
acknowledgement = ack-mmc,
}
@PhdThesis{nilsson:phd,
author = "U. Nilsson",
title = "{A}bstract {I}nterpretation and {A}bstract {M}achines:
{C}ontributions to {M}ethodology for the
{I}mplementation of {L}ogic {P}rograms",
school = "Link{\"o}ping studies in science and technology",
type = "Dissertation no. 265",
year = "1992",
acknowledgement = ack-mmc,
}
@PhdThesis{roberto:phd,
author = "R. Giacobazzi",
title = "Semantic {A}spects of {L}ogic {P}rogram {A}nalysis",
school = "Dipartimento di Informatica, Universit\`a di Pisa",
year = "1993",
month = mar,
acknowledgement = ack-mmc,
}
@PhdThesis{taylor:phd,
author = "A. Taylor",
title = "High {P}erformance {P}rolog {I}mplementation",
school = "Basser Department of Computer Science, University of
Sydney",
year = "1991",
month = jun,
acknowledgement = ack-mmc,
}
@PhdThesis{van-roy:phd,
author = "P. Van Roy",
title = "{C}an {L}ogic {P}rogramming {E}xecute as {F}ast as
{I}mperative {P}rogramming",
school = "Computer Science Division, University of California
Berkeley",
month = dec,
year = "1990",
acknowledgement = ack-mmc,
}
@PhdThesis{xia:phd,
author = "H. Xia",
title = "Analyzing Data Dependencies, Detecting And-Parallelism
and Optimizing Backtracking in Prolog Programs",
school = "University of Berlin",
month = apr,
year = "1989",
acknowledgement = ack-mmc,
}
@PhdThesis{shan-wen:phd,
author = "S.-W. Yan",
title = "{R}esearch on {D}esign, {I}mplementation and
{A}pplications of {A}bstract {I}nterpretation for
{C}ost-{E}ffective {E}xecution of {P}rolog {P}rograms",
school = "SMU, East-China Inst. of Computer Tech.",
day = "20",
month = apr,
year = "1991",
acknowledgement = ack-mmc,
}
%%% nph Bib
@Book{belge:mulkers1993,
author = "Anne Mulkers",
title = "Live data structures in logic programs: derivation by
means of abstract interpretation",
volume = "675",
publisher = sv,
address = sv:adr,
pages = "viii + 220",
year = "1993",
ISBN = "0-387-56694-5 (USA)",
ISSN = "0302-9743",
LCCN = "QA76.9.D35 M84 1993",
series = lncs,
acknowledgement = ack-nhfb,
keywords = "data structures (computer science); abstract data
types (computer science)",
xxvolume = "4004193890",
}
@Article{Lu:1993:LPT,
author = "L. Lu and P. Greenfield",
title = "Logic Program Testing Based on Abstract
Interpretation",
journal = lncs,
volume = "735",
pages = "170--??",
year = "1993",
ISSN = "0302-9743",
acknowledgement = ack-nhfb,
}
@Article{Boulanger:1994:ASU,
author = "D. Boulanger and M. Bruynooghe and M. Denecker",
title = "Abstracting {S}-Semantics Using {A} Model-Theoretic
Approach",
journal = lncs,
volume = "844",
pages = "432--??",
year = "1994",
ISSN = "0302-9743",
acknowledgement = ack-nhfb,
}
@Article{LeCharlier:1995:AIF,
author = baudouin,
title = "Abstract Interpretation and Finite Domain Symbolic
Constraints",
journal = lncs,
volume = "910",
pages = "147--??",
year = "1995",
ISSN = "0302-9743",
acknowledgement = ack-nhfb,
}
@Article{Codognet:1995:GSC,
author = "C. Codognet and P. Codognet",
title = "A Generalized Semantics for Concurrent Constraint
Languages and Their Abstract Interpretation",
journal = lncs,
volume = "923",
pages = "39--??",
year = "1995",
ISSN = "0302-9743",
acknowledgement = ack-nhfb,
}
@Article{Gallardo:1996:SCL,
author = "M. M. Gallardo and J. M. Troya",
title = "Studying the Cost of Logic Languages in an Abstract
Interpretation Framework for Granularity Analysis",
journal = lncs,
volume = "1048",
pages = "91--??",
year = "1996",
ISSN = "0302-9743",
acknowledgement = ack-nhfb,
}
@Article{Boucher:1996:ACN,
author = "D. Boucher and M. Feeley",
title = "Abstract Compilation: {A} New Implementation Paradigm
for Static Analysis",
journal = lncs,
volume = "1060",
pages = "192--??",
year = "1996",
ISSN = "0302-9743",
acknowledgement = ack-nhfb,
}
@Article{Bert:1996:RGF,
author = "D. Bert and R. Echahed and K. Adi",
title = "Resolution of Goals with the Functional and Logic
Programming Language {LPG}: Impact of Abstract
Interpretation",
journal = lncs,
volume = "1101",
pages = "629--??",
year = "1996",
ISSN = "0302-9743",
acknowledgement = ack-nhfb,
}
@Article{Lu:1996:MAL,
author = "L. Lu",
title = "A Mode Analysis of Logic: Programs by Abstract
Interpretation",
journal = lncs,
volume = "1181",
pages = "362--??",
year = "1996",
ISSN = "0302-9743",
acknowledgement = ack-nhfb,
}
@Article{Toman:1996:CDP,
author = "D. Toman",
title = "Constraint Databases and Program Analysis Using
Abstract Interpretation",
journal = lncs,
volume = "1191",
pages = "246--??",
year = "1996",
ISSN = "0302-9743",
acknowledgement = ack-nhfb,
}
@Article{Bruynooghe:1996:FSA,
author = "M. Bruynooghe and B. Demoen and D. Boulanger and M.
Denecker",
title = "A Freeness and Sharing Analysis of Logic Programs
Based on a Pre-interpretation",
journal = lncs,
volume = "1145",
pages = "128--??",
year = "1996",
ISSN = "0302-9743",
acknowledgement = ack-nhfb,
}
%%%%%% LES CROSSREFERENCES %%%%%%%%
% These must remain at the end of this file.
@Book{Abramski87,
editor = "S. Abramsky and C. Hankin",
title = "Abstract {I}nterpretation of {D}eclarative
{L}anguages",
booktitle = "Abstract {I}nterpretation of {D}eclarative
{L}anguages",
address = "West Sussex, England",
publisher = "Ellis Horwood Limited",
year = "1987",
crossrefonly = "1",
acknowledgement = ack-mmc,
}
\input crossref.bib