Newsletter 72March 2, 2001******************************************************************* * Past issues of the newsletter are available at http://logik.mathematik.uni-freiburg.de/lics/newsletters/ http://www.math.uic.edu/lics/newsletters/ * Instructions for submitting an announcement to the newsletter can be found at http://logik.mathematik.uni-freiburg.de/lics/newsletters/inst.html http://www.math.uic.edu/lics/newsletters/inst.html * The next newsletter will appear on Friday, April 20, 2001 ********************************************************************TABLE OF CONTENTS* Calls for Papers Conference on Concurrency Theory Workshop on Reduction Strategies in Rewriting and Programming Workshop on MEchanized Reasoning about Languages with variable bINding Workshop on Strategies in Automated Deduction Workshop on Fixed-Points in Computer Science Workshop on Functional and (Constraint) Logic Programming Symposium on Domain Theory * Calls for Participation First Order Constraints in Various Structures Unification Workshop * Journals Journal of Logic and Algebraic Programming: Special Issue on Pi-Calculus12th INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY (CONCUR 2001)Aalborg, Denmark, 21-24 August, 2001 Call for Papers http://concur01.cs.auc.dk/ * Topics. Concurrency related aspects of: models of computation and semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model-checking, verification techniques, refinement techniques, term and graph rewriting, distributed programming, logic constraint programming, object-oriented programming, typing systems and algorithms, case studies, tools and environments for programming and verification. * Submission. Papers of at most 15 pages, accompanied by a one-page abstract, should be submitted electronically via the web submission form on the Conference's web site. Alternatively, submissions can be made by emailing a uuencoded PostScript file to concur01-sub@cs.auc.dk. Submission deadline: Monday, 19 March 2001. * Programme committee. Rajeev Alur, Frank de Boer, Javier Esparza, Wan Fokkink, Roberto Gorrieri, Petr Jancar, Orna Kupferman, Marta Kwiatkowska, Kim G. Larsen (co-chair), Oded Maler, Ugo Montanari, Uwe Nestmann, Mogens Nielsen (co-chair), Ernst-Rüdiger Olderog, Catuscia Palamidessi, K.V.S. Prasad, Philippe Schnoebelen, Björn Victor, Walter Vogler, Igor Walukiewicz,, Alex Yakovlev. * Invited speakers. Bengt Jonsson, Robin Milner, Shankar Sastry, Steve Schneider.WORKSHOP ON REDUCTION STRATEGIES IN REWRITING AND PROGRAMMING (WRS 2001)(affiliated with RTA'2001) First call for papers Utrecht, The Netherlands, May 26, 2001 http://www.logic.at/wrs01/ * Background: Reduction strategies in rewriting and programming have attracted an increasing attention within the last years. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application and implementation issues. The workshop wants to provide a forum for the presentation and discussion of new ideas and results, as well as of surveys on existing knowledge in this area. * Topics: theoretical foundations; strategies and their application in programming languages; properties, interrelations, combinations and applications of reduction strategies / computations under strategies; program analysis and other semantics-based optimization techniques dealing with reduction strategies; specification of reduction strategies in (real) languages; implementation techniques for reduction strategies. * Submissions should not exceed 10 pages (except for survey papers). Send a postscript version to (wrs01@logic.at) by March 12, 2001. * Program committee: M. Alpuente (TU Valencia), R. Echahed (IMAG Grenoble) B. Gramlich (TU Wien, co-chair), S. Lucas (TU Valencia, co-chair), V. van Oostrom (U Utrecht), R. Plasmeijer (KU Nijmegen), M. Schmidt-Schauss (U Frankfurt a.M.), Y. Toyama (U Tohoku).WORKSHOP ON MECHANIZED REASONING ABOUT LANGUAGES WITH VARIABLE BINDING (MERLIN 2001)(affiliated with IJCAR 2001) Call for Papers Siena, Italy, June 18-19, 2001 http://www.mcs.le.ac.uk/merlin * Theme: Currently, there is considerable interest in the use of computers to encode (operational) semantic descriptions of programming languages. Such encodings are often done within the metalanguage of a theorem prover or related system. The encodings may require the use of variable binding constructs, inductive definitions, coinductive definitions, and associated schemes of (co)recursion. The broad aims are to provide researchers with a forum to review state of the art results and techniques, and to present recent and new progress in the areas of the automation of the metatheory of programming languages, particularly work which involves variable binding. Further, theoretical and practical problems of encoding variable binding, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Submissions are encouraged in one of the following two categories: Category A: Detailed and technical accounts of new research, up to fifteen pages including appendices. Category B: Shorter accounts of work in progress and proposed further directions, including discussion papers, up to ten pages including appendices. Papers should be submitted electronically as a PostScript file to the address merlin@mcs.le.ac.uk. If necessary, authors may submit three hard copies to the Local Organizer, Alberto Momigliano, by surface mail at Department of Mathematics and Computer Science, University of Leicester, University Road, LEICESTER, LE1 7RH, United Kingdom. * Submission deadline: Friday March 30th 2001 * Program Committee: Simon Ambler (University of Leicester), Roy Crole (Chair; University of Leicester), Amy Felty (University of Ottawa), Andrew Gordon (Microsoft Research, Cambridge), Furio Honsell (University of Udine), Tom Melham (University of Glasgow), Frank Pfenning (Carnegie Mellon University)WORKSHOP ON STRATEGIES IN AUTOMATED DEDUCTION (STRATEGIES 2001)(affiliated with IJCAR 2001) Call for Papers Siena, June 18 or 19, 2001 http://www.logic.at/strategies01/ * Theme. Strategies are almost ubiquitous in automated deduction and reasoning systems, yet only recently have they been studied in their own right. The workshop aims at making progress towards a deeper understanding of the nature of strategies and search plans, their description, properties, and usage, especially, but not exclusively, in theorem proving and model building. * All submissions must be done electronically. Please email your submission to strategies01@logic.at * Submission Deadline : March 31, 2001 * Program committee. Alessandro Armando (U. Genova), Maria Paola Bonacina, Co-Chair (U. Iowa), Gilles Dowek (INRIA & ICASE/NASA-Langley), Ruben Gamboa (AnythingOvernight.com, Inc.), Bernhard Gramlich, Co-Chair (TU Wien), Bernd Loechner (U. Kaiserslautern), Christophe Ringeissen (LORIA-INRIA)WORKSHOP ON FIXED POINTS IN COMPUTER SCIENCE (FICS'01)(Satellite Workshop to PLI'2001) Call for Papers September 8, 2001, Florence, Italy http://www.dsi.uniroma1.it/~labella/FICS.html * Aim. Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks. The aim of the workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the fixed point operation in the different fields and formalisms. * Topics. Construction and reasoning about properties of fixed points, categorical, metric and ordered fixed point models, continuous algebras, relation algebras, fixed points in process algebras and process calculi, regular algebras of finitary and infinitary languages, formal power series, tree automata and tree languages,infinite trees, the mu-calculus and other programming logics, fixed points in relation to dataflow and circuits, fixed points and the lambda calculus, fixed points in logic programming and data bases. * Authors are invited to send three copies of an abstract not exceeding three pages to the PC chair. Electronic submissions in the form of uuencoded postscript file are encouraged and can be sent to labella@dsi.uniroma1.it. * Submission Deadline: April 15, 2001 Notification: June 15, 2001 * Confirmed invited speakers: J. Adamek (Braunschweig), Z. 'Esik (Szeged), I. Guessarian (Paris), C. Stirling (Edinburgh), R. F. C. Walters (Sydney) * Program committee. J. Adamek(Braunschweig), R. Backhouse (Nottingham), S. Bloom (Hoboken NJ), R. De Nicola (Florence), Z. 'Esik (Szeged), I. Guessarian (Paris), W. Kuich (Vienna), A. Labella (Rome, chair), M. Mislove (Tulane), D. Niwinski (Warsaw)INTERNATIONAL WORKSHOP ON FUNCTIONAL AND (CONSTRAINT) LOGIC PROGRAMMING (WFLP 2001)Call for Papers Kiel, Germany, September 13-15, 2001 http://www.informatik.uni-kiel.de/~wflp2001/ * Theme: WFLP 2001 is the combination of two annual workshops on declarative programming: The international workshops on functional and logic programming (WFLP) aim at bringing together researchers interested in functional programming, logic programming, as well as their integration. The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases and artificial intelligence. This joint workshop wants to promote the cross-fertilizing exchange of ideas and experiences among researches and students from the different communities. The primary focus is on new and original research results but submissions describing innovative products, prototypes under development or interesting experiments (e.g., benchmarks) are also encouraged. The topics of interest include (but are not limited to): Functional programming; logic programming; constraint programming; deductive databases; extensions of declarative languages, objects; multi-paradigm declarative programming; foundations, semantics, nonmonotonic reasoning, dynamics; parallelism, concurrency; program analysis, abstract interpretation; program transformation, partial evaluation, meta-programming; specification, verification, declarative debugging; knowledge representation, machine learning; implementation of declarative languages; advanced programming environments and tools; applications. * Submissions: Extended abstracts (max. 10 pages including figures and references) or a system description (max 3 pages) in postscript format (11pt) via email to wflp2001@informatik.uni-kiel.de * Submission deadline: May 15, 2001 * Invited Speakers: Peter Van Roy, Thomas Arts * Program Committee: Slim Abdennadher, Maria Alpuente,Sergio Antoy, Christoph Beierle, Alexander Bockmayr, Harold Boley, François Bry, Juergen Dix, Rachid Echahed, Uwe Egly, Moreno Falaschi, Burkhard Freitag, Thom Fruehwirth, Norbert E. Fuchs, Ulrich Geske, Michael Hanus, Herbert Kuchen, Juan Jose Moreno Navarro, Mario Rodriguez-Artalejo, Dietmar Seipel2ND INTERNATIIONAL SYMPOSIUM ON DOMAIN THEORY (ISDT 2001)Call for Papers October 22-26, 2001 Sichuan University, Chengdu, China http://vorlon.cwru.edu/~gqz/ISDT.html * Theme: contributed talks are solicited in the general area of mathematical structures for programming and computation. Specific topics include: Topological and logical aspects of domains, categories of domains and powerdomains, partial orders and metric spaces, applications in mathematics and computer science, types, process algebra and concurrency, non-classical and partial logics, programming language semantics. * Submission: send a one-page abstract including title, address, and e-mail address to gqz@eecs.cwru.edu before June 30, 2001. * Confirmed invited speakers: Pierre-Louis Curien, Abbas Edalat, Martin Escardo, Achim Jung, Mike Mislove, William Rounds. * Program committee: Jimmie Lawson, Guo-Qiang Zhang, Ying-Ming Liu, Mao-Kang Luo. * Important dates: Abstract June 30, 2001; Registration July 15, 2001; Full paper Nov. 15, 2001. Similar to the first Symposium, the proceedings are to be published by Kluwer Academic Publishers in the book series Semantics in Computation.FIRST ORDER CONSTRAINTS IN VARIOUS STRUCTURESCentre International de Rencontres Mathématiques (CIRM) at Marseille May 3-4, 2001 http://alain.colmerauer.free.fr/firstorderconstraints.htm http://www.cirm.univ-mrs.fr * This is an informal workshop is organized by Alain Colmerauer. It should gather computer scientists and logicians interested in exploring three themes: (1) algorithms for solving first order constraints, (2) first order axiomatizations of interesting structures, (3) expressiveness of first order constraints and complexity of their solving. * People who are interested in giving a talk on their related (past, recent or new) work should e-mail to alain.colmerauer@lim.univ-mrs.fr a detailed abstract, as soon as possible and before March 16, 2001. A LateX source and a typeset version (.ps, .pdf, .dvi) would be the best. Talks on the state of the art are also welcome. * A budget is available which should allow to pay back some travelling expenses and accomadation and meals (at the CIRM) for the speakers.UNIFICATION WORKSHOP (UNIF 2001)(affiliated with IJCAR 2001) Call for Abstracts and Participation Siena, Italy, June 18-19, 2001 http://goedel.cs.uiowa.edu/unif2001/ * Theme. Unification is concerned with the problem of identifying given terms, either syntactically or modulo a given logical theory. Syntactic unification is the basic operation of most automated reasoning systems, and unification modulo theories can be used, for instance, to build in special equational theories into theorem provers. * All submissions must be done electronically. Please email your submission, or announce your interest to participate, to unif2001@cs.uiowa.edu. See the instructions at http://goedel.cs.uiowa.edu/unif2001/ * Submission Deadline : April 15, 2001 * Organizing committee. Franz Baader (RWTH Aachen, Germany), Volker Diekert (Universit"at Stuttgart, Germany), Cesare Tinelli (University of Iowa, USA), Ralf Treinen (Universite' Paris-Sud, France).SPECIAL ISSUE ON THE PI-CALCULUSCall for Papers Journal of Logic and Algebraic Programming Special issue on the pi-Calculus http://www.docs.uu.se/jlap01/ * Deadline for submissions: September 1, 2001 * Guest editors: Uwe NestmannBjorn Victor

Back to the LICS web page.