Newsletter 140 November 4, 2012 ******************************************************************* * Past issues of the newsletter are available at http://lii.rwth-aachen.de/lics/newsletters/ * Instructions for submitting an announcement to the newsletter can be found at http://lii.rwth-aachen.de/lics/newsletters/inst.html ******************************************************************* TABLE OF CONTENTS * DEADLINES Deadlines in the coming weeks * LICS-RELATED CALLS LICS 2013 - Call for Workshop Proposals LICS 2013 - Call for Papers * CALLS FOR PAPERS/PROPOSALS CADE-24 - Call for Workshops, Tutorials and System Competitions LATA 2013 - Call for Papers CAV 2013 - Call for Workshop Proposals RDP 2013 - Call for Workshop Proposals TERMGRAPH 2013 - Call for Papers CAV 2013 - Call for Papers CADE-24 - Call for Papers DICE 2013 - Call for Papers PETRI NETS 2013 - Call for Papers TASE 2013 - Call for Papers TLCA 2013 - Call for Papers TAP 2013 - Call for Papers RTA 2013 - Call for Papers CALCO 2013 - Call for Papers DEADLINES * CADE-24 Proposal submission: November 9, 2012 http://www.cade-24.info/ * LATA 2013 Paper submission: November 15, 2012 http://grammars.grlmc.com/LATA2013/ * CAV 2013 Workshop Proposal: November 23, 2012 http://cav2013.forsyte.at/ * LICS 2013 Workshop Proposals: November 26, 2012 http://informatik.hu-berlin.de/lics/lics13/ * RDP 2013 Workshop Proposals: December 1, 2012 http://www.win.tue.nl/rdp2013/ * TERMGRAPH 2013 Abstract submission: December 20, 2012 Paper submission: January 7, 2013 http://termgraph2013.imag.fr * CAV 2013 Abstract submission: January 3, 2013 Paper submission (firm): January 7, 2013 http://cav2013.forsyte.at/ * CADE-24 Abstract submission: January 7, 2013 Paper submission: January 14, 2013 http://www.cade-24.info/ * LICS 2013 Title & Short Abstracts: January 7, 2013 Extended Abstracts: January 14, 2013 http://informatik.hu-berlin.de/lics/lics13/ * DICE 2013 Submission: January 10, 2013 http://dice2013.di.unito.it/ * PETRI NETS 2013 Submission of Papers: January 10, 2013 Submission of Tutorial Proposals: January 10, 2013 http://www.mc3.disco.unimib.it/petrinets2013/ * TASE 2013 Title and abstract submission: January 18, 2013 Paper submission: January 25, 2013 http://www1.aston.ac.uk/tase2013/ * TLCA 2013 Paper Registration (titles & short abstracts): January 25, 2013 Full Paper Submission: 1 February 2013 http://www.win.tue.nl/rdp2013/ * TAP 2013 Abstract submission: January 25, 2013 Paper submission: February 1, 2013 http://www.spacios.eu/TAP2013 * RTA 2013 Abstract submission: February 1, 2013 Paper submission: February 5, 2013 http://www.win.tue.nl/rdp2013/ * CALCO 2013 Abstract Submission: February 22, 2013 Paper Submission: March 1, 2013 http://coalg.org/calco13/ 28TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2013) Call for Workshop Proposals June 24, 28-29, 2013 New Orleans, USA http://www2.informatik.hu-berlin.de/lics/lics13/ * LOCATION AND COLOCATION The twenty-eighth ACM/IEEE Symposium on Logic In Computer Science (LICS 2013) will be held in New Orleans, USA, 25-28 June 2013. It will be colocated with MFPS (Mathematical Foundations of Programming Semantics) and CSF (IEEE Computer Security Foundations). Possible dates for workshops are Monday 24 June, Friday 28 June afternoon, and Saturday 29 June. * SCOPE Researchers and practitioners are invited to submit proposals for workshops on topics relating logic - broadly construed - to computer science or related fields. Typically, LICS workshops feature a number of invited speakers and a number of contributed presentations. LICS workshops do not usually produce formal proceedings. However, in the past there have been special issues of journals based in part on certain LICS workshops. * PROPOSALS Proposals should include: - A short scientific summary and justification of the proposed topic. This should include a discussion of the particular benefits of the topic to the LICS community. - A discussion of the proposed format and agenda. - The proposed duration, which is typically one day (two-day workshops can be accommodated too). - Your preferred dates. This is important! - Let us know if you would like your workshop to be a joint workshop with CSF. In that case you should submit to both. - Procedures for selecting participants and papers. - Expected number of participants. This is important! - Potential invited speakers. - Plans for dissemination (for example, special issues of journals). * SUBMISSION Proposals should be submitted via Easychair at https://www.easychair.org/conferences/?conf=licsworkshops2013 * IMPORTANT DATES Submission deadline: November 26, 2012 Notification: December 20, 2012 Program of the workshops ready: April 30, 2013 Workshops: June 24, 2013 or June 28-29, 2013 LICS conference: June 25-28, 2013 * WORKSHOPS CHAIR Patricia Bouyer-Decitre, CNRS, ENS Cachan * SELECTION COMMITTEE The workshops selection committee consists of the LICS General Chair, LICS Workshops Chair, LICS 2013 PC Chair and LICS 2013 Conference Chair. 28TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2013) Call for Papers June 25-28, 2013 New Orleans, USA http://informatik.hu-berlin.de/lics/lics13/ * LOCATION AND COLOCATION LICS 2013 will be hosted by Tulane University, in New Orleans, LA USA, from June 25th to 28th, 2013. LICS 2013 will be co-located with MFPS13 (23-25 June) and CSF13 (26-28 June). * SCOPE The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, theory of automatic structures, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security, rewriting, type systems and type theory, and verification. * IMPORTANT DATES Titles & Short Abstracts Due : January 7, 2013 Extended Abstracts Due : January 14, 2013 Author Notification (approximate) : March 22, 2013 * KLEENE AWARD An award in honor of the late Stephen C. Kleene will be given for the best student paper(s), as judged by the program committee. * SPECIAL ISSUES Full versions of up to three accepted papers, to be selected by the program committee, will be invited for submission to the Journal of the ACM. Additional selected papers will be invited to a special issue of Logical Methods in Computer Science. * PROGRAM CHAIR Orna Kupferman, Hebrew University * PROGRAM COMMITTEE Parosh A. Abdulla, Uppsala University Amal Ahmed, Northeastern Universtiy Sergei Artemov, City University of New York Andrei Bulatov, Simon Fraser University Yijia Chen, Shanghai Jiao Tong University Veronique Cortier, CNRS, Loria Mariangiola Dezani-Ciancaglini, Univ. di Torino Thomas Ehrhard, CNRS, Universite Paris Diderot Javier Esparza, Technische Universitaet Muenchen Kousha Etessami, University of Edinburgh Maribel Fernandez, King's College London Santiago Figueira, University of Buenos Aires Simon Gay, University of Glasgow Martin Grohe, Humboldt-Universitaet zu Berlin Martin Hofmann, LMU Munich Petr Jancar, Technical University Ostrava Barbara Jobstmann, CNRS, Verimag and Jasper DA Patricia Johann, University of Strathclyde Bakhadyr Khoussainov, The University of Auckland Antonina Kolokolova, University of Newfoundland Victor Marek, University of Kentucky Angelo Morzenti, Politecnico di Milano Lawrence Moss, Indiana University Madhavan Mukund, Chennai Math. Institute Anca Muscholl, Universite Bordeaux Mogens Nielsen, Aarhus University Catuscia Palamidessi, INRIA, Ecole Polytechnique Luc Segoufin, INRIA, ENS Cachan Natarajan Shankar, SRI International Alexandra Silva, Radboud University Nijmegen Balder ten Cate, UC Santa Cruz Kazushige Terui, Kyoto University Ron van der Meyden, Univ. of New South Wales Jeannette M. Wing, Carnegie Mellon University Nobuko Yoshida, Imperial College London * CONFERENCE CHAIR Mike Mislove, Tulane University * WORKSHOP CHAIR Patricia Bouyer-Decitre, CNRS, ENS Cachan * PUBLICITY CHAIR Andrzej Murawski, University of Leicester * GENERAL CHAIR Luke Ong, University of Oxford 24TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION (CADE-24) Call for Workshops, Tutorials and System Competitions Lake Placid, USA 9-14 June 2013 http://www.cade-24.info * SCOPE CADE is the major international forum at which research on all aspects of automated deduction is presented. * CALL FOR WORKSHOPS Workshop proposals for CADE-24 are solicited. Both well-established workshops and newer ones are encouraged. Similarly, proposals for workshops with a tight focus on a core automated reasoning specialization, as well as those with a broader, more applied focus, are very welcome. Please provide the following information in your application document: + Workshop title + Names and affiliations of organizers + Proposed workshop duration (from half a day to two days) + Brief description of the goals and the scope of the workshop. Why is the workshop relevant for CADE? + Is the workshop new or has it met previously? In the latter case information on previous meetings should be given. + What are the plans for publication? * CALL FOR TUTORIALS Tutorial proposals for CADE-24 are solicited. Tutorials are expected to be half-day events, with a theoretical or applied focus, on a Topic Of Interest for CADE-24. Proposals should provide the following information: + Tutorial title. + Names and affiliations of organizers. + Brief description of the tutorial's goals and topics to be covered. + Whether or not a version of the tutorial has been given previously. CADE will take care of printing and distributing notes for tutorials that would like this service. * CALL FOR SYSTEM COMPETITIONS The CADE ATP Systems Competition CASC, which evaluates automated theorem proving systems for classical logics, has become an integral part of the CADE conferences. Further system competition proposals are solicited. The goal is to foster the development of automated reasoning systems in all areas relevant for automated deduction in a broader sense. + Competition title. + Names and affiliations of organizers. + Duration and schedule of the competition. + Room/space requirements. + Description of the competition task and the evaluation procedure. + Is the competition new or has it been organized before? In the latter case information on previous competitions should be given. + What computing resources are required and how will they be provided? * IMPORTANT DATES Deadline for proposal submissions: 9 November 2012 Acceptance/rejection notification: 30 November 2012 Workshops and Tutorials: 9-10 June 2013 Competitions: 9-14 June 2013 Conference: 11-14 June 2013 * SUBMISSION INSTRUCTIONS Proposals should be uploaded via https://www.easychair.org/conferences/?conf=cade24workshopscompe * CONFERENCE CO-CHAIRS Christopher A. Lynch Clarkson University Neil V. Murray SUNY Albany * PROGRAM COMMITTEE CHAIR Maria Paola Bonacina Universita degli Studi di Verona * TUTORIAL CHAIR Peter Baumgartner NICTA and Australian National University * WORKSHOP AND COMPETITION CHAIR Christoph Benzmueller Freie Universitaet Berlin * PUBLICITY AND WEB CHAIR Grant Olney Passmore Cambridge University and University of Edinburgh 7th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA, THEORY AND APPLICATIONS (LATA 2013) Call for Papers Bilbao, Spain, April 2-5, 2013 http://grammars.grlmc.com/LATA2013/ * AIMS LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2013 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence). * VENUE LATA 2013 will take place in Bilbao, at the Basque Country in Northern Spain. The venue will be the Basque Center for Applied Mathematics (BCAM). * SCOPE Topics of either theoretical or applied interest include, but are not limited to: - algebraic language theory - algorithms for semi-structured data mining - algorithms on automata and words - automata and logic - automata for system analysis and programme verification - automata, concurrency and Petri nets - automatic structures - cellular automata - combinatorics on words - computability - computational complexity - computational linguistics - data and image compression - decidability questions on words and languages - descriptional complexity - DNA and other models of bio-inspired computing - document engineering - foundations of finite state technology - foundations of XML - fuzzy and rough languages - grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) - grammars and automata architectures - grammatical inference and algorithmic learning - graphs and graph transformation - language varieties and semigroups - language-based cryptography - language-theoretic foundations of artificial intelligence and artificial life - parallel and regulated rewriting - parsing - pattern recognition - patterns and codes - power series - quantum, chemical and optical computing - semantics - string and combinatorial issues in computational biology and bioinformatics - string processing algorithms - symbolic dynamics - symbolic neural networks - term rewriting - transducers - trees, tree languages and tree automata - weighted automata * STRUCTURE LATA 2013 will consist of - 3 invited talks - 2 invited tutorials - peer-reviewed contributions * PROGRAMME COMMITTEE Parosh Aziz Abdulla (Uppsala) Franz Baader (Dresden) Jos Baeten (CWI, Amsterdam) Christel Baier (Dresden) Gerth Stolting Brodal (Aarhus) John Case (Delaware) Marek Chrobak (Riverside) Mariangiola Dezani (Torino) Rod Downey (Wellington) Ding-Zhu Du (Dallas) Ivo Duentsch (Brock) E. Allen Emerson (Austin) Javier Esparza (Technical University Munich) Michael R. Fellows (Darwin) Alain Finkel (ENS Cachan) Dov M. Gabbay (King's, London) Juergen Giesl (Aachen) Rob van Glabbeek (NICTA, Sydney) Georg Gottlob (Oxford) Annegret Habel (Oldenburg) Reiko Heckel (Leicester) Sanjay Jain (Singapore) Charanjit S. Jutla (IBM Thomas J. Watson) Ming-Yang Kao (Northwestern) Deepak Kapur (Albuquerque) Joost-Pieter Katoen (Aachen) S. Rao Kosaraju (Johns Hopkins) Evangelos Kranakis (Carleton) Hans-Joerg Kreowski (Bremen) Tak-Wah Lam (Hong Kong) Gad M. Landau (Haifa) Kim G. Larsen (Aalborg) Richard Lipton (Georgia Tech) Jack Lutz (Iowa State) Ian Mackie (Ecole Polytechnique, Palaiseau) Rupak Majumdar (Max Planck, Kaiserslautern) Carlos Martin-Vide (Tarragona, chair) Paliath Narendran (Albany) Tobias Nipkow (Technical University Munich) David A. Plaisted (Chapel Hill) Jean-Francois Raskin (Brussels) Wolfgang Reisig (Humboldt Berlin) Michael Rusinowitch (LORIA, Nancy) Davide Sangiorgi (Bologna) Bernhard Steffen (Dortmund) Colin Stirling (Edinburgh) Alfonso Valencia (CNIO, Madrid) Helmut Veith (Vienna Tech) Heribert Vollmer (Hannover) Osamu Watanabe (Tokyo Tech) Pierre Wolper (Liege) Louxin Zhang (Singapore) * PUBLICATION A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. * DEADLINES Paper submission: November 15, 2012 (23:59 CET) Notification of paper acceptance or rejection: December 16, 2012 Final version of the paper for the LNCS proceedings: December 25, 2012 25TH INTERNATIONAL CONFERENCE ON COMPUTER AIDED VERIFICATION (CAV 2013) Call for Workshop Proposals Saint Petersburg, Russia July 13-19, 2013 http://cav2013.forsyte.at/ * GENERAL The 2013 Computer-Aided Verification (CAV) Workshops provide an opportunity for participants to discuss topics in the broader verification related domains. CAV 2013 Workshops will be held before the main conference on July 13 and 14. Workshop proposals will be reviewed by the workshop chair along with the program chairs and members of the steering committee. Proposals must consist of the following two parts: - Part I: Technical Information A short (about 1 page) scientific justification of the proposed topic, its significance and relevance to CAV, and the particular benefits of the workshop to the verification community, as well as a list of previous or related workshops (if relevant). - Part II: Organizational Information - contact information of the workshop organizers - identifying a main contact for the workshop (i.e. a workshop chair) - the desired length of the workshop, (one or two days) - estimate of the audience size - proposed format and agenda (for example, demo sessions, tutorials, etc.) - potential invited speakers - procedures for selecting papers and participants - plans for dissemination, if any (for example, special issues of journals) - special technical, AV, or USB stick needs - links to a preliminary website of the workshop and call for papers (if possible) - information if workshop has been previously held * IMPORTANT DATES Proposals are due by Nov 23, 2012 by email to the workshop chair. Organizers will be notified by Nov 30, 2012. The workshop proposals will be reviewed and evaluated on the following criteria: - Potential to advance state of the art in verification technologies, especially ability to break new ground. - Relevance to CAV. - Overlap of topics with other proposed workshops. - Past-successes of the workshop and association with previous CAV conferences. - Organizers' ability and experience to lead a successful workshop. 7TH INTERNATIONAL CONFERENCE ON REWRITING, DEDUCTION AND PROGRAMMING (RDP 2013) Call for Workshop Proposals Eindhoven, The Netherlands June 23-28, 2013 http://www.win.tue.nl/rdp2013/ * SCOPE RDP 2013 is the seventh edition of the International Conference on Rewriting, Deduction, and Programming, consisting of two main conferences RTA (Rewriting Techniques and Applications), June 24-26, and TLCA (Typed Lambda Calculi and Applications), June 26-28. * DATES Workshop proposals for RDP 2013 are solicited for the days June 24 (Monday), June 25 (Tuesday), June 27 (Thursday) and June 28 (Friday). Both well-established workshops and newer ones are encouraged. Also system competition proposals are solicited. Due to the overlap with the conferences, workshops most related to TLCA are expected to be on June 24 and 25, and workshops most related to RTA are expected to be on June 27 and 28. * CONTACT If you want to organize a workshop, please send the following information to Hans Zantema (firstname.lastname@example.org), no later than December 1, 2012: - Workshop title and description of the topic, - Names and affiliations of the organizers, and - Proposed workshop duration (from half a day to two days). Notification date: December 20. 7TH INTERNATIONAL WORKSHOP ON COMPUTING WITH TERMS AND GRAPHS (TERMGRAPH 2013) Call for Papers Rome, Italy March 23rd, 2013 (Part of ETAPS 2013) http://termgraph2013.imag.fr * AIMS AND SCOPE Research in term and graph rewriting ranges from theoretical questions to practical issues. Computing with graphs handles the sharing of common subexpressions in a natural and seamless way, and improves the efficiency of computations in space and time. Sharing is ubiquitous in several research areas, for instance : the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the modelling of biological or chemical abstract machines, the implementation techniques of programming languages: many implementations of functional, logic, object-oriented, concurrent and mobile calculi are based on term graphs. Term graphs are also used in automated theorem proving and symbolic computation systems working on shared structures. The aim of this workshop is to bring together researchers working in different domains on term and graph transformation and to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in term graph rewriting. * ETAPS TERMGRAPH 2013 is a one-day satellite event of ETAPS 2013, which will take place in Rome, Italy, from March 16 to March 24, 2013. Previous editions of the TERMGRAPH workshop series (http://www.termgraph.org.uk/) took place in Barcelona (2002), in Rome (2004), in Vienna (2006), in Braga (2007) in York (2009) and in Saarbrcken (2011). * IMPORTANT DATES December 20, 2012 Abstract submission January 7, 2013 Paper submission January 25, 2013 Notification of acceptance February 10, 2013 Proceedings version due * TOPICS Topics of interest are open and include all aspects of term graphs and sharing of common subexpressions in rewriting, programming, automated reasoning and symbolic computation. This includes (but is not limited to): term rewriting, graph transformation, graph-based implementations of lambda-calculus, programming languages, models of computation, graph-based languages, semantics and implementation of programming languages, compiler construction, pattern recognition, databases, bioinformatics, and system descriptions. * SUBMISSION AND PUBLICATION Authors are invited to submit either regular papers (up to 15 pages), or position papers, system descriptions, work in progress, extended abstracts (5-7 pages), via the EasyChair system, at URL https://www.easychair.org/conferences/?conf=termgraph2013 Submissions should be in PDF format, using the EPTCS style files (http://style.eptcs.org/). The Proceedings will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS). * PROGRAM COMMITTEE Patrick Bahr, University of Copenhagen, Denmark Paolo Baldan, University of Padova, Italy Andrea Corradini, University of Pisa, Italy Frank Drewes, Umea University, Sweden Rachid Echahed (co-chair), CNRS and University of Grenoble, France Maribel Fernandez, King's College London, UK Clemens Grabmayer, Utrecht University, the Netherlands Wolfram Kahl, McMaster University, Canada Ian Mackie, Ecole Polytechnique, France Detlef Plump (co-chair), University of York, UK * ORGANIZERS Rachid Echahed, CNRS and University of Grenoble, France Detlef Plump, University of York, UK 25TH INTERNATIONAL CONFERENCE ON COMPUTER AIDED VERIFICATION (CAV 2013) Call for Papers St. Petersburg, Russia July 13-19, 2013 http://cav2013.forsyte.at/ * SCOPE The conference on Computer Aided Verification (CAV), 2013, is the 25th in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software systems. CAV considers it vital to continue spurring advances in hardware and software verification while expanding to new domains such as biological systems and computer security. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. The proceedings of the conference will be published in the Springer-Verlag Lecture Notes in Computer Science series. A selection of papers will be invited to a special issue of Formal Methods in System Design and the Journal of the ACM. * TOPICS - Algorithms and tools for verifying models and implementations - Hardware verification techniques - Deductive, compositional, and abstraction techniques for verification - Program analysis and software verification - Verification methods for parallel and concurrent hardware/software systems - Testing and runtime analysis based on verification technology - Applications and case studies in verification - Decision procedures and solvers for verification - Mathematical and logical foundations of practical verification tools - Verification in industrial practice - Algorithms and tools for system synthesis - Hybrid systems and embedded systems verification - Verification techniques for security - Formal models and methods for biological systems * IMPORTANT DATES Abstract submission due: January 3, 2013; Paper submission (firm): January 7, 2013 anywhere on earth; Author feedback/rebuttal period: February 20-22, 2013; Notification of acceptance/rejection: March 6, 2013; Final version due: April 6, 2013 24TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION (CADE-24) Call for Papers June 9-14, 2013 Lake Placid, New York, USA http://www.cade-24.info/ * SCOPE CADE is the major forum for the presentation of research in all aspects of automated deduction. The conference program features invited talks, paper presentations, system descriptions, workshops, tutorials, and system competitions, including the CADE ATP System Competition (CASC). CADE-24 invites high-quality submissions on the general topic of automated reasoning, including foundations, applications, implementations and practical experiences. - Logics of interest include: propositional, first-order, equational, classical, higher-order, non-classical, constructive, modal, temporal, many-valued, description, meta-logics, logical frameworks, type theory, set theory, as well as any combination thereof. - Paradigms of interest include: theorem proving, model building, constraint solving, computer algebra, model checking, proof checking, and their integrations. - Methods of interest include: resolution, superposition or paramodulation, completion, saturation, term rewriting, decision procedures and their combinations, model elimination, connection method, inverse method, tableaux, induction, proof planning, sequent calculi, natural deduction, as well as their supporting algorithms and data structures, including unification, matching, orderings, indexing, proof presentation and explanation, and search plans or strategies for inference control, including semantic guidance and AI-related methods. - Applications of interest include: analysis, verification and synthesis of software and hardware, formal methods, computer mathematics, computational logic, declarative programming, knowledge representation, deductive databases, natural language processing, computational linguistics, ontology reasoning, robotics, planning, and other areas of artificial intelligence. * PUBLICATION AND SUBMISSION The proceedings of the conference will be published in the Springer LNAI/LNCS series. Submissions can be made in the categories 'regular paper' (max 15 pages) and 'system description' (max 7 pages). Full system descriptions that provide in-depth presentation of original ideas in an implemented system can be submitted as regular papers. The page for electronic submission via EasyChair is https://www.easychair.org/conferences/?conf=cade24. * IMPORTANT DATES Title and abstract must be submitted before the paper. Abstract submission: 7 January 2013 Paper submission: 14 January 2013 Notification: 11 March 2013 Final version: 1 April 2013 Workshops and Tutorials: 9-10 June 2013 Competitions: 9-14 June 2013 Conference: 11-14 June 2013 * CONFERENCE CO-CHAIRS Christopher A. Lynch Clarkson University Neil V. Murray University at Albany - SUNY * PROGRAM COMMITTEE CHAIR Maria Paola Bonacina Universita degli Studi di Verona * WORKSHOP AND COMPETITION CHAIR Christoph Benzmueller Freie Universitaet Berlin * TUTORIAL CHAIR Peter Baumgartner NICTA and Australian National University * PUBLICITY AND WEB CHAIR Grant Olney Passmore Cambridge University and Edinburgh University * PROGRAM COMMITTEE Alessandro Armando Universita degli Studi di Genova & FBK Trento, Italy Peter Baumgartner NICTA & Australian National University, Australia Christoph Benzmueller Freie Universitaet Berlin, Germany Maria Paola Bonacina Universita degli Studi di Verona, Italy (Chair) Cristina Borralleras Universitat de Vic, Spain Thierry Boy De La Tour Universite de Grenoble, France Evelyne Contejean CNRS & Universite de Paris-Sud, France Leonardo De Moura Microsoft Research, USA Stephanie Delaune Ecole Nationale Superieure de Cachan, France Clare Dixon University of Liverpool, UK Pascal Fontaine Universite de Lorraine & LORIA, France Ulrich Furbach Universitaet Koblenz-Landau, Germany Ruben Gamboa University of Wyoming, USA Juergen Giesl RWTH Aachen, Germany Paul B. Jackson University of Edinburgh, UK Predrag Janicic Univerzitet u Beogradu, Serbia Helene Kirchner INRIA Rocquencourt, France Konstantin Korovin University of Manchester, UK K. Rustan M. Leino Microsoft Research, USA Christopher A. Lynch Clarkson University, USA Cesar A. Munoz NASA Langley, USA Neil V. Murray University at Albany - SUNY , USA Lawrence C. Paulson University of Cambridge, UK Frank Pfenning Carnegie Mellon University, USA Brigitte Pientka McGill University, Canada David A. Plaisted University of North Carolina at Chapel Hill, USA Christophe Ringeissen LORIA & INRIA Nancy-Grand Est, France Ulrike Sattler University of Manchester, UK Renate A. Schmidt University of Manchester, UK Manfred Schmidt-Schauss Johann Wolfgang Goethe Universitaet, Germany Stephan Schulz Technische Universitaet Muenchen, Germany Viorica Sofronie-Stokkermans Universitaet Koblenz-Landau, Germany Ashish Tiwari SRI International, USA Uwe Waldmann MPI fuer Informatik, Germany Christoph Weidenbach MPI fuer Informatik, Germany Jian Zhang Chinese Academy of Sciences, P.R. China 4TH WORKSHOP ON DEVELOPMENTS IN IMPLICIT COMPUTATIONAL COMPLEXITY (DICE 2013) Call for Papers Rome, Italy March 16-17, 2013 (satellite event of ETAPS 2013) http://dice2013.di.unito.it/ * IMPORTANT DATES: submission: January 10, 2013 notification: January 25, 2013 final version due: February 14, 2013 * INVITED - Jean-Yves Marion (Loria - INPL Nancy) - Marko van Eekelen (Open University - Radboud University Nijmegen) - Paul-Andr Mellis (PPS, Paris) * SCOPE The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/ computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity, - programming languages for complexity-bounded computation, - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages). * SUBMISSIONS Authors are invited to submit an extended abstract, up to 5 pages. Abstracts should be written in English, in the form of a PDF file uploaded to DICE 13 page at Easychair https://www.easychair.org/account/signin.cgi?conf=dice2013. Submissions of abstracts by PC members are allowed and encouraged. We plan on not having pre-proceedings; an open call for post-proceedings, hopefully as special issue of a journal, will follow. * PROGRAM COMMITTEE: - Roberto Amadio (Paris-Diderot) - Harry Mairson (Brandeis) - Virgile Mogbil (Paris 13) - Simona Ronchi Della Rocca (Torino) (Chair) - Luca Roversi (Torino) - Olha Shkaravska (Nijmegen) - Ulrich Schpp (LMU) - Aleksy Shubert (Warsaw) - Jakob G. Simonsen (DIKU) 34TH INTERNATIONAL CONFERENCE ON APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY (PETRI NETS 2013) Call for Papers Milano, Italy June 24-28, 2013 http://www.mc3.disco.unimib.it/petrinets2013/ * SCOPE The 34th annual international Petri Net conference will be organised by the Department of Computer Science, Systems and Communication (DISCo), University of Milano - Bicocca. The conference takes place under the auspices of the EATCS, and GI SIG "Petri Nets and Related System Models". The language of the conference is English, and its proceedings will be published by Springer-Verlag in Lecture Notes in Computer Science. All accepted papers will be considered for the "Outstanding Paper" award(s). Papers presenting original research on application or theory of Petri nets, as well as contributions addressing topics relevant to the general field of distributed and concurrent systems are sought. * IMPORTANT DATES Submission of Papers: January 10, 2013 Submission of Tutorial Proposals: January 10, 2013 Notification: March 1, 2013 Final Version Due: April 1, 2013 Participation in Tool Exhibition: June 1, 2013 Workshops & Tutorials: June 24-25, 2013 Conference: June 26-28, 2013 The deadline for submission of papers is STRICT. However, if you submit the title page by January 10 it is sufficient to submit the full paper by January 15. * TOPICS + Topics specific to Petri Nets - System design using nets - Analysis and synthesis, structure and behaviour of nets - Relationships between Petri Nets and other approaches - Net-based semantical, logical and algebraic calculi - Symbolic net representation (graphical or textual) - Computer tools for nets - Experience with using nets, case studies - Higher-level net models - Timed and stochastic nets - Standardisation of nets - Experience reports describing applications of nets to different kinds of systems and application fields, e.g.: - flexible manufacturing systems - office automation - real-time systems - workflows - embedded systems - supervisory control - defence systems - protocols and networks - biological systems - Internet - health and medical systems - e-commerce and trading - environmental systems - programming languages - hardware - performance evaluation - telecommunications - operations research - railway networks + General topics related to concurrency - Model checking and verification of distributed systems - Verification of infinite-state or parametric systems - Causality/partial order theory of concurrency - Educational issues related to concurrency - New issues and developments in the theory of concurrency - Modelling of hardware and biological systems * PAPER SUBMISSIONS Two kinds of papers can be submitted: - regular papers (max 20 pages) describing original results pertaining to the development of the theory of Petri Nets and distributed and concurrent systems in general, new results extending the applicability of Petri Nets, or case studies, application and experience reports pertinent to the practical use of Petri Nets and concurrency. For papers describing the experiences from applications of Petri Nets, authors are encouraged to consult the document: ApplicationFormat.pdf (available at www.informatik.uni-hamburg.de/TGI/sc-info/docs/ApplicationFormat.pdf) - tool papers (max 10 pages) describing a computer tool based on Petri Nets (not an application of the tool or the theory behind the tool). For more information, please see the document: ToolFormat.pdf (available at www.informatik.uni-hamburg.de/TGI/sc-info/docs/ToolFormat.pdf). The tool should be available for use by other groups (but not necessarily for free). The submission should indicate how the reviewers can get access to the tool (this must be for free). The tool will be demonstrated in the Tool Exhibition, in addition to being presented in a conference talk. Submitted papers must: - be contributions that have neither already been published nor are simultaneously being considered for publication in a peer-reviewed forum; - clearly state the problem being addressed, the goal of the work, the results achieved, and the relation to other work; - be in English and in the Springer LNCS-format: http://www.springer.de/comp/lncs/authors.html; - adhere to the page limit for the relevant category (see above); - be sent electronically (as a PDF file) no later than the above mentioned deadlines using the website http://www.easychair.org/conferences/?conf=petrinets2013. * PROGRAM COMMITTEE CO-CHAIRS Jos Manuel Colom, Spain Joerg Desel, Germany * WORKSHOP AND TUTORIAL CO-CHAIRS Serge Haddad, France Alex Yakovlev, UK * ORGANISING COMMITTEE CHAIR Lucia Pomello, Italy * PUBLICITY CHAIRS Luca Bernardinello, Italy Lucia Pomello, Italy * PROGRAM COMMITTEE H. Alla, France M. Beccuti, Italy J. Billington, Australia J. Carmona, Spain G. Ciardo, USA J.M. Colom, Spain (co-chair) P. Darondeau, France J. Desel, Germany (co-chair) R. Devillers, Belgium Z. Duan, China J. Esparza, Germany M.P. Fanti, Italy L. Gomes, Portugal S. Haddad, France H. Hansen, Singapore K. Hiraishi, Japan V. Khomenko, UK E. Kindler, Denmark H. Klaudel, France J. Kleijn, The Netherlands R. Lazic, UK C. Lin, China N. Lohmann, Germany I. Lomazova, Russia A. Miner, USA L. Pomello, Italy W. Reisig, Germany C. Seatzu, Italy C. Stahl, The Netherlands S. Taoka, Japan A. Valmari, Finland M. Westergaard, The Netherlands 7TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING (TASE 2013) Call for Papers Aston University Conference Centre, Birmingham, UK July 1-3, 2013 http://www.aston.ac.uk/tase2013 * OVERVIEW Software engineering is at the heart of many state of the art tools designed to simplify and improve our lives, including cloud computing applications, the semantic web and self-configuring systems. As these instruments are involved in fields of vital importance, by providing customised solutions for education, businesses, government and health care, the role played by the theory behind their working principles bears an undeniable weight. In this context, the TASE International Symposium strives to provide top scientists with a framework for communicating their latest and most valuable theoretical results in the field of software engineering. * SUBJECT AREAS We invite contributions concerning the theoretical aspects of the following areas (please note that this is not an exhaustive list): - model driven software engineering - component based software engineering - service oriented and cloud computing - semantic web and web services - software security, reliability, simulation and verification - probabilistic fundamentals of software engineering - embedded and real time software systems - program logics and underlying mathematical issues - aspect, rule and object oriented software design - self-configuring software systems - reverse engineering * SUBMISSIONS We invite all prospective authors to submit their manuscripts via the TASE13 portal, hosted on Easychair at: https://www.easychair.org/conferences/?conf=tase2013 * IMPORTANT DATES Title and abstract submission: 18 January 2013 Paper submission: 25 January 2013 Acceptance/rejection notification: 22 March 2013 Camera-ready version submission: 26 April 2013 11TH INTERNATIONAL CONFERENCE ON TYPED LAMBDA CALCULI AND APPLICATIONS (TLCA 2013) Call for Papers Eindhoven, 23-28 June 2013 co-located with RTA 2013 as part of RDP 2013 http://www.win.tue.nl/rdp2013/ * SCOPE The 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013) is a forum for original research in the theory and applications of typed lambda calculus, broadly construed. Suggested, but not exclusive, list of topics for submission are: - Proof-theory: natural deduction, sequent calculi, cut elimination and normalization, propositions as types, linear logic and proof nets, type-theoretic aspects of computational complexity - Semantics: denotational semantics, game semantics, realisability, domain theory, categorical models - Types: subtypes, dependent types, polymorphism, intersection types and related approaches, type inference and type checking, types in program analysis and verification, types in proof assistants - Programming: foundational aspects of functional programming, object-oriented programming and other programming paradigms, flow analysis of higher-type computation, program equivalence, program transformation and optimization * IMPORTANT DATES - Paper Registration (titles & short abstracts): 25 January 2013 - Full Paper Submission: 1 February 2013 - Author Notification: 22 March 2013 - Camera-Ready Paper for the Proceedings: 12 April 2013 * SUBMISSION GUIDELINES We solicit submissions of research papers, which must: - be in English and not exceed 15 pages (including figures and bibliography). Additional material intended for the reviewers but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Reviewers will be told that they may choose to ignore the appendix. - present original research which is unpublished and not submitted elsewhere (conferences, journals, books, etc.) - use the Springer-Verlag LNCS style. - be submitted electronically in PDF via the EasyChair TLCA 2013 Submission Webpage (will open nearer the deadline) https://www.easychair.org/conferences/?conf=tlca2013. Submissions deviating from these instructions may be rejected without review. A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. The proceedings will be published as a volume in the ARCoSS subline series of Springer-Verlag Lecture Notes in Computer Science. Final papers will be in the format specified by Springer-Verlag. Any questions regarding the submission guidelines should be directed to the Programme Committee Chair (Masahito Hasegawa
) prior to submitting. * COLOCATED EVENTS TLCA 2013 is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the International Conference on Rewriting Techniques and Applications (RTA 2013) and several related events. Details on workshops affiliated with RDP 2013 will be available at the web site in due course. * CONFERENCE CHAIR Herman Geuvers (Radboud University Nijmegen, Netherlands) * PROGRAMME COMMITTEE CHAIR Masahito Hasegawa (Kyoto University, Japan) * PROGRAMME COMMITTEE Andreas Abel (LMU Munchen, Germany) Patrick Baillot (CNRS and ENS Lyon, France) Nick Benton (Microsoft Cambridge, UK) Lars Birkedal (IT University of Copenhagen, Denmark) Herman Geuvers (Radboud University Nijmegen, Netherlands) Masahito Hasegawa (Kyoto University, Japan) (PC chair) Naoki Kobayashi (University of Tokyo, Japan) Paul-Andre Mellies (CNRS and Universite Paris Diderot, France) Thomas Streicher (TU Darmstadt, Germany) Lorenzo Tortora de Falco (Universita Roma Tre, Italy) Stephanie Weirich (University of Pennsylvania, US) * TLCA PUBLICITY CHAIR Luca Paolini (Universita di Torino, Italy) 7TH INTERNATIONAL CONFERENCE ON TESTS AND PROOFS (TAP 2013) Call for Papers Budapest, Hungary June 17-21, 2013 http://www.spacios.eu/TAP2013 * SCOPE The TAP conference is devoted to the synergy of proofs and tests, to the application of techniques from both sides and their combination for the advancement of software quality. Testing and proving seem to be contradictory techniques: once you have proved your program to be correct then additional testing seems pointless; on the other hand, when such a proof in not feasible, then testing the program seems to be the only option. This view has dominated the research community since the dawn of computer science, and has resulted in distinct communities pursuing the seemingly orthogonal research areas. However, the development of both approaches has lead to the discovery of common issues and to the realization of potential synergy. Perhaps, use of model checking in testing was one of the first signs that a counterexample to a proof may be interpreted as a test case. Recent breakthroughs in deductive techniques such as satisfiability modulo theories, abstract interpretation, and interactive theorem proving, have paved the way for new and practically effective methods of powering testing techniques. Moreover, since formal, proof-based verification is costly, testing invariants and background theories can be helpful to detect errors early and to improve cost effectiveness. Summing up, in the past few years an increasing number of research efforts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to offer. The TAP conference aims to bring together researchers and practitioners working in the converging fields of testing and proving, and will offer a generous allocation of papers, panels and informal discussions. * TOPICS Topics of interest cover theory definitions, tool constructions and experimentations, and include (other topics related to TAP are welcome): - Bridging the gap between concrete and symbolic techniques, e.g. using proof search in satisfiability modulo theories solvers to enhance various testing techniques - Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing - Program proving with the aid of testing techniques - New problematics in automated reasoning emerging from specificities of test generation - Verification and testing techniques combining proofs and tests - Generation of test data, oracles, or preambles by deductive techniques such as: theorem proving, model checking, symbolic execution, constraint logic programming - Model-based testing and verification - Generation of specifications by deduction - Automatic bug finding - Debugging of programs combining static and dynamic analysis - Formal frameworks - Tool descriptions and experience reports - Case studies combining tests and proofs - Domain specific applications of testing and proving to new application domains such as validating security protocols, vulnerability detection of programs, security * IMPORTANT DATES Abstract submission: January 25, 2013 Paper submission: February 1, 2013 Notification: March 3, 2013 Camera ready version: April 5, 2013 TAP conference: June 17-21, 2013 * PROGRAM CHAIRS Margus Veanes (Microsoft Research, USA) Luca Vigano` (University of Verona, Italy) * SUBMISSION Please submit your papers via easychair https://www.easychair.org/conferences/?conf=tap2013 (submission page to be opened in due time) TAP 2013 will accept two types of papers: - Research papers: full papers with at most 16 pages in LNCS format (pdf), which have to be original, unpublished and not submitted elsewhere. - Short contributions: work in progress, (industrial) experience reports or tool demonstrations, position statements; an extended abstract with at most 6 pages in LNCS format (pdf) is expected. Subject to final approval by Springer, accepted papers will be published in the Springer LNCS series and will be available at the conference. The contents of previous TAP proceedings is available at: http://www.informatik.uni-trier.de/~ley/db/conf/tap/ 24TH INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA 2013) Call for Papers June 24 - 26, 2013 Eindhoven, The Netherlands collocated with TLCA 2013 as part of RDP 2013 http://www.win.tue.nl/rdp2013/ * GENERAL The 24th International Conference on Rewriting Techniques and Applications (RTA 2013) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013), and several workshops. RDP 2013 will be held at the Eindhoven University of Technology in the Netherlands. * TOPICS OF INTEREST RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): - Applications: case studies; analysis of cryptographic protocols; rule-based (functional and logic) programming; symbolic and algebraic computation; SMT solving; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; program transformation; XML queries and transformations; systems biology; homotopy theory; implicit computational complexity; - Foundations: equational logic; universal algebra; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; modularity; - Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; constrained rewriting/deduction; categorical and infinitary rewriting; stochastic rewriting; net rewriting; binding techniques; Petri nets; higher-dimensional rewriting; - Implementation: implementation techniques; parallel execution; rewrite and completion tools; certification of rewriting properties; abstract machines; explicit substitutions; automated (non)termination and confluence provers; automated complexity analysis. * PUBLICATION The proceedings of RTA 2013 will be published by LIPIcs (Leibniz International Proceedings in Informatics). LIPIcs is open access, meaning that publications will be available online and free of charge, and authors keep the copyright for their papers. LIPIcs publications are indexed in DBLP. For more information about LIPIcs please consult: <http://www.dagstuhl.de/en/publications/lipics> * SUBMISSION GUIDELINES Submissions must be - original and not submitted for publication elsewhere, - written in English, - a research paper, or a problem set, or a system description, - in pdf prepared with pdflatex using the LIPIcs stylefile: <http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz>, - at most 10 pages for system description, at most 15 pages for the other two types of submissions - submitted electronically through the EasyChair system at: https://www.easychair.org/conferences/?conf=rta2013. The page limit and the deadline for submission are strict. Additional material for instance proof details, may be given in an appendix which is not subject to the page limit. However, submissions must be self-contained within the respective page limit; reading the appendix should not be necessary to assess the merits of a submission. * IMPORTANT DATES abstract submission February 1 2013 paper submission February 5 2013 rebuttal period March 18-21 2013 notification April 4 2013 final version April 26 2013 * PROGRAMME COMMITTEE CHAIR Femke van Raamsdonk (VU University Amsterdam, The Netherlands) * PROGRAMME COMMITTEE *** Eduardo Bonelli, National University of Quilmes Byron Cook, Microsoft Research Cambridge Stephanie Delaune, ENS Cachan Gilles Dowek, Inria Paris-Rocquencourt Maribel Fernandez, King's College London Nao Hirokawa, JAIST Ishikawa Delia Kesner, University Paris-Diderot Helene Kirchner, Inria Paris-Rocquencourt Barbara Koenig, University Duisburg Essen Temur Kutsia, Johannes Kepler University Linz Aart Middeldorp, University of Innsbruck Vincent van Oostrom, Utrecht University Femke van Raamsdonk, VU University Amsterdam Kristoffer Rose, IBM Research New York Manfred Schmidt-Schauss, Goethe University Frankfurt Peter Selinger, Dalhousie University Paula Severi, University of Leicester Aaron Stump, The University of Iowa Tarmo Uustalu, Institute of Cybernetics Tallinn Roel de Vrijer, VU University Amsterdam Johannes Waldmann, HTWK Leipzig Hans Zantema, Eindhoven University of Technology * CONFERENCE CHAIR Hans Zantema (Eindhoven University of Technology, The Netherlands) 5TH INTERNATIONAL CONFERENCE ON ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE (CALCO 2013) Call for Papers Warsaw, Poland September 3 - 6, 2013 http://coalg.org/calco13/ * IMPORTANT DATES Abstract submission: February 22, 2013 Paper submission: March 1, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 * SCOPE CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebra and coalgebra in computer science. It is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009) and Winchester (UK, 2011). The fifth edition will be held in Warsaw, the capital of Poland. * TOPICS OF INTEREST We invite submissions of technical papers that report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. We encourage submissions in topics included or related to those listed below. + Abstract models and logics - Automata and languages - Categorical semantics - Modal logics - Relational systems - Graph transformation - Term rewriting - Adhesive categories + Specialised models and calculi - Hybrid, probabilistic, and timed systems - Calculi and models of concurrent, distributed, mobile, and context-aware computing - General systems theory and computational models (chemical, biological, etc.) + Algebraic and coalgebraic semantics - Abstract data types - Inductive and coinductive methods - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages + System specification and verification - Algebraic and coalgebraic specification - Formal testing and quality assurance - Validation and verification - Generative programming and model-driven development - Models, correctness and (re)configuration of hardware/middleware/architectures, - Process algebra * NEW TOPICS This edition of CALCO will feature two new topics, and submission of papers on these topics is especially encouraged. + Corecursion in Programming Languages - Corecursion in logic / constraint / functional / answer set programming - Corecursive type inference - Coinductive methods for proving program properties - Implementing corecursion - Applications + Algebra and Coalgebra in quantum computing - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra * SUBMISSION GUIDELINES Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Experience papers are welcome, but they must clearly present general lessons learned that would be of interest and benefit to a broad audience of both researchers and practitioners. As with previous editions, the proceedings will be published in the Springer LNCS series. Final papers should be no more than 15 pages long in the format specified by Springer (see http://www.springer.de/comp/lncs/authors.html). It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Proofs omitted due to space limitations may be included in a clearly marked appendix. Both an abstract and the full paper must be submitted by their respective submission deadlines. * BEST PAPER AND BEST PRESENTATION AWARDS For the first time, this edition of CALCO will feature two kinds of awards: a best paper award whose recipients will be selected by the PC before the conference and a best presentation award, elected by the participants. * IMPORTANT DATES Abstract submission: February 22, 2013 Paper submission: March 1, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 * PROGRAMME COMMITTEE Luca Aceto - Reykjavik University, Iceland Jiri Adamek - TU Braunschweig, D Lars Birkedal - IT University of Copenhagen, DK Filippo Bonchi - CNRS, ENS-Lyon, F Corina Cirstea - University of Southhampton, UK Bob Coecke - University of Oxford, UK Andrea Corradini - University of Pisa, I Mai Gehrke - Universit Paris Diderot - Paris 7, F H. Peter Gumm - Philipps University Marburg, D Gopal Gupta - University of Texas at Dallas, USA Ichiro Hasuo - Tokyo University, Japan Reiko Heckel - University of Leicester, UK (cochair) Bart Jacobs - Radboud University Nijmegen, NL Ekaterina Komendantskaya - University of Dundee, Scotland, UK Barbara Knig - University of Duisburg-Essen, D Jos Meseguer - University of Illinois, Urbana-Champaign, USA Marino Miculan - University of Udine, I Stefan Milius - TU Braunschweig, D (cochair) Larry Moss - Indiana University, Bloomington, USA Till Mossakowski - DFKI Lab Bremen and University of Bremen, D Prakash Panangaden - McGill University, Montreal, Canada Dirk Pattinson - Imperial College London, UK Dusko Pavlovic - Royal Holloway, University of London, UK Daniela Petrisan - University of Leicester, UK John Power - University of Bath, UK Jan Rutten - CWI Amsterdam and Radboud University Nijmegen, NL Lutz Schrder - Friedrich-Alexander Universitt Erlangen-Nrnberg, D Monika Seisenberger - Swansea University, UK Sam Staton - University of Cambridge, UK Alexandra Silva - Radboud University Nijmegen and CWI Amsterdam, NL Pawel Sobocinski - University of Southampton, UK Yde Venema - University of Amsterdam, NL Uwe Wolter - University of Bergen, NO * ORGANISING COMMITTEE Bartek Klin (University of Warsaw, Poland) Andrzej Tarlecki (University of Warsaw, Poland) * LOCATION Warsaw, the capital of Poland, is a lively city with many historic monuments and sights, but also with a thriving business district. It is easily accessible via two airports: the main Chopin Airport, used by most international carriers, and the recently open Warsaw Modlin Airport (30 minutes away by rail), used by budget airlines. * SATELLITE WORKSHOPS CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, chaired by Monika Seisenberger (Swansea University). The workshop is dedicated to presentation of work in progress and original research proposals. PhD students and young researchers are particularly encouraged to contribute. A workshop dedicated to tools based on algebraic and/or coalgebraic principles, CALCO Tools, will be held alongside the main conference, chaired by Lutz Schrder (Friedrich Alexander Universitaet Erlangen-Nuernberg). Papers of this workshop will be included in the CALCO proceedings.
Back to the LICS web page.