[FOM] [LICS] LICS Newsletter 139

Andrzej Murawski martin at eipye.com
Wed Oct 3 21:19:29 EDT 2012


Newsletter 139
October 3, 2012

*******************************************************************
* Past issues of the newsletter are available at
  http://www.informatik.hu-berlin.de/lics/newsletters/
* Instructions for submitting an announcement to the newsletter
  can be found at
  http://informatik.hu-berlin.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
   FOSSACS 2013 - Call for Papers
   SAT 2013 - Call for Workshops, Competitions and Tutorials
   CADE-24 - Call for Workshops, Tutorials and System Competitions
   CADE-24 - Call for Papers
   LATA 2013 - Call for Papers
   PETRI NETS 2013 - Call for Papers
   TLCA 2013 - Call for Papers
   RTA 2013 - Call for Papers
   CALCO 2013 - Call for Papers
* CALLS FOR PARTICIPATION
   FMCAD 2012 - Call for Participation
* BOOK ANNOUNCEMENTS
   Programming with Higher-Order Logic
   Scientific Freedom and Human Rights
* JOB ANNOUNCEMENTS
   Postdoc in Automated Reasoning in Verona
   PhD Positions at the University of Luxembourg



DEADLINES
* FOSSACS 2013
   Abstract submission: October 7, 2012
   Paper submission: October 14, 2012
   http://www.etaps.org/2013/fossacs13
* SAT 2013
   Proposal submission: November 2, 2012 (negotiable)
   http://sat2013.cs.helsinki.fi/
* CADE-24
   Proposal submission: November 9, 2012
   Abstract submission: 7 January 2013
   Paper submission: 14 January 2013
   http://www.cade-24.info/
* LATA 2013
   Paper submission: November 9, 2012
   http://grammars.grlmc.com/LATA2013/
* LICS 2013
   Workshop Proposals: November 26, 2012
   Title & Short Abstracts: January 7, 2013
   Extended Abstracts: January 14, 2013
   http://informatik.hu-berlin.de/lics/lics13/
* PETRI NETS 2013
   Submission of Papers: January 10, 2013
   Submission of Tutorial Proposals: January 10, 2013
   http://www.mc3.disco.unimib.it/petrinets2013/
* TLCA 2013
   Paper Registration (titles & short abstracts): January 25, 2013
   Full Paper Submission: 1 February 2013
   http://www.win.tue.nl/rdp2013/
* 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


16TH INTERNATIONAL CONFERENCE ON FOUNDATIONS OF SOFTWARE SCIENCE AND
COMPUTATION STRUCTURES (FOSSACS 2013)
   Call for Papers
   Affiliated with ETAPS'13
   March 16-24, 2013,
   Rome, Italy
   http://www.etaps.org/2013/fossacs13
* SCOPE
   FoSSaCS is an annual conference seeking original papers on
   foundational research with a clear significance for software science.
   The conference invites submissions on theories and methods to support
   the analysis, integration, synthesis, transformaton, and verification
   of programs and software systems.
* IMPORTANT DATES
   7 October 2012: Abstract submission
   14 October 2012: Paper submission
   6-7 December 2012: Author response period
   14 December 2012: Author notification
   8 January 2013: Final versions of accepted papers
* SUBMISSION
   15 pages in LNCS format via EasyChair at
   https://www.easychair.org/conferences/?conf=fossacs2013
   For details, consult http://www.etaps.org/2013/important-dates13
* TOPICS
   - Categorical models and logics
   - Language theory, automata, and games
   - Modal, spatial, and temporal logics
   - Type theory and proof theory
   - Concurrency theory
   - Rewriting theory
   - Semantics of programming languages
   - Program analysis, correctness, transformation, and verification
   - Logics of programming
   - Software specification and refinement
   - Models of concurrent, reactive, stochastic, distributed, hybrid,
and mobile systems
   - Process calculi
   - Emerging models of computation
   - Logical aspects of computational complexity
   - Fundamentals of software security
   - Logical foundations of databases
* PROGRAM COMMITTEE
   Andreas Abel (LMU Munich, Germany)
   Umut Acar (Max Planck Institute for Software Systems, Germany)
   Jiri Adamek (Techn. Univ. of Braunschweig, Germany)
   Rajeev Alur (University of Pennsylvania, USA)
   Eugene Asarin (Universite Paris Diderot, France)
   Nick Benton (MSR Cambridge, UK)
   Krishnendu Chatterjee (IST Austria)
   Swarat Chaudhuri (Rice University, USA)
   Adam Chlipala (MIT, USA)
   Ugo Dal Lago (University of Bologna, Italy)
   Giorgio Delzanno (University of Genova, Italy)
   Dan Ghica (University of Birmingham, UK)
   Jean Goubault-Larrecq (ENS Cachan, France)
   Bart Jacobs (Radboud Univ. of Nijmegen, Netherlands)
   Radha Jagadeesan (DePaul University, Chicago, USA)
   Patricia Johann (University of Strathclyde, Glasgow, UK)
   Naoki Kobayashi (Tohoku University, Japan)
   Stephane Lengrand (Ecole Polytechnique, France)
   Aart Middeldorp (University of Innsbruck, Austria)
   Catuscia Palamidessi (INRIA Saclay and LIX, France)
   Frank Pfenning, Chair (Carnegie Mellon University, USA)
   Ashish Tiwari (SRI International, Menlo Park, USA)
   Pawel Urzyczyn (University of Warsaw, Poland)
   Kwangkeun Yi (Seoul National University, Korea)


16TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF
SATISFIABILITY TESTING (SAT 2013)
   Call for Workshops, Competitions and Tutorials
   Helsinki, Finland,
   July 8-12, 2013
   http://sat2013.cs.helsinki.fi/
* PROPOSAL SUBMISSION DEADLINE
   November 2, 2012 (negotiable)
* SUBMISSION
   Proposals should be submitted by email to sat2013 at easychair.org, either in
   ASCII text or as an attachment in PDF form, and should include
   in sufficient detail the information outlined at
   http://sat2013.cs.helsinki.fi/calls.html
   Proposals with incomplete information may be submitted, in case the deadline
   is a bit early.  Please indicate in your proposal a plan and/or schedule
   for getting the remaining information.
* CALL FOR WORKSHOPS
   Workshop proposals for SAT 2013 are solicited.  Both well-established
   workshops, possible previously affiliated with other venues, and newer
   ones are encouraged.  Similarly, proposals for workshops with a tight
   focus on a core area within SAT, ranging from theory to applications,
   as well as those with a broader focus on SAT and related formalisms and
   paradigms, are very welcome.
* CALL FOR SOLVER COMPETITIONS
   Solver competitions for SAT solvers and their extensions
   are a traditional part of the SAT conferences.
   For SAT 2013, proposals for solver competitions are solicited openly.
   The goal is to foster the development of both core SAT solvers as well as
   their extensions (including, but not restricted to structural SAT solving,
   MaxSAT, MUS computation, QBF, SMT, etc) and SAT-based systems for important
   application domains.
* CALL FOR TUTORIALS
   As a new development for 2013, tutorial 
proposals for SAT 2013 are solicited.
   Tutorials are expected to be 1-2 hours long, although other durations will
   be considered.  The tutorial may have a theoretical or applied focus,
   on a topic of interest for SAT 2013, broadly construed.
   All accepted tutorials will be scheduled to take place during the main
   conference.
* Should you have any questions regarding these calls, please contact us
   via email using sat2013 at easychair.org .
* SAT 2013 Program Committee Chairs
   Matti Jarvisalo        University of Helsinki
   Allen Van Gelder       University of California at Santa Cruz


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


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


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 9, 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


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


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 <hassei at kurims.kyoto-u.ac.jp>) 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)


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 König - 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 Schröder - Friedrich-Alexander Universität Erlangen-Nürnberg, 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 Schröder (Friedrich Alexander Universitaet
   Erlangen-Nuernberg). Papers of this workshop will be included in the
   CALCO proceedings.



FORMAL METHODS IN COMPUTER-AIDED DESIGN (FMCAD'12)
   Call for Participation
   Cambridge, UK, October 22-25, 2012
   http://www.cs.utexas.edu/~hunt/FMCAD/FMCAD12/
* PROGRAMME
   FMCAD'12 takes place from October 22 through 25 at Microsoft
Research Cambridge, UK
   Beside presentations of 25 accepted papers, we have
   - A keynote by Turing Award Winner Tony Hoare (Microsoft)
     on "Algebra of Concurrent Design"
   - An industrial panel organized by Maher Mneimneh (Atrenta),
     on "Model Checking in the Cloud"
   - The fifth Hardware Model Checking Competition (HWMCC'12),
     organized by Armin Biere (Johannes Kepler University Linz)
   - and last but not least four tutorials, organized by Rolf Drechsler
(University
     of Bremen), presented by:
     Jasmin Fisher (Microsoft), on "From Theory to Lab Experiments by Formal
     Verification"
     Torsten Schaub (University of Potsdam), on "Answer Set Programming"
     Eric Feron (Georgia Tech), on "Formal Methods in Avionics"
     Alessandro Cimatti (Fondazione Bruno Kessler) on "Application of
SMT Solvers to
     Hybrid System Verification"
* PROGRAM CO-CHAIRS
   Gianpiero Cabodi (Politecnico di Torino, 
Italy) and Satnam Singh (Google, USA)



PROGRAMMING WITH HIGHER-ORDER LOGIC
   by Dale Miller (INRIA & LIX/Ecole Polytechnique) and
   Gopalan Nadathur (University of Minnesota)
   Cambridge University Press,
   ISBN: 9780521879408, 320 pages
   http://www.cambridge.org/fr/knowledge/isbn/item6687740
* The book argues for using higher-order intuitionistic logic as the
   foundations of logic programming. In elaborating this argument, the book
   presents a sequent calculus based characterization of logic programming; a
   proof search approach to computation; higher-order logic programming;
   polymorphic typing; modular programming and abstract data types; and
   simply-typed lambda-terms and their unification.
* The book also emphasizes the practical application of higher-order
   logic programming by showing that it can be used to provide elegant
   formalizations and implementations of computations that manipulate
   bindings in syntax.  In addition to a general exposition of this
   approach, individual chapters present extended examples relating to
   implementing proof systems, computing with functional programs, and
   encoding the pi-calculus.
* The lambda Prolog language is used to illustrate the underlying
   computation-related ideas and their applications. The website for the
   book provides all the lambda Prolog code used in the book. The reader
   can experiment with this code using the Teyjus compiler available from
   http://teyjus.cs.umn.edu/.
* Additional information appears at https://sites.google.com/site/proghol/.


SCIENTIFIC FREEDOM & HUMAN RIGHTS
   Scientists of Conscience During the Cold War
   by Jack Minker
   IEEE Computer Society Press
   http://bit.ly/KekMn5
* There is a great deal of difference between feeling empathy for
   those whose human rights are being violated around the world and
   actually doing something about it. This memoir, written by the
   Vice-Chair Computer Science (CS) of the Committee of Concerned
   Scientists (CCS) 1962-present and vice-chair of the Committee
   on Scientific Freedom and Human Rights (CSFHR) of the ACM,
   1980-1989, is a first-hand account of computer scientists working
   with numerous other constituencies to safeguard or advance the
   human rights of scientists throughout the world. Drawing from the
   author’s considerable archives from the period, Scientific
   Freedom and Human Rights is a treasure trove of historical
   information about a critical — and relatively unsung—human rights
   campaign, its successes and heartbreaking challenges, and possible
   lessons to be applied to future human rights campaigns.
* Jack Minker is Professor Emeritus, Computer Science (CS), at the
   University of Maryland. He is a leading authority in artificial
   intelligence, deductive databases, logic programming, and
   nonmonotonic reasoning as well as an internationally recognized
   leader in the field of human rights of scientists.



POSTDOC IN AUTOMATED REASONING AT UNIVERSITA DEGLI STUDI DI VERONA
   The Department of Computer Science of the Universita degli Studi di
   Verona, in beautiful Verona, Italy, has one opening for a University
   funded, full-time on research, post-doc position in Automated Reasoning
   (automated deduction, theorem proving, model building, SMT-solving)
   applied to program analysis. The position is for one year (12 months)
   and is renewable. Recent Ph.D. graduates or Ph.D. students very close to
   graduation in Computer Science or related field with a thesis in
   automated reasoning or neighbor topics are kindly invited to apply. More
   experienced applicants with a few years of postdoc experience are also
   very welcome. Applications (with Curriculum Vitae, research statement,
   and at least three names and addresses of references) or inquiries can
   be sent by e-mail (mariapaola.bonacina (at) univr.it) to Prof. Maria Paola
   Bonacina, Dipartimento di Informatica, Universita degli Studi di Verona.
   Applications will be considered as soon as received.

PHD POSITIONS AT THE UNIVERSITY OF LUXEMBOURG
   The University of Luxembourg has two open Ph.D. positions at its
   Interdisciplinary Centre for Security, Reliability and Trust (SnT)
   (http://wwwen.uni.lu/snt). We are seeking Ph.D. candidates to
   participate in the activities of the SaToSS
   (http://satoss.uni.lu/) and of the ApSIA (http://apsia.gforge.uni.lu/)
   research groups.
* Project description:
   The main objective of the Ph.D. project is to develop a formal
   framework supporting modeling and analysis of socio-technical
   components of information systems. We aim to develop strategies and
   tools to detect and prevent attacks involving human, physical and
   digital elements. One of the goals is to extend current methodology
   for security protocol analysis, by taking human behavior and
   properties of physical objects into account. This goal includes a
   necessity of defining appropriate adversary models and identifying the
   security properties relevant in a socio-technical context.
* Research environment:
   Both Ph.D. students will collaborate with the research groups SaToSS
   (Security and Trust of Software Systems) led by Prof. Dr. S. Mauw and
   APSIA (Applied Security and Information Assurance) led by Prof. Dr.
   P.Y.A. Ryan. This position is part of a national research project
   "Socio-Technical Analysis of Security and Trust" funded by the
   National Research Fund in Luxembourg. The University of Luxembourg
   offers a three years appointment (extension up to 4 years in total is
   possible) in an international and multicultural environment. The
   University is an equal opportunity employer.
* Applicant's profile:
   - MSc in Computer Science or Mathematics
   - A proven interest in security
   - Strong background in formal methods or logics
   - Good written and oral English skills
* START DATE
   As soon as possible
* APPLICATIONS
   Applications, written in English, should be submitted electronically
   via the University of Luxembourg's recruitment portal
   http://emea3.mrted.ly/2oja
* Applications should include:
   - Curriculum Vitae (including your contact address, work experience
     and list of publications)
   - Cover letter explaining your motivation
   - Transcript of all courses and grades for your Bachelor and Master
     program
   - A short description of your Master's work (max 1 page)
   - Contact information for at least one referee
* DEADLINE
   October 15th, 2012
* CONTACT
   For further inquiries please contact:
   Prof. Dr. Sjouke Mauw (sjouke.mauw at uni.lu),
   Prof. Dr. Peter Ryan (peter.ryan at uni.lu),
   Dr. Barbara Kordy (barbara.kordy at uni.lu), or
   Dr. Gabriele Lenzini (gabriele.lenzini at uni.lu)

You are subscribed to the lics mailing list 
because you have signed up for it in the past.

Submissions to the newsletter:
Send an email to las-lics at lists.tu-berlin.de 
(moderated) or lics at informatik.hu-berlin.de.

Unsubscribe:
To unsubscribe, please send an email to 
las-lics-request at lists.tu-berlin.de with
the keyword 'unsubscribe' in the message body (without ').

Subscribe:
To subscribe,  please send an email to las-lics-request at lists.tu-berlin.de with
the keyword 'subscribe' in the message body (without ').



More information about the FOM mailing list