Newsletter 141 December 6, 2012 ******************************************************************* * Past issues of the newsletter are available at http://lics.siglog.org/newsletters/ * Instructions for submitting an announcement to the newsletter can be found at http://lics.siglog.org/newsletters/inst.html ******************************************************************* TABLE OF CONTENTS * DEADLINES Deadlines in the coming weeks * LICS-RELATED CALLS LICS 2013 - Call for Papers * CALLS FOR PAPERS/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 iFM 2013 - Call for Papers TAMC 2013 - Call for Papers TASE 2013 - Call for Papers CiE 2013 - Call for Papers TLCA 2013 - Call for Papers TAP 2013 - Call for Papers RTA 2013 - Call for Papers SAT 2013 - Call for Papers ASP Competition - Call for Participant Systems FORTE/FMOODS 2013 - Call for Papers LOGICA 2013 - Call for Papers DBSec 2013 - Call for Papers CALCO 2013 - Call for Papers TABLEAUX 2013 - Call for Papers, Tutorials and Workshops FroCoS 2013 - Call for Papers * AWARDS EAPLS PhD Award 2012 - Call for Nominations * JOB ANNOUNCEMENTS Postdoc Positions in Tokyo/Kyoto, Theory of Computation Assistant Professorships at ETH Zurich DEADLINES * 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/ * iFM 2013 Abstract Submission: January 10, 2013 Paper submission: January 17, 2013 http://www.it.abo.fi/iFM2013/ * TAMC 2013 Submission deadline: January 11, 2013 http://www.cs.hku.hk/tamc2013 * TASE 2013 Title and abstract submission: January 18, 2013 Paper submission: January 25, 2013 http://www1.aston.ac.uk/tase2013/ * CiE 2013 Submission Deadline for LNCS: January 20, 2013 http://cie2013.disco.unimib.it * 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/ * SAT 2013 Abstract submission: February 1, 2013 Paper submission: February 8, 2013 http://sat2013.cs.helsinki.fi/ * ASP Competition 2013 Participant registration: February 2, 2013 Participant system submission: March 1, 2013 http://aspcomp2013.mat.unical.it/ * FORTE/FMOODS 2013 Abstracts: February 4, 2013 Papers: February 11, 2013 http://forte13.sosy-lab.org/ * LOGICA 2013 Abstract (2 pages): February 14, 2013 http://www.flu.cas.cz/logica * DBSec 2013 Paper submission: February 15, 2013 http://dbsec2013.business.rutgers.edu/ * CALCO 2013 Abstract Submission: February 22, 2013 Paper Submission: March 1, 2013 http://coalg.org/calco13/ * TABLEAUX 2013 Workshop Proposals: February 22, 2013 Tutorial Proposals: March 23, 2013 Title and Abstract: April 8, 2013 Paper submission deadline: April 15, 2013 http://tableaux13.loria.fr * FroCoS 2013 Abstract submission: April 15, 2013 Paper submission: April 23, 2013 http://frocos2013.loria.fr 28TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2013) Call for Papers June 25-28, 2013 New Orleans, USA http://lics.siglog.org/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 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 10TH INTERNATIONAL CONFERENCE ON INTEGRATED FORMAL METHODS (iFM 2013) Call for Papers Turku, Finland June 10-14, 2013 http://www.it.abo.fi/iFM2013/ * OBJECTIVES AND SCOPE Applying formal methods may involve modeling different aspects of a system which are best expressed using different formalisms. Correspondingly, different analysis techniques may be used to examine different system views, different kinds of properties, or simply in order to cope with the sheer complexity of the system. The iFM conference series seeks to further research into hybrid approaches to formal modeling and analysis; i.e., the combination of (formal and semi-formal) methods for system development, regarding modeling and analysis, and covering all aspects from language design through verification and analysis techniques to tools and their integration into software engineering practice. * TOPICS Areas of interest include but are not limited to: - Formal and semiformal modelling notations; - Integration of formal methods into software engineering practice; - Refinement; - Theorem proving; - Tools; - Logics; - Model checking; - Model transformations; - Semantics; - Static Analysis; - Type Systems; - Verification; - Case Studies; - Experience reports * SUBMISSION GUIDELINES iFM 2013 solicits high quality papers reporting research results and/or experience reports related to the overall theme of method integration. The conference proceedings will be published by Springer Lecture Notes in Computer Science series. All papers must be original, unpublished, and not submitted for publication elsewhere. * INVITED SPEAKERS - Jean-Raymond Abrial, Marseille, France - Cosimo Laneve, University of Bologna, Italy - Susanne Graf, VERIMAG, France - Kim Larsen, Aalborg University, Denmark * SPECIAL ISSUES To celebrate the 10th edition of iFM, special issues of two prominent Springer journals are agreed upon: - Formal Aspects of Computing - Software and Systems Modeling * IMPORTANT DATES - Abstract Submission: January 10, 2013 - Paper submission: January 17, 2013 - Paper notification: March 11, 2013 - Final version paper: March 31, 2013 * iFM PROGRAMME COMMITTEE CHAIRS: - Einar Broch Johnsen, University of Oslo, Norway - Luigia Petre, bo Akademi University, Finland * iFM 2013 ORGANIZING COMMITTEE CHAIR Luigia Petre, bo Akademi University, Finland 10TH ANNUAL CONFERENCE ON THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2013) Call for Papers University of Hong Kong, Pokfulam, Hong Kong May 20-22, 2013 http://www.cs.hku.hk/tamc2013/ * AIMS AND SCOPE TAMC aims at bringing together a wide range of researchers with interests in computational theory and applications. The main themes of the conference are computability, complexity, and algorithms. * TOPICS Typical but not exclusive topics of interest include: - algebraic computation - algorithmic coding theory - algorithmic number theory - approximation algorithms - automata theory - circuit complexity - computability - computational biology, and biological computing - computational complexity - computational game theory - computational logic - computational geometry - continuous and real computation - cryptography - data structures - design and analysis of algorithms - distributed algorithms - fixed parameter tractability - graph algorithms - information and communication complexity - learning theory - natural computation - network algorithms, networks in nature and society - online algorithms - optimization - parallel algorithms - privacy and security - property testing - proof complexity - quantum computing - randomness, pseudo-randomness - randomized algorithms - streaming algorithms * IMPORTANT DATES Submission deadline : 11:59 pm EST January 11, 2013 Notification of authors : late February or early March, 2013 Final versions deadline : to be announced soon * PROCEEDINGS The TAMC proceedings will be published in the Lecture Notes in Computer Science Series by Springer (http://www.springer.com/lncs). Authors of accepted papers are expected to present their work at the conference. * POST CONFERENCE PUBLICATIONS Special issues of the journals Theoretical Computer Science and Mathematical Structures in Computer Science devoted to a selected set of accepted papers of the conference are planned. 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 COMPUTABILITY IN EUROPE (CiE 2013) The Nature of Computation Logic, Algorithms, Applications Call for Papers Milan, Italy July 1-5, 2013 http://cie2013.disco.unimib.it * HISTORY CiE 2013 is the ninth conference organised by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte Dalgada (2010), Sofia (2011) and Cambridge (2012). * IMPORTANT DATES: Submission Deadline for LNCS: 20 January 2013 Notification of authors: 4 March 2013 Deadline for final revisions: 1 April 2013 * The Nature of Computation is meant to emphasize the special focus of CIE13 on the unexpected and strong changes that studies on Nature have brought in several areas of mathematics, physics, and computer science. Starting from Alan Turing, research on Nature with a computational perspective has produced novel contributions, giving rise even to new disciplines. Two complementary research perspectives pervade the Nature of Computation theme. One is focused on the understanding of new computational paradigms inspired by the processes occurring in the biological world, while focusing on a deeper and modern understanding of the theory of computation. The other perspective is on our understanding of how computations really occur in Nature, on how we can interact with those computations, and on their applications. * TOPICS CiE 2013 conference topics include, but not exclusively: - Admissible sets - Algorithms - Analog computation - Artificial intelligence - Automata theory - Bioinformatics - Classical computability and degree structures - Cognitive science and modelling - Complexity classes - Computability theoretic aspects of programs - Computable analysis and real computation - Computable structures and models - Computational and proof complexity - Computational biology - Computational creativity - Computational learning and complexity - Computational linguistics - Concurrency and distributed computation - Constructive mathematics - Cryptographic complexity - Decidability of theories - Derandomization - DNA computing - Domain theory and computability - Dynamical systems and computational models - Effective descriptive set theory - Emerging and Non-standard Models of Computation - Finite model theory - Formal aspects of program analysis - Formal methods - Foundations of computer science - Games - Generalized recursion theory - History of computation - Hybrid systems - Higher type computability - Hypercomputational models - Infinite time Turing machines - Kolmogorov complexity - Lambda and combinatory calculi - L-systems and membrane computation - Machine learning - Mathematical models of emergence - Molecular computation - Morphogenesis and developmental biology - Multi-agent systems - Natural Computation - Neural nets and connectionist models - Philosophy of science and computation - Physics and computability - Probabilistic systems - Process algebras and concurrent systems - Programming language semantics - Proof mining and applications - Proof theory and computability - Proof complexity - Quantum computing and complexity - Randomness - Reducibilities and relative computation - Relativistic computation - Reverse mathematics - Semantics and logic of computation - Swarm intelligence and self-organisation - Type systems and type theory - Uncertain Reasoning - Weak systems of arithmetic and applications We particularly welcome submissions in emergent areas, such as bioinformatics and natural computation, where they have a basic connection with computability. 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) 16TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY TESTING (SAT 2013) Call for Papers Helsinki, Finland July 8-12, 2013 http://sat2013.cs.helsinki.fi/ * AIMS The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the primary annual meeting for researchers studying the theory and applications of the propositional satisfiability problem, broadly construed. Besides plain propositional satisfiability, it includes Boolean optimization (including MaxSAT and Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning. The SAT conference aims to further advance the field by soliciting original theoretical and practical contributions in these areas with a clear connection to satisfiability. * DEADLINES Abstract submission: February 1, 2013 Paper submission: February 8, 2013 * TOPICS Topics include (but are not restricted to) - Theoretical advances (including exact algorithms, proof complexity, and other complexity issues); - Practical search algorithms; - Knowledge compilation; - Implementation-level details of SAT solving tools and SAT-based systems; - Problem encodings and reformulations; - Applications (including both novel applications domains and improvements to existing approaches); - Case studies and reports on insightful findings based on rigorous experimentation. * SUBMISSIONS Submissions are solicited in three paper categories: - REGULAR PAPERS (9 to 15 pages, excluding references) - SHORT PAPERS (up to 8 pages, excluding references) - TOOL PAPERS (up to 6 pages, excluding references) All accepted papers will be published in the proceedings of the conference, which will be published within the Springer LNCS series. * PROGRAM CHAIRS Matti Jarvisalo University of Helsinki, Finland Allen Van Gelder University of California at Santa Cruz, USA * PROGRAM COMMITTEE Visit http://sat2013.cs.helsinki.fi/ for details. 4TH OPEN ANSWER SET PROGRAMMING COMPETITION (ASP Competition 2013) Call for Participant Systems University of Calabria - Vienna University of Technology Fall/Winter 2012/2013 http://aspcomp2013.mat.unical.it/ * SCOPE The event is open to ASP systems and ANY OTHER system based on a declarative specification paradigm. * CONTEST Participants of the Answer Set Programming Competition will compete on a selected collection of benchmark problems, taken from a variety of benchmark problem domains as well as real world applications. These include, but are not limited to: - Classic and applicative graph problems - Scheduling, Timetabling, and other resource allocation problems - Sequential and Temporal Planning - Combinatorial Optimization Problems - Deductive database tasks on large data-sets - Puzzles and Combinatorics - Ontology reasoning - Automated Theorem Proving and Model Checking - Reasoning tasks over large propositional instances - Constraint Programming problems - Other AI problems * TRACKS The competition consists of two independent main tracks: - the Model & Solve Track invites any researcher and developer of declarative knowledge representation systems to participate in an open challenge for solving sophisticated AI problems with their tools of choice. Participants submit a solver based on an arbitrary input format and declarative specifications of the Competition's benchmark domains; - the System Track compares dedicated answer set solvers on ASP benchmarks. Participants compete with a solver for a standard ASP language. We encourage to submit parallel and portfolio systems exploiting multiple cores or multiple algorithms for solving the given instances. * HISTORY Answer Set Programming is a well-established paradigm of declarative programming with close relationship to other declarative modelling paradigms and languages, such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL, CASC, and many others. The ASP Competition is a biannual event for evaluating declarative knowledge representation systems on hard and demanding AI problems. The 4th ASP Competition will be run in the first half of 2013 jointly at the University of Calabria (Italy) and the Vienna University of Technology (Austria). The event is the sequel to the ASP Competition series, held at the University of Potsdam (Germany) in 2006-2007, at the University of Leuven (Belgium) in 2009, and at University of Calabria (Italy) in 2011. The current competition takes place in cooperation with the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), where the results will be announced. * GOALS The ASP competition is held as an open tournament. The "Model & Solve" competition track fosters the spirit of integration among communities, and is thus open to all types of solvers: ASP systems, SAT solvers, SMT solvers, CP systems, FOL theorem provers, Description Logics reasoners, planning reasoners, or any other. The "System" competition track is instead set up on a fixed language based on the answer set semantics. * IMPORTANT DATES - February 2nd, 2013: Participant registration deadline - March 1st, 2013: Participant system submission deadline - March 2nd, 2013: System freeze, the competition runs - September 15-19, 2013: Announcement of results and award presentation at LPNMR 2013 in Corunna, Spain For further information and submission instructions please visit the competition web site http://aspcomp2013.mat.unical.it/ or contact us by email: firstname.lastname@example.org IFIP INTERNATIONAL CONFERENCE ON FORMAL TECHNIQUES FOR DISTRIBUTED SYSTEMS (FORTE/FMOODS 2013) Call for Papers Florence, Italy June 3-6, 2013 http://forte13.sosy-lab.org/ * OBJECTIVES AND SCOPES The 2013 IFIP Joint International Conference on Formal Techniques for Distributed Systems (33rd FORTE / 15th FMOODS) is a forum for fundamental research on theory, models, tools, and applications for distributed systems. The joint conference is the result of merging the conference FMOODS (Formal Methods for Open Object-Based Distributed Systems) and FORTE (Formal Techniques for Networked and Distributed Systems). FORTE/FMOODS 2013 is part of the DiScoTec 2013 event (see http://www.discotec.org/). * SUBMISSIONS The conference solicits original contributions that advance the science and technologies for distributed systems, with special interest in the areas of: - component- and model-based design - object technology, modularity, software adaptation - service-oriented, ubiquitous, pervasive, grid, cloud, and mobile computing systems - product-line-based systems - software quality, reliability, availability, and safety - security, privacy, and trust in distributed systems - adaptive distributed systems, self-stabilization, self-healing/organizing - verification, validation, formal analysis, and testing of the above. The conference encourages contributions that combine theory and practice and that exploit formal methods and theoretical foundations to present novel solutions to problems arising from the development of distributed systems. FORTE / FMOODS covers distributed computing models and formal specification, testing and verification methods. The application domains include all kinds of application-level distributed systems, telecommunication services, Internet, embedded and real time systems, as well as networking and communication security and reliability. * TOPICS Topics of interest include but are not limited to: - Languages and Semantic Foundations: new modeling and language concepts for distribution and concurrency, semantics for different types of languages, including programming languages, modeling languages, and domain specific languages; real-time and probability aspects; type systems and behavioral typing; - Formal Methods and Techniques: design, specification, analysis, verification, validation, testing and runtime verification of various types of distributed systems including communications and network protocols, service-oriented systems, and adaptive distributed systems; - Foundations of Security: new principles for qualitative and quantitative security analysis of distributed systems, including formal models based on probabilistic concepts; - Applications of Formal Methods: applying formal methods and techniques for studying quality, reliability, availability, and safety of distributed systems; - Practical Experience with Formal Methods: industrial applications, case studies and software tools for applying formal methods and description techniques to the development and analysis of real distributed systems. * PUBLICATION AND SUBMISSIONS The FORTE/FMOODS 2013 conference calls for high-quality papers presenting research results and/or application reports related to the research areas in conference scope. All papers must be original, unpublished, and not submitted for publication elsewhere. Contributions should be submitted electronically in PDF via the EasyChair system at the following address: http://forte13.sosy-lab.org/submit.php Each paper will undergo a peer review of at least 3 anonymous reviewers. The papers must be prepared using Springer's LNCS style (see http://www.springer.de/comp/lncs/authors.html). Papers must not exceed 15 pages in length, including figures and references. * IMPORTANT DATES Title and abstract must be submitted before the paper. Time of all deadlines is 24:00 Samoa Standard Time (UTC-11). Abstracts February 4, 2013 Papers February 11, 2013 Notification March 18, 2013 Camera-Ready March 25, 2013 Conference June 3-6, 2013 * PROGRAM COMMITTEE CO-CHAIRS - Dirk Beyer, Faculty of Computer Science and Mathematics University of Passau, Germany - Michele Boreale, Dipartimento di Statistica, Informatica, Applicazioni University of Florence, Italy * DETAILS http://forte13.sosy-lab.org/ 27TH ANNUAL INTERNATIONAL SYMPOSIUM ON LOGIC (LOGICA 2013) Call for papers Hejnice, Czech Republic June 17Ğ21, 2013 http://www.flu.cas.cz/logica * CONTRIBUTIONS Contributions devoted to any of the wide range of logical problems are welcome except those focused on specialized technical applications. Particularly welcome are contributions that cover issues interesting both for 'philosophically' and for 'mathematically' oriented logicians. * IMPORTANT DATES - 14 February 2013: Deadline for submissions (2 page abstract) - 31 March 2013: Notification of acceptance * INVITED SPEAKERS Johan van Benthem, Michael Dunn, Volker Halbach and Michiel van Lambalgen * PROGRAM COMMITTEE Theodora Achourioti, Petr Cintula, Kosta Dosen, Marie Duzi, Christian Fermueller, Gary Kemp, Vojtech Kolman, Peter Milne, Jaroslav Peregrin, Hans Rott, Gabriel Sandu, Sebastian Sequoiah-Grayson, Sonja Smets * DETAILS Detailed information can be found on the webpage. 27TH ANNUAL IFIP WG 11.3 WORKING CONFERENCE ON DATA AND APPLICATIONS SECURITY AND PRIVACY (DBSec 2013) Call for Papers Newark, NJ, USA July 15-17, 2013 http://dbsec2013.business.rutgers.edu/ * GOALS The 27th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy provides a forum for presenting original unpublished research results, practical experiences, and innovative ideas in data and applications security. Both papers and panel proposals are also solicited. Proceedings will be published by Springer as the next volume in the Research Advances in Database and Information Systems Security series (http://www.springeronline.com/lncs). * SUBMISSIONS Papers may present theory, techniques, applications, or practical experience on topics of relevance to IFIP WG 11.3: Access Control; Applied cryptography in data security; Identity theft and countermeasures; Integrity maintenance; Intrusion detection; Knowledge discovery and privacy; Logics for security and privacy; Organizational security; Privacy-preserving data management; Secure transaction processing; Secure information integration; Secure Semantic Web; Secure sensor monitoring; Secure Web Services; Threats, vulnerabilities, and risk management; Trust management. Additional topics of interest include (but are not limited to): Critical Infrastructure Protection, Cyber Terrorism, Information Warfare, Database Forensics, Electronic Commerce Security, and Security in Digital Health Care. * IMPROTANT DATES Paper submission: 15 Feb 2013; Notification: 19 Apr 2013; Final papers due: 3 May 2013. 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. 22ND CONFERENCE ON AUTOMATED REASONING WITH TABLEAUX AND RELATED METHODS (TABLEAUX 2013) Call for Papers, Tutorials and Workshops Nancy, France September 16-19, 2013 http://tableaux13.loria.fr co-located with FroCoS 2013 * SCOPE Tableaux methods offer a convenient set of formalisms for automating deduction in various non-standard logics as well as in classical logic. Areas of application include verification of software and computer systems, data integration and data access, deductive databases, knowledge representation and its required inference engines, and system diagnosis. The conference intends to bring together researchers interested in all aspects - theoretical foundations, implementation techniques, system developments and applications - of the mechanization of reasoning with tableaux and related methods. Topics of interest include (but are not restricted to): - proof-theory in classical and non-classical logics (modal, temporal, description, intuitionistic, substructural, ...) - analytic tableaux for various logics (theory and applications) - related techniques and concepts, e.g., model checking and BDDs - related methods (model elimination, sequent calculi, connection method, resolution, ...) - new calculi and methods for theorem proving and verification in classical and non-classical logics - systems, tools, implementations and applications (provers, logical frameworks, model checkers, ...) - automated deduction and formal methods applied to logic, mathematics, software development, protocol verification, security, ... * IMPORTANT DATES: - WORKSHOPS: Workshop submission deadline: February 22, 2013 Notification of acceptance: March 8, 2013 - TUTORIALS: Proposal submission deadline: March 23, 2013 Notification of acceptance: April 5, 2013 - CONFERENCE PAPERS: Title and Abstract submission deadline: April 8, 2013 Paper submission deadline: April 15, 2013 * Detailed information can be found on the webpage. 9TH SYMPOSIUM ON FRONTIERS OF COMBINING SYSTEMS (FroCoS 2013) Call for Papers Nancy, France September 18-20, 2013, http://frocos2013.loria.fr co-located with TABLEAUX 2013 * AIMS The aim of the conference is to publish and promote progress in research areas requiring the development of general techniques and methods for the combination and integration of special, formally defined systems, as well as for the analysis and modularization of complex systems. * TOPICS Typical topics of interest include (but are not limited to): combinations of logics such as combined higher-order, first-order, temporal, modal, or other non-classical logics; combinations and modularity in ontologies; combination of decision procedures, of satisfiability procedures, of constraint solving techniques or of logical frameworks; combination and integration methods in SAT and SMT solving; combinations and modularity in term rewriting; integration of equational and other theories into deductive systems; combination of deduction systems and computer algebra; integration of data structures into constraint logic programming and deduction; hybrid methods for deduction, resolution and constraint propagation; hybrid systems in knowledge representation and natural language semantics; combined logics for distributed and multi-agent systems; logical aspects of combining and modularizing programs and specifications. * IMPORTANT DATES Abstract submission: 15 Apr 2013 Paper submission: 22 Apr 2013 EAPLS PHD AWARD 2012 Call for Nominations http://eapls.org/pages/phd_award/ * GENERAL The European Association for Programming Languages and Systems has established a Best Dissertation Award in the international research area of programming languages and systems. The award will go to the PhD student who in the previous period has made the most original and influential contribution to the area. The purpose of the award is to draw attention to excellent work, to help the career of the student in question, and to promote the research field as a whole. * ELIGIBILITY Eligible for the award are those who successfully defended their PhD - at an academic institution in Europe - in the field of Programming Languages and Systems - in the period from 1 November 2011 Ğ 1 November 2012 * NOMINATIONS Candidates for the award must be nominated by their supervisor. Nominating a candidate consists of submitting the thesis to http://www.easychair.org/conferences/?conf=eaplsphd2012. The nomination must be accompanied by (a zip file containing) - a letter from the supervisor describing why the thesis should be considered for the award; - a report from an independent researcher who has acted as examiner of the thesis at its defense. The theses will be evaluated with respect to originality, influence, relevance to the field and (to a lesser degree) quality of writing. * PROCEDURE The nominations will be evaluated and compared by an international committee of experts from across Europe. The procedure to be followed is analogous to the review phase of a conference. The justification by the supervisor and the external report will play an important role in the evaluation. Members of the expert committee are barred from nominating their own PhD students for the award. The award consists of a certificate announcing the winner to have received the EAPLS PhD award 2012. The supervisor will receive a copy of this certificate. If possible, the certificate will be handed out ceremonially at a suitable occasion, as for instance the ETAPS conference. Apart from the winner, no further ranking of nominees will be published. The decision of the expert committee is final and binding, and will not be subject to discussion. * IMPORTANT DATES 31 December 2012: Deadline for nominations 21 March 2013: Announcement of the award winner * EXPERT COMMITTEE The Expert committee consists of the following members: - Mark van den Brand, Universiteit Eindhoven, The Netherlands - Giorgio Ghelli, University of Pisa, Italy - Paul Klint, CWI and University of Amsterdam, The Netherlands - Jens Knoop, Technische Universitt Wien, Austria - Greg Michaelson, Heriot-Watt University , Edinburgh, U.K. - Arend Rensink, Universiteit Twente, The Netherlands - Peter Van Roy, Universit Catholique de Louvain, Belgium Further members will be confirmed shortly. POST-DOCTORAL POSITIONS, TOKYO/KYOTO, THEORY OF COMPUTATION http://www.al.ics.saitama-u.ac.jp/elc/en/?pd * The newly established Center for Exploring the Limits of Computation (CELC, Tokyo, Japan) seeks applications for four post-doctoral fellow positions in Computational Complexity Theory and related areas. The appointments are for two years starting in April 2013 (or as soon as possible). A monthly salary of approximately 350,000 Japanese yen plus a research allowance will be offered. Applicants should hold a PhD in theoretical computer science or related fields (or be expected to do so by July 2013). * Two of the fellows will be based at the Tokyo site (Tokyo Institute of Technology and the CELC) and two at the Kyoto site (Kyoto University). Collaboration with other research groups of the ELC project (including visits for several months) will be encouraged and supported. Applications should include - a curriculum vitae, - list of publications, - a research statement, and - three letters of referees (to be sent directly from the referees). * Applications and letters of referees should be sent via email to email@example.com. Priority will be given to applications received by December 20, 2012. Applicants may be invited to an interview in early 2013 (the travel expenses will be covered). ASSISTANT PROFESSORSHIPS (TENURE TRACK) IN COMPUTER SCIENCE http://www.facultyaffairs.ethz.ch/facultypositions/ap_computerscience * The Department of Computer Science (http://www.inf.ethz.ch) at ETH Zurich invites applications for assistant professorships (Tenure Track) in the areas of: - Computer Systems - Software Engineering (including programming languages) - Information Systems (with emphasis on Big Data) For candidates with exceptional research accomplishments also applications for a full professorship will be considered. * The department offers a stimulating and well-supported research and teaching environment. Collaboration in research and teaching is expected both within the department and with other groups of ETH Zurich and related institutions. * Applicants should have internationally recognized expertise in their field and pursue research at the forefront of Computer Science. Successful candidates should establish and lead a strong research program. They will be expected to supervise Ph.D. students and teach both undergraduate level courses (in German or English) and graduate level courses (in English). * Assistant professorships have been established to promote the careers of younger scientists. The initial appointment is for four years with the possibility of renewal for an additional two-year period and promotion to a permanent position. * Your application should include your curriculum vitae, a list of publications, a statement of research and teaching interests and the names of at least three referees. The letter of application should be addressed to the President of ETH Zurich, Prof. Dr. Ralph Eichler. The closing date for applications is 15 January 2013. ETH Zurich is an equal opportunity and affirmative action employer. In order to increase the number of women in leading academic positions, we specifically encourage women to apply. ETH Zurich is further responsive to the needs of dual career couples and qualifies as a family friendly employer. Please apply online: http://www.facultyaffairs.ethz.ch/facultypositions/ap_computerscience
Back to the LICS web page.