Helene Kirchner – författare

This book constitutes the refereed proceedings of the 9th International Conference on Algebraic Methodology and Software Technology, AMAST 2002, held in Saint-Gilles-les-Bains, Reunion Island, France in September 2002. The 26 revised full papers presented together with 6 invited papers and 2 system descriptions were carefully reviewed and selected from 59 submissions. Among the topics covered are all current issues in formal methods related to algebraic approaches including abstract data types, process algebras, algebraic specification, semantic specification, model checking, mu-calculus, Petri box algebras, unification, verification of Java for smart cards, security, JML specification, and formal software development.

This volume consists of papers presented at the Second International Conference on Algebraic and Logic Programming in Nancy, France, October 1-3, 1990.

This volume contains the proceedings of the ThirdInternational Conference on Algebraic and Logic Programming,held in Pisa, Italy, September 2-4, 1992. Like the twoprevious conferences in Germany in 1988 and France in 1990,the third conference aims at strengthening the connectionsbetweenalgebraic techniques and logic programming. On theone hand, logic programming has been very successful duringthe last decades and more and more systems compete inenhancing its expressive power. On the other hand, conceptslike functions, equality theory, and modularity areparticularly well handled in an algebraic framework. Commonfoundations of both approaches have recently been developed,and this conference is a forum for people from both areas toexchange ideas, results, and experiences. The book coversthe following topics: semantics ofalgebraic and logicprogramming; integration of functional and logicprogramming; term rewriting, narrowing, and resolution;constraintlogic programming and theorem proving; concurrentfeatures in algebraic and logic programming languages; andimplementation issues.

This book constitutes the refereed proceedings of the 21st International Colloquium on Trees in Algebra and Programming, CAAP '96, held in Linköping, Sweden, in April 1996.The 21 full revised papers presented were selected from 44 submissions; also included are invited papers by Samson Abramsky and Frank Pfenning. In keeping with the tradition of the CAAP conferences, this volume covers algebraic, logical, and combinatorial properties of discrete structures and their application to computer science, in particular to the theory of computation and to programming theory.

This book constitutes the refereed proceedings of the 15th International Conference on Automated Deduction, CADE-15, held in Lindau, Germany, in July 1998.The volume presents three invited contributions together with 25 revised full papers and 10 revised system descriptions; these were selected from a total of 120 submissions. The papers address all current issues in automated deduction and theorem proving based on resolution, superposition, model generation and elimination, or connection tableau calculus, in first-order, higher-order, intuitionistic, or modal logics, and describe applications to geometry, computer algebra, or reactive systems.

This volume contains the proceedings of FroCoS2000, the 3rd International WorkshoponFrontiersofCombiningSystems,heldMarch22-24,2000,inNancy, France. Like its predecessors organized in Munich (1996) and in Amsterdam (1998), FroCoS2000 is intended to o?er a common forum for research activities related to the combination and the integration of systems in the areas of logic, automateddeduction,constraintsolving,declarativeprogramming,andarti?cial intelligence. There were 31 submissions of overall high quality, authored by researchers from countries including Australia, Brasil, Belgium, Chili, France, Germany, - pan, Ireland, Italy, Portugal, Spain, Switzerland, The Netherlands, the United Kingdom, and the United States of America. All submissions were thoroughly evaluatedonthebasisofatleastthreerefereereports,andanelectronicprogram committeemeetingwasheldthroughtheInternet.Theprogramcommitteesel- ted 14 research contributions.The topics covered by the selected papers include: combinationoflogics;combinationofconstraintsolvingtechniques,combination of decision procedures; modular properties for theorem proving; combination of deduction systems and computer algebra; integration of decision procedures and other solving processes into constraint programming and deduction systems. We welcomed ?ve invited lectures by Alexander Bockmayr on "Combining Logic and Optimization in Cutting Plane Theory", Gilles Dowek on "Axioms vs. Rewrite Rules: From Completeness to Cut Elimination", Klaus Schulz on "Why Combined Decision Problems Are Often Intractable", Tomas Uribe on "Combinations of Theorem Proving and Model Checking", and Richard Zippel on "Program Composition Techniques for Numerical PDE Codes". Full papers of these lectures, except the last one, are also included in this volume.