Newsletter 109 March 20, 2007 ******************************************************************* * Past issues of the newsletter are available at http://www.informatik.hu-berlin.de/lics/newsletters/ * Instructions for submitting an announcement to the newsletter can be found at http://www.informatik.hu-berlin.de/lics/newsletters/inst.html * To unsubscribe, send an email with "unsubscribe" in the subject line to email@example.com ******************************************************************* TABLE OF CONTENTS * CONFERENCES AND WORKSHOPS CSL 2007 - Call for Papers HOR 2007 - Call for Abstracts Logic, Rationality and Interaction - Call for Papers WORKSHOP ON C/C++ VERIFICATION - Call for Papers LFMTP 2007 - Call for Papers ACSAC 2007 - Call for Papers WORKSHOP ON UNIVERSAL ALGEBRA AND THE CONSTRAINT SATISFACTION PROBLEM FACS 2007 - Call for Papers LOPSTR 2007 - Call for Papers LCC 2007 - Call for Papers * WORKSHOPS Linear logic, ludics, implicit complexity, operator algebras Jean-Yves Girard, Conference in honour of his 60th birthday COMPUTER SCIENCE LOGIC (CSL 2007) Call for Papers 11-15 September, 2007 Lausanne (CH) * CSL is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. * CSL'07, the 16th annual EACSL conference will be organized in Lausanne by the Western Swiss Center for Logic, History and Philosophy of Sciences, and the University of Lausanne. * The Ackermann Award for 2007 is sponsored by Logitech and will be presented to the recipients at CSL'07. * A joint session with GAMES 07, the annual meeting of the European Network will take place on 11 September, 2007. http://www.unil.ch/csl07/ * Topics of interest include: - automated deduction and interactive theorem proving, - constructive mathematics and type theory, - equational logic and term rewriting, - automata and games, - modal and temporal logics, - model checking, - logical aspects of computational complexity, - finite model theory, - computational proof theory, - logic programming and constraints, - lambda calculus and combinatory logic, - categorical logic and topological semantics, - domain theory, - database theory, - specification, extraction and transformation of programs, - logical foundations of programming paradigms, - verification and program analysis, - linear logic, - higher-order logic, - nonmonotonic reasoning, - logics and type systems for biology. * Proceedings will be published in the LNCS series. Each paper accepted by the Programme Committee must be presented at the conference by one of the authors, and final copy be prepared according to Springer's guidelines. * Submitted papers must be in Springer's LNCS style and of no more than 15 pages, presenting work not previously published. They must not be submitted concurrently to another conference with refereed proceedings. Any closely related work submitted to a conference or journal before April 2, 2007 must be reported to the PC chairs. Papers authored or coauthored by members of the Programme Committee are not allowed. * The submission deadline is in two stages. Titles and abstracts must be submitted by 02 April, 2007 and full papers by 09 April, 2007. Notifications of acceptance will be sent by 21 May, 2007, and final versions are due 18 June, 2007. * Important Dates: Submission - title & abstract: 02 April, 2007 - full paper: 09 April, 2007 - Notification: 21 May, 2007 - Final papers: 18 June, 2007 * Invited Speakers: -Samson Abramsky (Oxford) -Luca de Alfaro (Santa Cruz) -Arnold Beckmann (Swansea) -Anuj Dawar (Cambridge) -Orna Kupferman (Jerusalem) -Donald A. Martin (pending) (Los Angeles) -Helmut Seidl (Munich) * Programme Committee: -Serge Artemov (New-York) -Franz Baader (Dresden) -Lev Beklemishev (Moscow) -Andrei Bulatov (Burnaby) -Michel De Rougemont (Paris) -Jacques Duparc (co-Chair)(Lausanne) -Erich Graedel (Aachen) -Thomas Henzinger (co-Chair) (Lausanne) -Michael Kaminski (Haifa) -Stephan Kreutzer (Berlin) -Benedikt Loewe (Amsterdam) -Rupak Majumdar (Los Angeles) -Paul-Andre Mllies (Paris) -Joel Ouaknine (Oxford) -Jean-Eric Pin (Paris) -Nicole Schweikardt (Berlin) -Luc Segoufin (Orsay) -Thomas Strahm (Bern) -Ashish Tiwari (Menlo Park, CA) -Helmut Veith (Munich) -Igor Walukiewicz (Bordeaux) WORKSHOP ON HIGHER-ORDER REWRITING (HOR 2007) (affiliated with RDP 2007) Call for Abstracts Paris, June 25, 2007 http://www.rdp07.org/hor.html * Theme. HOR 2007 is a forum to present work concerning all aspects of higher-order rewriting. Topics of interest include (but are not limited to): Applications: proof checking, theorem proving, generic programming, declarative programming, program transformation. Foundations: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory. Frameworks: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. Implementation: explicit substitution, rewriting tools, compilation techniques. Semantics: semantics of higher-order rewriting, higher-order abstract syntax. * All submissions must be done electronically via http://www.easychair.org/HOR2007/ * Submission Deadline : April 13, 2007 * Program committee. Herman Geuvers (Radboud University Nijmegen, Netherlands), Makoto Hamana (Gunma University, Japan), Ralph Matthes (C.N.R.S., University of Toulouse III, France)(chair), Albert Rubio (Technical University of Catalonia, Spain), Mark-Oliver Stehr (SRI International, U.S.A.). * Invited speakers: Carsten Schürmann (IT University of Copenhagen, Denmark) plus another person, to be confirmed. WORKSHOP ON LOGIC, RATIONALITY AND INTERACTION Call for Papers 5-9 August, 2007. Beijing, China. http://www.illc.uva.nl/LORI * About the Workshop In the past decade it has become increasingly clear that studying information, first and foremost, means studying information exchange. This acknowledgement of the inherently social character of information shows up at many places in modern logical theories. More generally, information exchange is a form of interaction where agents act together in strategic ways. This new perspective has led to contacts between logic and game theory, bringing a new set of disciplines into the scope of logic: viz., economics, and the social sciences. New interfaces are arising, such as epistemic studies of rational behavior in games. Another interesting development in this area is the rise of the notion of 'social software', the idea of using computational techniques for analyzing patterns of social behavior. And finally, interaction is also crucial to intelligent behavior in the field of natural language. Here pragmatics, the study of the actual use of language between different agents, has become the primary focus of research. Notions from game theory, in particular evolutionary games, are being used to-day to answer all kinds of pragmatic issues, for instance, how linguistic conventions can arise. This workshop aims to bring together researchers working on these and related topics in logic, philosophy, computer science, and related areas in order to arrive at an integrated perspective on knowledge acquisition, information exchange, and rational action. *Important Dates* - Paper submission deadline: 15 April 2007 - Notification of authors: 15 May 2007 - Camera-ready copies due: 15 June 2007 - Workshop dates: 5-9 August 2007 * People involved Chair: Johan van Benthem Co-Chairs: Shier Ju and Frank Veltman General Organizers : Minghui Xiong and Fenrong Liu Invited Speakers: Alexandru Baltag (Oxford University, UK) Vincent F. Hendricks (Roskilde University, Denmark); Wiebe van der Hoek (Liverpool University, UK); Gerhard Jager (University of Bielefeld, Germany); Yossi Feinberg (Stanford University, USA); Jialong Zhang (Chinese Academy of Social Sciences, China) * Committee of Recommendation: Patrick Blackburn (FoLLI); Giacomo Bonanno (LOFT); Joseph Halpern (TARK); Johann Makowsky ( EACSL); Jacek Malinowski (Studia Logica); Gabriel Sandu (ESF Eurocores Intelligent Interaction) WORKSHOP ON C/C++ VERIFICATION (affiliated with IFM 2007) Call for Papers Oxford, UK, July 2nd, 2007 http://www.cse.unsw.edu.au/~rhuuck/CV07/ * Theme. All topics around C/C++ Verification, Semantics, Case studies. * Submissions shoud be sent to H.Tews@cs.ru.nl * Submission Deadline : April 29th, 2007 * Program committee. Hendrik Tews (Radboud Universiteit Nijmegen, The Netherlands), Reiner Haehnle (Chalmers University of Technology, Sweden), Wolfgang J. Paul (Universitaet des Saarlandes, Germany), Ralf Huuck (NICTA, Australia), Norbert Schirmer (Technische Universitaet Muenchen, Germany) INTERNATIONAL WORKSHOP ON LOGICAL FRAMEWORKS AND META-LANGUAGES: THEORY AND PRACTICE (LFMTP'07) Call for Papers Affiliated with CADE-21, Bremen, Germany, July 16, 2007 http://www.cs.mcgill.ca/~bpientka/lfmtp07 *Theme: Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design and implementation on the one hand and their applications in for example proof-carrying code, the reasoning about programming languages, or digital libraries has been the focus of considerable research over the last two decades. LFMTP'07 will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks, and is the major form for presentation of research in this area. * Program Committee:Andreas Abel(LMU Munich), Peter Dybjer(Chalmers University),Marino Miculan(University Udine), Dale Miller(INRIA Futurs), Brigitte Pientka(McGill University), Benjamin Pierce(University of Pennsylvania), Carsten Schuermann(IT University of Copenhagen, PC Chair), Christian Urban (TU Munich) * Submission deadline: Title and abstract: 7 May 2007, Paper: 13 May 2007 23RD ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE (ACSAC) Call for Papers Miami Beach, Florida, December 10-14, 2007 http://www.acsac.org * Important Dates: Paper Submission due: June 3, 2007 Acceptance notification: August 13, 2007 Final papers due: September 13, 2007 * ACSAC is an internationally recognized forum where practitioners, researchers, and developers in information system security meet to learn and to exchange practical ideas and experiences. Papers offering novel contributions in any aspect of computer and application security are solicited. Papers may present technique, applications, or practical experience, or theory that has a clear practical impact. Papers are encouraged on technologies and methods that have been demonstrated to be useful for improving information systems security and that address lessons from actual application. * Paper submissions: Submitted papers must not substantially overlap papers that have been published or that are simultaneously submitted to a journal or a conference with proceedings. Papers should be at most 15 pages including the bibliography and well-marked appendices (using 11-point font and reasonable margins on letter-size paper). Committee members are not required to read the appendices, and so the paper should be intelligible without them. All submissions should be appropriately anonymized (i.e., papers should not contain author names or affiliations, or obvious citations). Submissions are to be made to the submission web site at http://www.acsac.org. Only pdf or postscript files will be accepted. Submissions not meeting these guidelines risk rejection without consideration of their merits. Papers must be received by the deadline of June 3, 2007. Authors of accepted papers must guarantee that their papers will be presented at the conference. * Other submissions: Detailed submission information for panels, tutorials, workshops, case studies, work in progress, and exhibitor information can be found at http://www.acsac.org/cfp. WORKSHOP ON UNIVERSAL ALGEBRA AND THE CONSTRAINT SATISFACTION PROBLEM Nashville, June 17 -- 20, 2007 (following the International Conference on Order, Algebra, and Logics) Workshop Website: http://www.math.vanderbilt.edu/~uacsp2007/ <http://www.math.vanderbilt.edu/%7Euacsp2007/> *Theme: The Constraint Satisfaction Problem (CSP) provides a framework for expressing a large number of combinatorial search problems that arise in wide areas of computer science and discrete mathematics. The primary goal of this workshop is to bring together researchers from the universal algebra/lattice theory and CSP communities to further the algebraic approach to several conjectures and problems related to constraint satisfaction. Tutorials will be offered to provide participants with the requisite background material and then a series of invited lectures on recent work on the CSP and algebra will be given. Secondary goals are to foster and strengthen links between computer science and mathematics and to provide graduate students and junior researchers with a rich and interesting set of new problems to work on. * Invited Speakers: Albert Atserias (Technical University of Catalonia), Manuel Bodirsky (Humboldt University), Andrei Bulatov (SFU), Hubie Chen (University Pompeu Fabra), Victor Dalmau (University Pompeu Fabra), Andrei Krokhin (University of Durham), Gabor Kun (University of Memphis), Benoit Larose (Champlain Regional College), Miklos Maroti (University of Szeged), Petar Markovic (University of Novi Sad), Ralph McKenzie (Vanderbilt), Pascal Tesson (Laval University), Moshe Vardi (Rice University), Ross Willard (University of Waterloo), Lazslo Zadori (University of Szeged) * Organizing committee: Andrei Bulatov (SFU),Victor Dalmau (UPF), Ralph McKenzie (Vanderbilt) (Chair), Matt Valeriote (McMaster) FUNDAMENTAL ASPECTS OF COMPONENT SOFTWARE (FACS'07) Call for Papers Sophia-Antipolis, France, 19-21 september 2007 Workshop site: http://www.iist.unu.edu/facs07/ * Theme: Component-based software emerged as a promising paradigm to deal with the ever increasing need for mastering systems' complexity, for enabling evolution and reuse, and for driving software engineering into sound production and engineering standards. Soon, however, it became a popular technology long before well understood and widely adopted formal foundations have emerged. Issues like mathematical models for components, their interaction and composition, or rigorous approaches to verification, deployment, testing and certification remain open research questions and challenging opportunities for formal methods. Moreover, new challenges are raised by applications of this paradigm to safety-critical, mobile, or reconfigurable systems. The objective of FACS'07 is to bring together researchers in the areas of component software and formal methods to promote a deep understanding of this paradigm and its applications. Full list of topics on the web site. * Important Dates: Abstract submission & paper registration deadline: June 4, 2007 Paper upload deadline: June 11, 2007 Workshop: September 19-21, 2007 * All submissions must be done electronically through the web site. Post-proceedings will be published by ENTCS. * Chairs: Markus Lumpe (Iowa State University, USA) and Eric Madelaine (INRIA, Centre Sophia Antipolis, France) * Program Committee : Farhad Arbab (CWI, The Netherlands), Luis Barbosa (Universidade do Minho, Portugal), Frank S. de Boer, (CWI, The Netherlands), Christiano Braga (Universidad Complutense de Madrid, Spain), Carlos Canal (Universidad de Malaga, Spain), Paolo Ciancarini (Universita di Bologna, Italy), Jose Fiadeiro (University of Leicester, United Kingdom), Rolf Hennicker (Ludwig-Maximilians-Universitaet Muenchen, Germany), Atsushi Igarashi (Kyoto University, Japan), Einar Broch Johnsen (Universitetet i Oslo, Norway), Bengt Jonsson (Uppsala University, Sweden), Mathai Joseph (Tata Consultancy Services Limited, India), Vladimir Mencl (Charles University, Czech Republic, and University of Canterbury, New Zealand), Corina Pasareanu (NASA Ames, USA), Frantisek Plasil (Charles University, Czech Republic), Ralf Reussner (University of Oldenburg, Germany), Bernhard Schaetz (Technical University of Munich, Germany), Joseph Sifakis (VERIMAG, France), Carolyn Talcott (SRI International, USA), Dang Van Hung (IIST UNU, MACAU) INTERNATIONAL SYMPOSIUM ON LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2007) Call for papers 22-24 August 2007, Kongens Lyngby, Denmark (co-located with SAS 2007) url: http://www.cs.kent.ac.uk/events/conf/2007/lopstr/ email: firstname.lastname@example.org * Objectives The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium, so authors can incorporate this feedback in the published papers. * Topics Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: specification synthesis verification transformation analysis optimisation composition security reuse applications and tools component-based software development software architectures agent-based software development program refinement * Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. * Submission information and Special Issue: Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages respectively. Submissions must be formatted in LNCS style (excluding bibliography and well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. After the symposium, the programme committee will select those papers to be considered for formal publication. These authors will be invited to revise their submissions in the light of the feedback solicited at the meeting. Then after another round of reviewing, these revised papers will be published by Springer-Verlag in the Lecture Notes in Computer Science series. * The very best papers will additionally be invited to submit for a special issue or special track of the journal Higher-Order and Symbolic Computation, provided there are sufficient high-quality submissions. * Papers should be submitted either in PostScript or PDF format and they should be interpretable by Ghostscript or Acrobat Reader. * Invited Speaker: Michael Codish (Ben-Gurion University of the Negev, Israel) * Program Committee: Elvira Albert (Universidad Complutense Madrid, Spain) John Gallagher (University of Roskilde, Denmark) Michael Hanus (Christian-Albrechts-Universität zu Kiel, Germany) Jacob Howe (City University, UK) Andy King (University of Kent, UK) Michael Leuschel (Heinrich-Heine-Universität Düsseldorf, Germany) Mario Ornaghi (Università degli Studi di Milano, Italy) Étienne Payet (Université de La Réunion, France) Alberto Pettorossi (Università di Roma Tor Vergata, Italy) Carla Piazza (Università degli Studi di Udine, Italy) C. R. Ramakrishnan (SUNY Stony Brook, USA) Abhik Roychoudhury (National University of Singapore, Singapore) Peter Schneider-Kamp (RWTH Aachen, Germany) Alexander Serebrenik (Technische Universiteit Eindhoven, Netherlands) Josep Silva (Technical University of Valencia, Spain) Wim Vanhoof (University of Namur, Belgium) * Important dates: Submission of paper/extended abstract June 8, 2007 Notification July 13, 2007 Revised version (for pre-proceedings) August 10, 2007 Symposium August 22-24, 2007 Camera-ready version (for post-proceedings) December 14, 2007 WORKSHOP ON LOGIC AND COMPUTATIONAL COMPLEXITY (LCC'07) (affiliated with LICS 2007) Call for Papers Wroclaw, Poland - 15th July 2007 http://www.cis.syr.edu/~royer/icc/LCC07/ * Theme: The workshop aims at furthering an understanding of the relations between computational complexity and logic. Topics of interest include: complexity analysis for functional languages, complexity in database theory, complexity in formal methods, computational complexity in higher types, formal methods for complexity analysis of programs, foundations of implicit computational complexity, logical & machine-independent characterizations of complexity classes, logics closely related to complexity classes, proof complexity, semantic approaches to complexity, software that applies LCC ideas, and type systems for * Submissions: For details, see the workshop website (http://www.cis.syr.edu/~royer/icc/LCC07/). * Submission Deadline: April 16, 2007 * Program committee: Albert Atserias (Poly. Univ. of Catalonia), Ulrich Berger (Univ. of Wales, Swansea), Andrei Bulatov (Simon Fraser Univ.), Stephan Kreutzer (Humboldt Univ. of Berlin), Andrzej Murawski (Univ. of Oxford), Martin Otto, co-chair (Darmstadt Univ. of Technology), Kazushige Terui (National Institute of Informatics, Tokyo), Pawel Urzyczyn, co-chair (Univ. of Warsaw) WORKSHOP ON LINEAR LOGIC, LUDICS, IMPLICIT COMPLEXITY, OPERATOR ALGEBRAS Dedicated to Jean-Yves Girard on his 60th birthday. Siena, (Italy), May 17-20, 2007 www.unisi.it/eventi/LOGIC * Theme: The aim is to gather people working in the many research streams originating from Girard's main achievements of the recent years. For each of the four main themes---Linear Logic (specifically, Proof Nets and Geometry of Interaction), Ludics, Implicit Complexity and Operator Algebras---there will be in-depth lectures (3 to 4 hours), with emphasis on the state of the art and prospects for future development. There will also be some time for 30- minute contributed papers and for discussion of general perspectives and philosophical foundations. * Program Commettee: V.M. Abrusci (Roma), C. Faggian ( Paris), S. Martini (Bologna), S. Ronchi Della Rocca (Torino), A. Ursini (Siena). * Invited Speakers: Patrick Baillot, Pierre-Louis Curien, Alberto Dal Lago, Claudia Faggian, Jean-Yves Girard, Paul Andre Mellies, Michele Pagani, Laurent Regnier, Kazushige Terui JEAN-YVES GIRARD, CONFERENCE IN HONOUR OF HIS 60TH BIRTHDAY Institut Henri Poincar=E9, Paris (France), September 10 and 11, 2007 http://www-lipn.univ-paris13.fr/jyg60 *Theme: Through our choice of invited speakers, we hope to illustrate the wide range of scientific interests of Jean-Yves Girard over thirty- five years, from the complexity of proofs to quantum mechanics, from system F to the geometry of computation, from denotational semantics to Von Neumann algebras. * Organizing committee: Michele Abrusci (Roma III) Pierre-Louis Curien (CNRS - Paris 7, chair), Martin Hyland (Cambridge), Giuseppe Longo (ENS, Paris), Mitsu Okada (Keio U., Tokyo), Phil Scott (Univ. of Ottawa), Jacqueline Vauzeilles (Paris 13, co-chair) *Invited Speakers: Patrick Dehornoy, Gerard Huet, Herman Jervell, Yves Lafont, Olivier Laurent Thierry Paul, Peter Selinger, Glynn Winskel
Back to the LICS web page.