This volume contains the proceedings of the 5th International Conference on Veri?cation, Model Checking, and Abstract Interpretation (VMCAI 2004), held inVenice, January11 13,2004, inconjunctionwithPOPL2004, the31stAnnual SymposiumonPrinciplesofProgrammingLanguages, January14 16,2004.The purposeofVMCAIistoprovideaforumforresearchersfromthreecommunities veri?cation, model checking, and abstract interpretation which will facilitate interaction, cross-fertilization, and the advance of hybrid methods that combine thethreeareas.Withthegrowingneedforformaltoolstoreasonaboutcomplex, in?nite-state, and embedded systems, such hybrid methods are bound to be of great importance. Topics covered by VMCAI include program veri?cation, static analysis te- niques, model checking, program certi?cation, type systems, abstract domains, debugging techniques, compiler optimization, embedded systems, and formal analysis of security protocols. This year s meeting follows the four previous events in Port Je?erson (1997), Pisa (1998), Venice (2002), LNCS 2294 and New York (2003), LNCS 2575. In particular, we thank VMCAI 2003 s sponsor, the Courant Institute at New York University, for allowing us to apply a monetary surplus from the 2003 meeting to this one. The program committee selected 22 papers out of 68 on the basis of three - views.Theprincipalcriteriawererelevanceandquality.TheprogramofVMCAI 2004 included, in addition to the research papers, a keynote speech by David Harel (Weizmann Institute, Israel) onAGrand Challenge for Computing: Full Reactive Modeling of a Multicellular Animal, aninvitedtalkbyDawsonEngler(StanfordUniversity, USA)onStaticAn- ysis Versus Software Model Checking for Bug Finding, an invited talk by Mooly Sagiv (Tel Aviv University, Israel) called On the Expressive Power of Canonical Abstraction, and atutorialbyJoshuaD.Guttman(Mitre, USA)on Security, Protocols, and Trust. We would like to thank the Program Committee members and the reviewers, without whose dedicated e?ort the conference would not have been possible."

This volume contains the proceedings of the 1998 international symposium on staticanalysis(SAS'98)whichwasheldinPisa(Italy), onSeptember14-16,1998 and was part of a federated conference with ALP-PLILP'98 and several wo- shops. SAS'98isthe annualconferenceandforumforresearchersinallaspectsof staticanalysis. ItfollowstoSAS'94, SAS'95, SAS'96andSAS'97whichwereheld respectively in Namur (Belgium), Glasgow (UK), Aachen (Germany) and Paris (France), and the international workshops WSA'92 held in Bordeaux (France) and WSA'93 held in Padova (Italy). In response to the call for papers, 48 papers were submitted. All papers were reviewed by at least three reviewers and the program committee met in Pisa to select 20 papers based on the referee reports. There was a consensus at the meeting that the technical papers were of very high quality. In addition to the submitted papers, SAS'98 had a number of outstanding invited speakers. Roberto Giacobazzi, Peter Lee, Amir Pnueli, Dave Schmidt, Scott Smolka, and Bernhard Ste?en accepted our invitation to give invited talks or tutorials. Some ofthepapers(orabstracts)basedonthesetalksarealsoincludedin thisvolume. SAS'98 has been fortunate to rely on a number of individuals and orga- zations. I want to thank all the program committee members and referees, for their hard work in producing the reviews and for such a smooth and enj- able programcommittee meeting. Special thanks go to the conference chairman, Maurizio Gabbrielli, and to my students in Pisa who helped me a lot. More s- cial thanks go to Vladimiro Sassone, who made available to SAS'98 his excellent system for handling submissions and reviews on the web, and to Ernesto Lastres andRen eMorenowhoweremy"systemmanagers."

This volume constitutes the proceedings of the Fourth International Conference on Algebraic and Logic Programming (ALP '94), held in Madrid, Spain in September 1994.
Like the predecessor conferences in this series, ALP '94 succeeded in strengthening the cross-fertilization between algebraic techniques and logic programming. Besides abstracts of three invited talks, the volume contains 17 full revised papers selected from 41 submissions; the papers are organized into sections on theorem proving, narrowing, logic programming, term rewriting, and higher-order programming.

This volume contains the proceedings of the Third International Conference on Algebraic and Logic Programming, held in Pisa, Italy, September 2-4, 1992. Like the two previous conferences in Germany in 1988 and France in 1990, the third conference aims at strengthening the connections betweenalgebraic techniques and logic programming. On the one hand, logic programming has been very successful during the last decades and more and more systems compete in enhancing its expressive power. On the other hand, concepts like functions, equality theory, and modularity are particularly well handled in an algebraic framework. Common foundations of both approaches have recently been developed, and this conference is a forum for people from both areas to exchange ideas, results, and experiences. The book covers the following topics: semantics ofalgebraic and logic programming; integration of functional and logic programming; term rewriting, narrowing, and resolution; constraintlogic programming and theorem proving; concurrent features in algebraic and logic programming languages; and implementation issues.

This volume consists of some of the papers that were delivered during the workshop on "Foundations of Logic and Functional Programming" held in Trento, Italy, from December 15th to 19th, 1986. The meeting centered on themes and trends in Functional Programming and in Logic Programming. This book contains five papers contributed by the invited speakers and five selected contributions.

Logic programming has emerged over the last five years as one of the most promising new programming paradigms and as a very active research area. The PROLOG experience has shown that relevant problems in areas such as expert systems, deductive databases, knowledge representation, and rapid prototyping can profitably be tackled by logic programming technology. It has also shown that the performance of PROLOG systems can compare with more traditional programming languages by means of sophisticated optimization and implementation of a new class of languages: the concurrent logic languages. Many recent advances in the theory of logic programs are related to extensions of the basic positive logic language and the related semantic problems. The original non-monotonic negation-as-failure rule has been extended in various ways and provided with new declarative characterizations. Other new language constructs are constraints (which lead to a very important extension of the paradigm which allows us to compute on new domains), concurrency, and modules and objects. This book, written by a team of international experts, goes beyond the classical theory to discuss these recent advances for the first time in a systematic form. The work is intended for advanced students of computer science, logic programming and artificial intelligence.