15th European Joint Conferences onTheory and Practice of Software

ETAPS 2012

Tallinn, Estonia, 24 March–1 April 2012

PROGRAMME

Institute of Cybernetics at TUT

TTÜ KÜBERNEETIKA INSTITUUT

15th European Joint Conferences on Theory and Practice of SoftwareETAPS 2012Tallinn, Estonia, 24 March–1 April 2012Final Programme

Institute of Cybernetics at Tallinn University of TechnologyAkadeemia tee 21, EE-12618 Tallinn, Estoniahttp://www.ioc.ee/

Cover design by Aive Kalmus

c© Institute of Cybernetics at TUT, 2012

Welcome to ETAPS in Tallinn

Dear ETAPS 2012 participant,

Welcome to a different corner of Europe. ETAPS has turned 15 and has come to NorthernEurope for the first time.

This time, ETAPS is comprised of 6 main conferences and 21 satellite workshops. Themain conferences attracted 606 full submissions, resulting in 159 contributed talks in theprogramme. When this booklet went to print, we had received more than 600 registrationsto ETAPS, locals and organizers excluded. These numbers are higher than we projected,but we hope we will manage and the high numbers will translate into a stimulating scien-tific event, made by you, the participants.

We would also like to give you an impression of our city. The time of year of ETAPS isnot the best for this (it is not winter anymore, but not yet spring either), but please takesome time nonetheless, and see a bit of the Old Town.

We wish you a productive conference and an enjoyable stay in Tallinn.

Tarmo Uustalu,ETAPS 2012 general chair

Conference Venues

Main conferences:Swissotel TallinnTornimae 3

Satellite workshops:Tallinn University of Technology, Building XAkadeemia tee 3

3

Partners and Sponsors

ETAPS e.V.

Three associations:

Host institution:

Institute of Cybernetics at TUT

TTÜ KÜBERNEETIKA INSTITUUT

Sponsors:

4

ETAPS 2012 Constituent Events

ETAPS 2012 consists of six main conferences:

• 21st International Conference on Compiler Construction (CC),

• 21st European Symposium on Programming (ESOP),

• 15th International Conference on Fundamental Approaches to Software Engineer-ing (FASE),

• 15th International Conference on Foundations of Software Science and Computa-tion Structures (FoSSaCS),

• First Conference on Principles of Security and Trust (POST),

• 18th International Conference on Tools and Algorithms for the Construction andAnalysis of Systems (TACAS).

POST is a new member conference of ETAPS expanding on what was last year calledTOSCA.

This year TACAS will run a new software verification competition (SV-COMP).

In addition, there are 21 satellite workshops:

• 7th Workshop on Applied and Computational Category Theory (ACCAT),

• First Workshop on Automation in Proof Assistants (AIPA),

• First International Workshop on Bidirectional Transformations (BX),

• 7th Workshop on Bytecode Semantics, Verification, Analysis and Transformation(Bytecode),

• 11th International Workshop on Coalgebraic Methods in Computer Science (CMCS),

• Third International workshop on Developments in Implicit Computational com-plExity (DICE),

• 9th International Workshop on Formal Engineering approaches to Software Com-ponents and Architectures (FESCA),

• 8th Workshop on Fixed Points in Computer Science (FICS),

• Fourth International Workshop on Foundations of Interface Technologies (FIT),

• First Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE),

• 11th International Workshop on Graph Transformation and Visual Modeling Tech-niques (GT-VMT),

• Second Workshop on Hybrid Autonomous Systems (HAS),

• Second International Workshop on Interactions, Games and Protocols (iWIGP),

• 12th Workshop on Language Descriptions, Tools and Applications (LDTA),

• Second International Workshop on Linearity (LINEARITY),

5

• 7th Workshop on Model-Based Testing (MBT),

• Fourth Workshop on Mathematically Structured Functional Programming (MSFP),

• Fifth Workshop on Programming Language Approaches to Concurrency and Com-munication-cEntric Software (PLACES),

• 10th Workshop on Quantitative Aspects of Programming Languages (QAPL),

• First Workshop on Validation Strategies for Software Evolution (VSSE),

• 9th International Workshop on Rewriting Logic and its Applications (WRLA).

Two further smaller events will be colocated with ETAPS, but not affiliated to it: a meetingof the COST action IC0901 Rich Model Toolkit (SVARM 2012) and a meeting of IFIPTC1.

ETAPS 2012 website:

http://www.etaps.org/2012

ETAPS 2012 Organization

General chair

Tarmo Uustalu

Workshop chair

Keiko Nakata

Local organizing committee

James Chapman, Juhan Ernits, Tiina Laasma, Monika Perkmann,and many of their colleagues from the Logic and Semantics Group and the Administrationof the Institute of Cybernetics

Host institution

Institute of Cybernetics at Tallinn University of Technology, Estonia

6

ETAPS Steering Committee

Steering committee chair

Vladimiro Sassone (Univ. of Southampton, United Kingdom)

Steering committee

Roberto Amadio (Univ. Paris 7, France), Gilles Barthe (IMDEA Software, Spain), DavidBasin (ETH Zurich, Switzerland), Lars Birkedal (IT Univ. of Copenhagen, Denmark),Michael O’Boyle (Univ. of Edinburgh, UK), Giuseppe Castagna (Univ. of Paris 7, France),Vittorio Cortellessa (Univ. of L’Aquila, Italy), Koen De Bosschere (Ghent Univ., Bel-gium), Pierpaolo Degano (Univ. of Pisa, Italy), Matthias Felleisen (Northeastern Univ.,USA), Bernd Finkbeiner (Saarland Univ., Germany), Cormac Flanagan (Univ. of Cali-fornia at Santa Cruz, USA), Philippa Gardner (Imperial College London, UK), AndrewGordon (Microsoft Research, UK), Daniele Gorla (“La Sapienza” Univ. of Rome, Italy),Joshua Guttman (Worchester Polytechnic Institute, USA), Holger Hermanns (SaarlandUniv., Germany), Mike Hinchey (Univ. of Limerick, Ireland), Ranjit Jhala (Univ. of Cal-ifornia at San Diego, USA) Joost-Pieter Katoen (RWTH Aachen, Germany), Paul Klint(CWI, Amsterdam), Jens Knoop (Techn. Univ. of Vienna, Austria), Barbara Konig (Univ.of Duisburg-Essen, Germany), Juan de Lara (Autonomous Univ. of Madrid, Spain), Ger-ald Luttgen (Univ. of Bamberg, Germany), Tiziana Margaria (Univ. of Potsdam, Ger-many), Fabio Martinelli (IIT CNR, Italy), John Mitchell (Stanford Univ., USA), CatusciaPalamidessi (INRIA Saclay – Ile-de-France, France), Frank Pfenning (Carnegie MellonUniv., USA), Nir Piterman (Univ. of Leicester, UK), Don Sannella (Univ. of Edinburgh,UK), Helmut Seidl (Techn. Univ. of Munich, Germany), Scott Smolka (State Univ. ofNew York at Stony Brook, USA), Gabriele Taentzer (Univ. of Marburg, Germany), TarmoUustalu (Inst. of Cybernetics, Estonia), Daniel Varro (Budapest, Hungary), Andrea Zis-man (City Univ., London, UK), Lenore Zuck (Univ. of Illinois at Chicago, USA)

7

Main Conferences

21st International Conference on Compiler Construction (CC)

CC is interested in work on processing programs in the most general sense: analyzing,transforming or executing input that describes how a system operates, including tradi-tional compiler construction as a special case. Topics of interest include, but are notlimited to:

• Compilation and interpretation techniques, including program representation andanalysis, code generation and code optimization;

• Run-time techniques, including memory management and dynamic and just-in-time compilation;

• Programming tools, from refactoring editors to checkers to compilers to virtualmachines to debuggers;

• Techniques for specific domains, such as secure, parallel, distributed, embedded ormobile environments;

• Design of novel language constructs and their implementation.

Programme chair

Michael O’Boyle (Univ. of Edinburgh, UK)

Programme committee

Erik Altman (IBM, USA), Rastislav Bodik (Univ. of California at Berkeley, USA), JohnCavazos (Univ. of Delaware, USA), Nathan Clark (Georgia Tech, USA), Murray Cole(Univ. of Edinburgh UK), Alain Darte (ENS Lyon, France), Bjorn De Sutter (GhentUniv., Belgium), Amer Diwan (Univ. of Colorado, USA), Derek Dreyer (Max PlanckInstitute for Software Systems, Germany), Matthew Flatt (Univ. of Utah, USA), SumitGulwani (Microsoft Research, Redmond, USA), Atsushi Igarashi (Kyoto Univ., Japan),Ranjit Jhala (Univ. of California at San Diego, USA), Andreas Krall (Techn. Univ. of Vi-enna, Austria), Julia Lawall (Univ. of Copenhagen, Denmark), Anton Lokhmotov (ARM,UK), Erez Petrank (Technion, Israel), Markus Puschel (ETH Zurich, Switzerland), DavidSands (Chalmers Univ. of Technology, Sweden), Vivek Sarkar (Rice Univ., USA), JanVitek (Purdue Univ., USA)

8

21st European Symposium on Programming (ESOP)

ESOP is devoted to fundamental issues in the specification, design, analysis, and im-plementation of programming languages and systems. ESOP seeks contributions on allaspects of programming language research including, but not limited to, the followingareas:

• Programming paradigms and styles: functional programming, object-oriented pro-gramming, aspect-oriented programming, logic programming, constraint program-ming, extensible programming languages, domain-specific languages, synchronousand real-time programming languages;

• Methods and tools to write and specify programs and languages: programmingtechniques, logical foundations, denotational semantics, operational semantics,meta programming, module systems, language-based security;

• Methods and tools for reasoning about programs: type systems, abstract interpre-tation, program verification, testing;

• Methods and tools for implementation: program transformations, rewriting sys-tems, partial evaluation, experimental evaluations, virtual machines, intermediatelanguages, run-time environments;

• Concurrency and distribution: process algebras, concurrency theory, parallel pro-gramming, service-oriented computing, distributed and mobile languages.

Programme chair

Helmut Seidl (Techn. Univ. of Munchen, Germany)

Programme committee

Andreas Abel (Ludwig Maximilian Univ. of Munchen, Germany), Chandra Boyapati(Univ. of Michigan, USA), Witold Charatonik (Wroclaw Univ., Poland), Kostas Chatziko-kolakis (Ecole Polytechnique and CNRS, France), Dave Clarke (Catholic Univ. of Leu-ven, Belgium), Philippa Gardner (Imperial College, UK), Sebastian Hack (Univ. of Saar-land, Germany), Suresh Jagannathan (Purdue Univ., USA), Somesh Jha (Univ. of Wis-consin, USA), Patrick Lam (Univ. of Waterloo, Canada), Isabella Mastroeni (Univ. ofVerona, Italy), Matthew Might (Univ. of Utah, USA), David Monniaux (Univ. of JosephFourier, CNRS and INP Grenoble, France), Anders Møller (Univ. of Aarhus, Denmark),Flemming Nielson (Technical Univ. of Denmark), German Puebla (Polytechn. Univ. ofMadrid, Spain), Sylvie Putot (CEA, France), Sriram Rajamani (Microsoft Research, In-dia), Noam Rinetzky (Queen Mary, Univ. of London, USA), Xavier Rival (ENS, France),Christian Schallhart (Univ. of Oxford, UK), David Schmidt (Kansas State Univ., USA),Harald Søndergaard (Univ. of Melbourne, Australia), Ian Stark (Univ. of Edinburgh, UK),Elena Zucca (Univ. of Genova, Italy)

9

15th International Conference on Fundamental Approaches toSoftware Engineering (FASE)

FASE is concerned with the foundations on which software engineering is built. Submis-sions should focus on novel techniques and the way in which they contribute to makingsoftware engineering a more mature and soundly-based discipline. Contributions thatcombine the development of conceptual and methodological advances with their formalfoundations and tool support are particularly encouraged. We welcome contributions onall such fundamental approaches, including:

• Software engineering as an engineering discipline, including its interaction withand impact on society;

• Requirements engineering: capture, consistency, and change management of soft-ware requirements;

• Software architectures: description and analysis of the architecture of individualsystems or classes of applications;

• Specification, design, and implementation of particular classes of systems: adap-tive, collaborative, embedded, distributed, mobile, pervasive, or service-orientedapplications;

• Software quality: validation and verification of software using theorem proving,model checking, testing, analysis, refinement methods, metrics or visualisationtechniques;

• Model-driven development and model transformation: meta-modelling, design andsemantics of domain-specific languages, consistency and transformation of mod-els, generative architectures;

• Software processes: support for iterative, agile, and open source development;

• Software evolution: refactoring, reverse and re-engineering, configuration man-agement and architectural change, or aspect-orientation.

Programme chairs

Juan de Lara (Autonomous Univ. of Madrid, Spain), Andrea Zisman (City Univ., London,UK)

Programme committee

Luca de Alfaro (Univ. of California at Santa Cruz, USA), Luciano Baresi (Polytechn.Univ. of Milan, Italy), Don Batory (Univ. of Texas at Austin, USA), Artur Boronat (Univ.of Leicester, UK), Paolo Bottoni (“Sapienza” Univ. of Rome, Italy), Marsha Chechik(Univ. of Toronto, Canada), Shing-Chi Cheung (Hong Kong Univ. of Sci. and Techn.,Hong Kong), Jurgen Dingel (Queen’s Univ., Canada), Gregor Engels (Univ. of Paderborn,Germany), Claudia Ermel (Techn. Univ. of Berlin, Germany), Dimitra Giannakopoulou

10

(Carnegie Mellon Univ. / NASA Ames, USA), Holger Giese (Hasso Plattner Inst., Ger-many), Esther Guerra (Autonomous Univ. of Madrid, Spain), Reiko Heckel (Univ. of Le-icester, UK), John Hosking (Univ. of Auckland, New Zealand), Christos Kloukinas (CityUniv., London, UK), Alexander Knapp (Univ. of Augsburg, Germany), Jeff Kramer (Im-perial College, UK), Luıs C. Lamb (Federal Univ. of Rio Grande do Sul, Brazil), YngveLamo (Bergen Univ. College, Norway), Tiziana Margaria (Univ. of Potsdam, Germany),Fernando Orejas (Polytechn. Univ. of Catalunya, Spain), Richard Paige (Univ. of York,UK), Alfonso Pierantonio (Univ. of Aquila, Italy), Jesus Sanchez Cuadrado (AutonomousUniv. of Madrid, Spain), Andy Schurr (Technical Univ. of Darmstadt, Germany), GeorgeSpanoudakis (City Univ., London, UK), Gabriele Taentzer (Univ. of Marburg, Germany),Daniel Varro (Budapest Univ. of Technology and Economics, Hungary)

15th International Conference on Foundations of Software Sci-ence and Computation Structures (FoSSaCS)

FoSSaCS seeks original papers on foundational research with a clear significance for soft-ware science. The conference invites submissions on theories and methods to support theanalysis, integration, synthesis, transformation, and verification of programs and softwaresystems. The specific topics covered by the conference include, but are not limited to, thefollowing:

• Automata and language theory;

• Behavioural equivalences;

• Categorical models;

• Infinite state systems;

• Modal, spatial, and temporal logics;

• Models of concurrent, reactive, distributed, hybrid, and mobile systems;

• Process algebras and calculi;

• Semantics of programming languages;

• Software specification and refinement;

• Type systems and type theory;

• Fundamentals of security;

• Semi-structured data;

• Program correctness and verification.

11

Programme chair

Lars Birkedal (IT Univ. of Copenhagen, Denmark)

Programme committee

Luca Aceto (Reykjavik Univ., Iceland), Roberto Amadio (Univ. of Paris 7, France), Tor-ben Amtoft (Kansas State Univ., USA), Mikolaj Bojanczyk (Warsaw University, Poland),Thierry Coquand (Chalmers Univ. of Technology, Sweden), Andrea Corradini (Univ. ofPisa, Italy), Volker Diekert (Univ. of Stuttgart, Germany), Maribel Fernandez (King’s Col-lege London, UK), Kohei Honda (Queen Mary, Univ. of London, UK), Bart Jacobs (Rad-boud Univ. of Nijmegen, Netherlands), Joost-Pieter Katoen (RWTH Aachen, Germany),Olivier Laurent (ENS Lyon, France), Rupak Majumdar (Max Planck Inst. for SoftwareSystems, Germany), Markus Muller-Olm (Univ. of Munster, Germany), Joachim Parrow(Uppsala Univ., Sweden), Dusko Pavlovic (Univ. of Oxford, UK), Hanne Riis Nielson(Technical Univ. of Denmark), Alex Simpson (Univ. of Edinburgh, UK), Carolyn Tal-cott (SRI International, USA), Yde Venema (Univ. of Amsterdam, Netherlands), ThomasVojnar (Brno University, Czech Republic)

First Conference on Principles of Security and Trust (POST)

Principles of Security and Trust is a broad forum related to the theoretical and founda-tional aspects of security and trust. Papers of many kinds are welcome: new theoreticalresults, practical applications of existing foundational ideas, and innovative theoreticalapproaches stimulated by pressing practical problems.

POST combines and replaces a number of successful and longstanding workshops in thisarea: Automated Reasoning and Security Protocol Analysis (ARSPA), Formal Aspects ofSecurity and Trust (FAST), Security in Concurrency (SecCo), and the Workshop on Issuesin the Theory of Security (WITS). A subset of these events met jointly as an event affili-ated with ETAPS 2011 under the name Theory of Security and Applications (TOSCA).

We seek submissions proposing theories to clarify security and trust within computerscience; submissions establishing new results in existing theories; and also submissionsraising fundamental concerns about existing theories. We welcome new techniques andtools to automate reasoning within such theories, or to solve security and trust problems.Case studies that reflect the strengths and limitations of foundational approaches are alsowelcome, as are more exploratory presentations on open questions.

12

Areas of interest include:Access control Anonymity AuthenticationAvailability Cloud security ConfidentialityCovert channels Crypto foundations Economic issuesInformation flow Integrity Languages for securityMalicious code Mobile code Models and policiesPrivacy Provenance Reputation and trustResource usage Risk assessment Security architecturesSecurity protocols Trust management Web service security

Productive techniques have included automated reasoning, compositionality and transfor-mation, language-based methods, logical formalization, quantitative methods, and staticanalysis.

Programme co-chairs

Pierpaolo Degano (Univ. of Pisa, Italy), Joshua Guttman (Worcester Polytechnic Institute,USA)

Programme committee

Michael Backes (Univ. of Saarland and MPI-SWS, Germany), Anindya Banerjee (IMDEASoftware, Spain), Gilles Barthe (IMDEA Software, Spain), David Basin (ETH Zurich,Switzerland), Veronique Cortier (CNRS, LORIA, FR), Andrew Gordon (Microsoft Re-search, Cambridge, and Univ. of Edinburgh, UK), Ralf Kusters (Univ. of Trier, Germany),Steve Kremer (INRIA, ENS Cachan, France), Peeter Laud (Cybernetica AS and Univ.of Tartu, Estonia), Gavin Lowe (Oxford Univ., UK), Heiko Mantel (Technical Univ. ofDarmstadt, Germany), Sjouke Mauw (Univ. of Luxembourg, Luxembourg), CatherineMeadows (NRL, USA), John C. Mitchell (Stanford Univ., USA), Sebastian Modersheim(Techn. Univ. of Denmark), Carroll Morgan (Univ. of New South Wales, Australia), Mo-gens Nielsen (Univ. of Aarhus, Denmark), Catuscia Palamidessi (INRIA, Ecole Poly-technique, France), Andrei Sabelfeld (Chalmers Univ. of Technology, Sweden), NikhilSwamy (Microsoft Research, Redmond, USA), Luca Vigano (Univ. of Verona, Italy)

13

18th International Conference on Tools and Algorithms for theConstruction and Analysis of Systems (TACAS)

TACAS is a forum for researchers, developers and users interested in rigorously basedtools and algorithms for the construction and analysis of systems. The conference servesto bridge the gaps between different communities that share common interests in, andtechniques for, tool development and its algorithmic foundations. The research areascovered by such communities include but are not limited to formal methods, softwareand hardware verification, static analysis, programming languages, software engineer-ing, real-time systems, communications protocols, and biological systems. The TACASforum provides a venue for such communities at which common problems, heuristics,algorithms, data structures and methodologies can be discussed and explored. In doingso, TACAS aims to support researchers in their quest to improve the utility, reliability,flexibility and efficiency of tools and algorithms for building systems.

Tool descriptions and case studies with a conceptual message, as well as theoretical paperswith clear relevance for tool construction are all encouraged. The specific topics coveredby the conference include, but are not limited to, the following:

• Specification and verification techniques for finite and infinite-state systems;

• Software and hardware verification;

• Theorem-proving and model-checking;

• System construction and transformation techniques,

• Static and run-time analysis;

• Abstraction techniques for modeling and validation;

• Compositional and refinement-based methodologies;

• Testing and test-case generation;

• Analytical techniques for safety, security, or dependability;

• Analytical techniques for real-time, hybrid, or stochastic systems;

• Integration of formal methods and static analysis in high-level hardware design orsoftware environments;

• Tool environments and tool architectures;

• SAT and SMT solvers;

• Applications and case studies.

Competition on Software Verification

Associated with TACAS ’12 there is a competition on software verification. TACAS ’12hosts the first such competition event with the goal to evaluate the technology trans-fer and compare state-of-the-art software verifiers with respect to effectiveness and ef-ficiency. The competition is performed and presented by the TACAS Competition Chair

14

Dirk Beyer. Successful competition candidates have been granted a demonstration slot fortheir tool in the TACAS program, and their contribution papers included in the TACASconference proceedings.

Programme chairs

Cormac Flanagan (Univ. of California at Santa Cruz, USA), Barbara Konig (Univ. ofDuisburg-Essen, Germany)

Programme committee

Rajeev Alur (Univ. of Pennsylvania, USA), Armin Biere ( Johannes Kepler Univ., Aus-tria), Alessandro Cimatti (FBK-irst, Italy) (Tool chair), Rance Cleaveland (Univ. of Mary-land and Fraunhofer USA, USA), Giorgio Delzanno (Univ. of Genova, Italy), Javier Es-parza (Techn. Univ. of Munich, Germany), Patrice Godefroid (Microsoft Research, Red-mond, USA), Susanne Graf (Verimag, France), Orna Grumberg (Technion, Israel), AartiGupta (NEC Labs, USA), Michael Huth (Imperial College London, UK), Ranjit Jhala(Univ. of California at San Diego, USA), Vineet Kahlon (Univ. of Texas at Austin, USA),Daniel Kroening (Univ. of Oxford, UK), Marta Kwiatkowska (Univ. of Oxford, UK),Kim G. Larsen (Aalborg Univ., Denmark), Rustan Leino (Microsoft Research, Redmond,USA), Matteo Maffei (Univ. of Saarland, Germany), Ken McMillan (Cadence BerkeleyLabs, USA), Doron Peled (Bar Ilan University, Israel), Nir Piterman (University of Le-icester, UK), Anna Philippou (Univ. of Cyprus), Arend Rensink (Univ. of Twente, Nether-lands), Andrey Rybalchenko (Techn. Univ. of Munich, Germany), Stefan Schwoon (ENSCachan, France), Scott Smolka (SUNY at Stony Brook, USA), Bernhard Steffen (Techn.Univ. of Dortmund, Germany), Serdar Tasiran (Koc University, Turkey), Lenore Zuck(Univ. of Illinois at Chicago, USA)

15

Satellite Workshops

7th Workshop on Applied and Computational Category Theory (ACCAT)

Category theory is a well-known mathematical modeling language with a wide area ofapplications in mathematics and computer science, including especially the semanticalfoundations of topics in software science and development. It is the intention of theACCAT workshop to bring together leading researchers in the field of ACCAT with thosein software science and development in order to transfer categorical concepts and theoriesin both directions.

Organizers: Thomas Soboll (Univ. of Salzburg, Austria), Ulrike Golas (Zuse InstituteBerlin, Germany)

First Workshop on Automation in Proof Assistants (AIPA)

Though proof assistants such as Agda, Coq, Isabelle, Matita, Mizar, Twelf, but alsoACL2, HOL-Light, HOL4, PVS and many others are characterized as interactive theo-rem provers, automation is largely present under different forms in them, and at the sametime probably not as present as what one would like. The purpose of this workshop isto gather people working on all different aspects of automation relevant for interactivetheorem proving.

Organizer: Hugo Herbelin (INRIA Paris - Rocquencourt, France)

First International Workshop on Bidirectional Transformations (BX)

Bidirectional transformations (bx) are a mechanism for maintaining the consistency of atleast two related sources of information. Such sources can be databases, software mod-els, documents, graphs, and trees. The methodologies used range from classical programtransformation to graph transformation techniques, from ad-hoc techniques for data syn-chronization to the development of domain-specific languages and their integration. Theaim of the workshop is to bring together researchers, established and new, interested inbidirectional transformations from different perspectives, such as: language-based ap-proaches, software/model transformations, and data/schema co-evolution.

Organizers: Frank Hermann (Techn. Univ. of Berlin, Germany), Janis Voigtlander (Univ.of Bonn, Germany)

7th Workshop on Bytecode Semantics, Verification, Analysis and Transfor-mation (Bytecode)

Bytecode, such as produced by, e.g., Java and .NET compilers, has become an importanttopic of interest, both for industry and academia. The industrial interest stems from thefact that bytecode is typically used for Internet and mobile device applications (smart

16

cards, phones, etc.), where security is a major issue. Moreover, bytecode is device-independent and allows dynamic loading of classes, which provides an extra challengefor the application of formal methods. Also the unstructuredness of the code and thepervasive presence of the operand stack provide further challenges for the analysis ofbytecode. This workshop will focus on theoretical and practical aspects of semantics,verification, analysis, certification and transformation of bytecode.

Organizer: Marieke Huisman (Univ. of Twente, Netherlands)

11th International Workshop on Coalgebraic Methods in Computer Science(CMCS)

In more than a decade of research, it has been established that a wide variety of state-based dynamical systems, like transition systems, automata (including weighted and prob-abilistic variants), Markov chains, and game-based systems, can be treated uniformly ascoalgebras. Coalgebra has developed into a field of its own interest presenting a deepmathematical foundation, a growing field of applications, and interactions with variousother fields such as reactive and interactive system theory, object-oriented and concurrentprogramming, formal system specification, modal and description logics, artificial intel-ligence, dynamical systems, control systems, category theory, algebra, analysis, etc. Theaim of the workshop is to bring together researchers with a common interest in the theoryof coalgebras, their logics, and their applications.

Organizers: Dirk Pattinson (Imperial College London, UK), Lutz Schroder (DFKI Bre-men, Germany)

Third International workshop on Developments in Implicit ComputationalcomplExity (DICE)

The area of Implicit Computational Complexity (ICC) grew out from several proposals touse logic and formal methods to provide languages for complexity-bounded computation(e.g., polytime or logspace computation). It aims at studying the computational complex-ity of programs without referring to external measuring conditions or a particular machinemodel, but only by considering language restrictions or logical / computational principlesentailing complexity properties. Several approaches have been explored for that purpose,like restrictions on primitive recursion and ramification, rewriting systems, linear logic,types and lambda calculus, interpretations of functional and imperative programs. Theworkshop is intended to be a forum for researchers interested in ICC to present new re-sults and discuss recent developments in this area.

Organizer: Ugo Dal Lago (Univ. of Bologna, Italy)

17

9th International Workshop on Formal Engineering approaches to SoftwareComponents and Architectures (FESCA)

Component-based software design has received considerable attention in industry andacademia in the past decade. In recent years, the growing need for trustworthy softwaresystems and the increased relevance of systems reliability, performance, and scalabil-ity have stimulated the emergence of formal techniques and architecture modelling ap-proaches for the specification and implementation of component-based software architec-tures. Both have to deal with an increasing complexity in software systems, challenginganalytical methods as well as modelling techniques.

FESCA aims to address the open question of how formal methods can be applied effec-tively to these new contexts and challenges. FESCA is interested in both the developmentand application of formal methods in component-based development and tries to cross-fertilize their research and application.

Organizers: Barbora Buhnova (Masaryk Univ., Czech Republic), Lucia (Kapova) Happe(Karlsruhe Inst. of Techn., Germany), Jan Kofron (Charles Univ., Czech Republic)

8th Workshop on Fixed Points in Computer Science (FICS)

Fixed points play a fundamental role in several areas of computer science and logic by jus-tifying induction and recursive definitions. The construction and properties of fixed pointshave been investigated in many different frameworks such as: design and implementationof programming languages, program logics, databases. The aim of this workshop is toprovide a forum for researchers to present their results to those members of the computerscience and logic communities who study or apply the theory of fixed points.

Organizers: Zoltan Esik (Univ. of Szeged, Hungary), Dale Miller (INRIA Saclay - Ile-de-France, France)

Fourth International Workshop on Foundations of Interface Technologies(FIT)

Component-based design is widely considered as a major approach to developing com-plex systems in a time- and cost-effective way. Component interfaces are central in thisapproach and summarize the externally visible properties of a component which can besyntactic properties such as operation signatures, but can also be behavioral and extra-functional properties such as quality of service, security and dependability. In recentyears, rich interface formalisms have been proposed to specify legal sequences of mes-sages, or resource and timing constraints. The challenge is to achieve compositionality- the key requirement for the effective analysis and prediction of global system behaviorbased on individual component behaviors. The aim of this workshop is to bring togetherresearchers who are interested in the formal underpinnings of interface technologies.

Organizers: Sebastian Bauer (Ludwig Maximilian Univ. Munich, Germany), Jean-BaptisteRaclet (IRIT, Toulouse, France)

18

First Workshop on GRAPH Inspection and Traversal Engineering(GRAPHITE)

The topic of the event is graph search in all its forms in computer science. Graph searchalgorithms tend to have common characteristics, such as duplicate detection, independentof their application domain. Over the past few years, it has been shown that the scalabilityof such algorithms can be dramatically improved by using, e.g., external memory, by ex-ploiting parallel architectures, such as clusters, multi-core CPUs, and graphics processingunits, and by using heuristics to guide the search. The goal of this event is to gather scien-tists from different communities, such as model checking, artificial intelligence planning,game playing, and algorithm engineering, who do research on graph search algorithms,such that awareness of each others’ work is increased.

Organizers: Anton Wijs (Eindhoven Univ. of Techn., Netherlands), Dragan Bosnacki(Eindhoven Univ. of Techn., Netherlands)

11th International Workshop on Graph Transformation and Visual Model-ing Techniques (GT-VMT)

GT-VMT serves as a forum for all researchers and practitioners interested in the use ofvisual notations (especially graph-based), techniques and tools for the specification, mod-eling, validation, manipulation and verification of complex systems. The aim of the work-shop is to promote engineering approaches that provide effective sound tool support forvisual modeling languages, enhancing formal reasoning at the syntactic as well as seman-tic level (e.g., for model specification, model analysis, model transformation, and modelconsistency management) in different domains, such as UML, Petri nets, graph transfor-mation or business process/workflow models.

This year’s workshop has a special theme of constraints, and we particularly encour-age submissions that focus on visual/graph constraints, ranging from underlying theorythrough to their utility in complex system specification, validation and verification.

Organizers: Andrew Fish (Univ. of Brighton, UK), Leen Lambers (Hasso Plattner Inst.for Software Systems Engineering, Germany)

Second Workshop on Hybrid Autonomous Systems (HAS)

The interest on autonomous systems is increasing both in industry and academia. Suchsystems must operate with limited human intervention in a changing environment andmust be able to compensate for significant system failures without external intervention.The most appropriate models of autonomous systems can be found in the class of hybridsystems (which study continuous-state dynamic processes via discrete-state controllers)that interact with their environment. This workshop brings together researchers interestedin all aspects of autonomy and resilience of hybrid systems.

Organizer: Manuela Bujorianu (Univ. of Manchester, UK)

19

2nd International Workshop on Interactions, Games and Protocols (iWIGP)

This workshop aims at the interrelation between interactions, games and protocols. Howdoes computer science deal with nondeterministic interactions where the actions a sys-tem takes are not (completely) determined by the interactions the system is involved in?In computer science, nondeterministic interactions are usually described by protocols.However, these interactions can also be viewed as games. As to be expected, gameshave become an increasingly important modeling tool for computer science where nonde-terministic interactions are involved—from foundations in game semantics and reactivesystems to applications in communication protocols and electronic business applications.The goal of this workshop is to bring researchers from industry and academia together andto explore how a better understanding of the interrelation between interactions, games andprotocols leads to better-designed and more reliable nondeterministic interacting systems.

Organizers: Bernd Finkbeiner (Saarland U., Germany), Johannes Reich (SAP, Germany)

12th Workshop on Language Descriptions, Tools and Applications (LDTA)

The LDTA workshops bring together researchers interested in the field of formal lan-guage definitions and language technologies, with an emphasis on tools developed for orwith these language definitions. Several specification formalisms like attribute grammars,action semantics, operational semantics, term rewriting, and algebraic approaches havebeen developed over the years. Of specific interest are the formal analysis of languagespecifications, and the automatic generation of language processing tools from such spec-ifications. These tools typically perform some sort of program analysis, transformation,or generation. Also of interest are applications of such tools in domains including, butnot limited to, modelling languages, re-engineering and re-factoring, aspect-oriented anddomain-specific languages, XML processing, visualisation and graph transformation.

Organizers: Anthony Sloane (Macquarie Univ., Australia), Suzana Andova (EindhovenUniv. of Techn., Netherlands)

Second International Workshop on Linearity (LINEARITY)

With the urge for more robust, verifiable and optimised programming languages, the in-terest for linearity in order to have more control on computational resources is increasingin several areas of Computer Science, both in the theoretical side: with work on prooftechnology, complexity classes and more recently quantum computation, and in the prac-tical side: work on program analysis, expressive operational semantics, linear languages,and techniques for program transformation, update analysis and efficient implementation.The aim of this workshop is to bring together researchers who are currently developingtheory and applications of linear calculi, to foster their interaction and provide a forum forpresenting new ideas and work in progress, and enable newcomers to learn about currentactivities in this area.

Organizers: Sandra Alves (U. of Porto, Portugal), Ian Mackie (Ecole Polytechn., France)

20

7th Workshop on Model-Based Testing (MBT)

MBT is devoted to model-based testing of both software and hardware. Model-basedtesting uses models that describe the behavior of the system under consideration to guidesuch efforts as test selection and test results evaluation. Model-based testing has gainedattention with the popularization of models in software/hardware design and development.Of particular importance are formal models with precise semantics, such as state-basedformalisms. Testing with such models allows one to measure the degree of the product’sconformance with the model. The intent of this workshop is to bring together researchersand users using different kinds of models for testing and to discuss the state of the art intheory, applications, tools, and industrialization of model-based testing.

Organizer: Alexander Petrenko (Inst. for System Programming, Russian Academy ofSciences / Moscow State Univ., Russia)

Fourth Workshop on Mathematically Structured Functional Programming(MSFP)

The MSFP workshop is devoted to the derivation of functionality from structure. It is acelebration of the direct impact of theoretical computer science on programs as we writethem today. Modern programming languages, and in particular functional languages, sup-port the direct expression of mathematical structures, equipping programmers with toolsof remarkable power and abstraction. Monadic programming in Haskell is the paradig-matic example, but there are many more mathematical insights manifest in programs andin programming language design: Freyd-categories in reactive programming, symbolicdifferentiation yielding context structures, and comonadic presentations of dataflow, toname but three. This workshop is a forum for researchers who seek to reflect mathemati-cal phenomena in data and control.

Organizers: James Chapman (Institute of Cybernetics, Estonia), Paul Blain Levy (Univ.of Birmingham, UK)

Fifth Workshop on Programming Language Approaches to Concurrencyand Communication-cEntric Software (PLACES)

Applications on the web today are built using numerous interacting services; soon off-the-shelf CPUs will host thousands of cores, and sensor networks will be composed froma large number of processing units. Many normal applications will soon need to makeeffective use of thousands of computing nodes. At some level of granularity, computationin such systems will be inherently concurrent and communication-centred.

PLACES aims to offer a forum where researchers from different fields exchange new ideason one of the central challenges for programming in the near future, the development ofprogramming methodologies and infrastructures where concurrency and distribution arethe norm rather than a marginal concern.

Organizer: Simon Gay (Univ. of Glasgow, UK)

21

10th Workshop on Quantitative Aspects of Programming Languages (QAPL)

Quantitative aspects of computation refer to the use of physical quantities (time, band-width, etc.) as well as mathematical quantities (e.g., probabilities) for the characterisationof the behaviour and for determining the properties of systems. Such quantities play a cen-tral role in defining both the model of systems (architecture, language design, semantics)and the methodologies and tools for the analysis and verification of system properties.The aim of the QAPL workshop series is to discuss the explicit use of time and proba-bility and general quantities either directly in the model or as a tool for the analysis ofsystems.

Organizers: Mieke Massink (CNR-ISTI, Italy), Herbert Wiklicky (Imperial College Lon-don, UK)

First Workshop on Validation Strategies for Software Evolution (VSSE)

This workshop focuses on verification and testing of software change and upgrades. Soft-ware is usually not written all at once, but is built incrementally, due to several reasons:

• Maintenance (fixing errors and flaws, hardware changes, etc.)

• Enhancements (new functionality, improved efficiency, extension, new regulations,etc.)

Changes are done frequently during the lifetime of most systems and can introduce soft-ware errors that were not present in the old version, or expose errors that were presentbefore but did not get exercised. In addition, upgrades are done gradually, so the old andnew versions have to co-exist in the same system. This workshop will address the issueof efficient and reliable verification of system changes and upgrades by means of formalverification and dynamic analysis techniques.

Organizer: Hana Chockler (IBM Research, Haifa, Israel)

9th International Workshop on Rewriting Logic and its Applications(WRLA)

Rewriting logic (RL) is a natural model of computation and an expressive semantic frame-work for concurrency, parallelism, communication, and interaction. It can be used forspecifying a wide range of systems and languages in various application fields. It also hasgood properties as a metalogical framework for representing logics. In recent years, sev-eral languages based on RL (ASF+SDF, CafeOBJ, ELAN, Maude) have been designedand implemented. The aim of the workshop is to bring together researchers with a com-mon interest in RL and its applications, and to give them the opportunity to present theirrecent works, discuss future research directions, and exchange ideas.

Organizer: Francisco Duran (Univ. of Malaga, Spain)

22

ETAPS 2012 Programme at a Glance

Scientific programme

Sat Sun Mon Tue Wed Thu Fri Sat Sun

24 Mar 25 Mar 26 Mar 27 Mar 28 Mar 29 Mar 30 Mar 31 Mar 1 Apr

Workshops ETAPS 2012 main conferences Workshops

GT-VMT ESOP CC CMCS

WRLA DICE

FICS BX FASE LDTA

FIT QAPL

iWIGP POST FoSSaCS Bytecode ACCAT

MBT FESCA Graphite

MSFP TACAS HAS Linearity

VSSE PLACES

AIPA [+ SVARM]

Social programme

Sun, 25 March Pre-conference workshop dinner MaikrahvMon, 26 March Welcome reception BlackheadsWed, 28 March Banquet Song Festival GroundsSat, 31 March Post-conference workshop dinner Olde HansaSat, 31 March CMCS dinner MEKK Ateljee

23

Main Conferences: Programme

The venue of the main conferences is Swissotel Tallinn (Tornimae 3).

Main Conferences (Day 1)

Monday, 26 March

9.00-9.30 Opening9.30-10.30 ESOP invited talk

Foundations of C++Bjarne Stroustrup

10.30-11.00 Coffee11.00-12.30 ESOP [Theory of Functional Programming]

The Call-by-Need Lambda Calculus, RevisitedStephen Chang and Matthias FelleisenComplete Monitors for Behavioral ContractsChristos Dimoulas, Sam Tobin-Hochstadt and Matthias FelleisenA Systematic Approach to Delimited Control with Multiple PromptsPaul Downen and Zena M. Ariola best paper nominee

11.00-12.30 FASE [Software Architecture and Components]Model-Driven Techniques to Enhance Architectural Languages Inter-operabilityDavide Di Ruscio, Ivano Malavolta, Henry Muccini, Patrizio Pellic-cione and Alfonso PierantonioMoving from Specifications to Contracts in Component-based De-signSebastian S. Bauer, Alexandre David, Rolf Hennicker, Kim Guld-strand Larsen, Axel Legay, Ulrik Nyman and Andrzej WasowskiThe SynchAADL2Maude Tool [Demo paper]Kyungmin Bae, Peter Csaba Olveczky, Jose Meseguer and AbdullahAl-Nayeem

11.00-12.30 POST [Verification in the Small]Analysing Routing Protocols: Four Nodes Topologies Are SufficientVeronique Cortier, Jan Degrieck and Stephanie DelauneParametric Verification of Address Space SeparationJason Franklin, Sagar Chaki, Anupam Datta, Jonathan M. McCuneand Amit Vasudevan best paper nomineeVerification of Security Protocols with Lists: From Length One toUnbounded LengthMiriam Paiola and Bruno Blanchet best paper nominee

12.30-14.00 Lunch

24

14.00-15.30 ESOP [Type Systems]Gradual Ownership TypesIlya Sergey and Dave ClarkeAdding Equations to System FNeelakantan R. Krishnaswami and Nick BentonExpansion for Universal QuantifiersSergueı Lenglet and Joe Wells

14.00-15.30 FASE [Services]Consistency of Service CompositionJose Luiz Fiadeiro and Antonia LopesStable Availability under Denial of Service Attacks through FormalPatternsJonas Eckhardt, Tobias Muhlbauer, Musab Al Turki, Jose Meseguerand Martin WirsingLoose Programming with PROPHETS [Demo paper]Stefan Naujokat, Anna-Lena Lamprecht and Bernhard Steffen

14.00-15.30 POST [Applied Protocols]Privacy Supporting Cloud Computing: ConfiChair, a Case StudyMyrto Arapinis, Sergiu Bursuc and Mark RyanA Formal Analysis of the Norwegian e-voting ProtocolVeronique Cortier and Cyrille WiedlingProvably Repairing the ISO/IEC 9798 Standard for Entity Authenti-cationDavid Basin, Cas Cremers and Simon Meier

15.30-16.00 Coffee

25

16.00-18.00 ESOP [Analysis]Probabilistic Abstract InterpretationPatrick Cousot and Michael MonerauTrace Spaces: An Efficient New Technique for State-Space Reduc-tionLisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mim-ram and Martin RaussenA Compositional Specification Theory for Component BehavioursTaolue Chen, Chris Chilton, Bengt Jonsson and Marta KwiatkowskaFictional Separation LogicJonas Braband Jensen and Lars Birkedal

16.00-18.00 FASE [Verification and Monitoring]Schedule Insensitivity ReductionVineet KahlonAdaptive Task Automata: A Framework for Verifying Adaptive Em-bedded SystemsLeo Hatvani, Paul Pettersson and Cristina SeceleanuVerified Resource Guarantees for Heap Manipulating ProgramsElvira Albert, Richard Bubel, Samir Genaim, Reiner Hahnle andGuillermo Roman-DıezAn Operational Decision Support Framework for Monitoring Busi-ness ConstraintsFabrizio Maria Maggi, Marco Montali and Wil M. P. van der Aalst

16.00-18.00 POST [Protocols and Cryptographic Properties]Security Proof with Dishonest KeysHubert Comon-Lundh, Veronique Cortier and Guillaume ScerriReduction of Equational Theories for Verification of Trace Equiva-lence: Re-encryption and Associativity-CommutativityMyrto Arapinis, Sergiu Bursuc and Mark RyanTowards Unconditional Soundness: Computationally Complete Sym-bolic AttackerGergei Bana and Hubert Comon-LundhVerified Indifferentiable Hashing into Elliptic CurvesGilles Barthe, Benjamin Gregoire, Sylvain Heraud, Federico Olmedoand Santiago Zanella Beguelin

20.00- Welcome Reception (House of the Brotherhood of the Blackheads,Pikk 26) (welcome drink from 19.30)

26

Main Conferences (Day 2)

Tuesday, 27 March

9.00-10.00 POST invited talkDifferential Privacy and the Power of (Formalizing) Negative Think-ingCynthia Dwork

10.00-10.30 Coffee10.30-12.30 ESOP [Parallelism]

Generate, Test, and Aggregate: A Calculation-based Framework forSystematic Parallel Programming with MapReduceKento Emoto, Sebastian Fischer and Zhenjiang HuOn the Correctness of the SIMT Execution Model of GPUsAxel Habermaier and Alexander KnappA Type and Effect System for Determinism in Multithreaded Pro-gramsYi Lu, John Potter, Chenyi Zhang and Jingling XueReasoning About Lock PlacementsPeter Hawkins, Alex Aiken, Kathleen Fisher, Martin Rinard andMooly Sagiv

10.30-12.30 FASE [Intermodelling and Model Transformations]Intermodeling, Queries, and Kleisli CategoriesZinovy Diskin, Tom Maibaum and Krzysztof CzarneckiConcurrent Model Synchronization with Conflict Resolution Basedon Triple Graph GrammarsFrank Hermann, Hartmut Ehrig, Claudia Ermel and Fernando Ore-jasRecursive Checkonly QVT-R Transformations with General ’when’and ’where’ Clauses via the Modal mu CalculusJulian Bradfield and Perdita StevensGraph Transforming Java DataMaarten de Mol, Arend Rensink and James J. Hunt

10.30-12.30 POST [Quantitative Approaches]Provable De-anonymization of Large Datasets with Sparse Dimen-sionsAnupam Datta, Divya Sharma and Arunesh SinhaRevisiting Botnet Models and Their Implications for TakedownStrategiesTing-Fang Yen and Michael ReiterA Game-Theoretic Analysis of Cooperation in Anonymity NetworksMu Yang, Vladimiro Sassone and Sardaouna HamadouDeciding Selective Declassification of Petri NetsEike Best and Philippe Darondeau

27

10.30-12.30 TACAS [SAT and SMT Based Methods]History-Aware Data Structure Repair Using SATRazieh Nokhbeh Zaeem, Divya Gopinath, Sarfraz Khurshid andKathryn S. McKinley (presented by Guowei Yang)The Guardol Language and Verification SystemDavid Hardin, Konrad Slind, Mike Whalen and Tuan-Hung PhamA Bit Too Precise? Bounded Verification of Quantized Digital FiltersArlen Cox, Sriram Sankaranarayanan and Bor-Yuh Evan ChangNumeric Bounds Analysis with Conflict-Driven LearningVijay D’Silva, Leopold Haller, Daniel Kroening and MichaelTautschnig

12.30-13.50 Lunch

13.50-14.50 FASE invited talkDistributed Process Discovery and Conformance CheckingWil van der Aalst

15.00-16.00 ESOP [Staged Computation]Staged Computation with Staged Lexical ScopeMorten RhigerReasoning About Multi-Stage ProgramsJun Inoue and Walid Taha

15.00-16.00 FASE [Modelling and Adaptation]Language Independent Refinement using Partial ModelingRick Salay, Michalis Famelis and Marsha ChechikA Conceptual Framework for AdaptationRoberto Bruni, Andrea Corradini, Fabio Gadducci, Alberto LluchLafuente and Andrea Vandin

15.00-16.00 POST [Foundations of Security]Enforceable Security Policies RevisitedDavid Basin, Vincent Juge, Felix Klaedtke and Eugen ZalinescuTowards Incrementalization of Holistic HyperpropertiesDimiter Milushev and Dave Clarke

16.00-16.30 Coffee

28

16.30-18.00 ESOP [Processes and Sessions]A Process Algebra for Wireless Mesh NetworksAnsgar Fehnker, Rob van Glabbeek, Peter Hofner, Annabelle McIver,Marius Portmann and Wee Lum TanMultiparty Session Types Meet Communicating AutomataPierre-Malo Denielou and Nobuko Yoshida best paper nomineeLinear Logical Relations for Session-Based ConcurrencyJorge A. Perez, Luıs Caires, Frank Pfenning and Bernardo Toninho

16.30-18.00 FASE [Product Lines and Feature-Oriented Programming]Applying Design by Contract to Feature-Oriented ProgrammingThomas Thum, Ina Schaefer, Martin Kuhlemann, Sven Apel andGunter SaakeIntegration Testing of Software Product Lines Using CompositionalSymbolic ExecutionJiangfan Shi, Myra B. Cohen and Matthew B. DwyerCombining Related Products into Product LinesJulia Rubin and Marsha Chechik

16.30-18.30 POST [Language-Based Methods]Type-Based Analysis of PKCS#11 Key ManagementMatteo Centenaro, Riccardo Focardi and Flaminia L. Luccio

best paper nomineeA Certificate Infrastructure for Machine-Checked Proofs of Condi-tional Information FlowTorben Amtoft, Josiah Dodds, Zhi Zhang, Andrew Appel, LennartBeringer, John Hatcliff, Xinming Ou and Andrew CousinoPTaCL: A Language for Attribute-Based Access Control in OpenSystemsJason Crampton and Charles MorissetA Core Calculus for ProvenanceUmut A. Acar, Amal Ahmed, James Cheney and Roly Perera

16.30-18.00 TACAS [Automata]Ramsey-Based Analysis of Parity AutomataOliver Friedmann and Martin LangeVATA: A Library for Efficient Manipulation of Non-DeterministicTree Automata [Regular tool paper]Ondrej Lengal, Jirı Simacek and Tomas VojnarLTL to Buchi Automata Translation: Fast and More DeterministicTomas Babiak, Mojmir Kretinsky, Vojtech Rehak and Jan Strejcek

18.45-19.30 Hearing of bids for ETAPS 2014

29

Main Conferences (Day 3)

Wednesday, 28 March

9.00-10.00 Unifying talkSecurity Protocol Verification: Symbolic and Computational ModelsBruno Blanchet

10.00-10.30 Coffee10.30-12.30 ESOP [Verification]

Java and the Java Memory Model - A Unified, Machine-Checked For-malisationAndreas LochbihlerA Formally Verified SSA-Based Middle-End - Single Static Assign-ment Meets CompCertGilles Barthe, Delphine Demange and David PichardieAutomated Verification of Equivalence Properties of CryptographicProtocolsRohit Chadha, Stefan Ciobaca and Steve KremerValidating LR(1) ParsersJacques-Henri Jourdan, Francois Pottier and Xavier Leroy

10.30-12.30 FASE [Development Process]Tracing your Maintenance Work - A Cross-Project Validation of anAutomated Classification Dictionary for Commit MessagesAndreas Mauczka, Markus Huber, Christian Schanes, WolfgangSchramm, Mario Bernhart and Thomas GrechenigCohesive and Isolated Development with BranchesEarl T. Barr, Christian Bird, Peter C. Rigby, Abram Hindle, DanielM. German and Premkumar DevanbuMaking Software Integration Really ContinuousMario Luıs Guimaraes and Antonio Rito SilvaExtracting Widget Descriptions from GUIsGiovanni Becce, Leonardo Mariani, Oliviero Riganelli and MauroSantoro

10.30-12.30 FoSSaCS [Categorical Models]Fibrational Induction Meets EffectsRobert Atkey, Neil Ghani, Bart Jacobs and Patricia JohannA Coalgebraic Perspective on Minimization and DeterminizationJirı Adamek, Filippo Bonchi, Mathias Hulsbusch, Barbara Konig,Stefan Milius and Alexandra SilvaWhen Is a Container a Comonad?Danel Ahman, James Chapman and Tarmo Uustalu

best paper nomineeWell-pointed CoalgebrasJirı Adamek, Stefan Milius, Lawrence S. Moss and Lurdes Sousa

30

10.30-12.30 TACAS [Model Checking]Pushdown Model Checking for Malware DetectionFu Song and Tayssir Touili best paper nomineeAspect-Oriented Runtime Monitor Certification via Model-CheckingKevin Hamlen, Micah Jones and Meera SridharPartial Model Checking Using Networks of Labeled Transition Sys-tems and Boolean Equation SystemsFrederic Lang and Radu Mateescu best paper nomineeFrom Under-Approximations to Over-Approximations and BackAws Albarghouthi, Arie Gurfinkel and Marsha Chechik

12.30-13.50 Lunch

13.50-14.50 Unifying talkQuerying UML Class DiagramsGeorg Gottlob

15.00-16.00 ESOP [Weak Memory Models]Concurrent Library Correctness on the TSO Memory ModelSebastian Burckhardt, Alexey Gotsman, Madanlal Musuvathi andHongseok YangWhat’s Decidable about Weak Memory Models?Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt andMadanlal Musuvathi

15.00-16.00 FoSSaCS [Reasoning about Programs]Combining Interactive and Automatic Reasoning in First Order The-ories of Functional ProgramsAna Bove, Peter Dybjer and Andres Sicard-RamırezBisimulations for Delimited-Control OperatorsDariusz Biernacki and Sergueı Lenglet

15.00-16.00 TACAS [Case Studies]Automated Analysis of AODV using UPPAAL [Case Study]Ansgar Fehnker, Rob van Glabbeek, Peter Hofner, Annabelle McIver,Marius Portmann and Wee Lum TanModeling and Verification of a Dual Chamber Implantable Pace-maker [Case Study]Zhihao Jiang, Miroslav Pajic, Salar Moarref, Rajeev Alur and RahulMangharam best paper nominee

16.00-16.30 Coffee

31

16.30-18.00 ESOP [Models of Programming]Gmeta: A Generic Formal Metatheory Framework for First-OrderRepresentationsGyesik Lee, Bruno C.d.S. Oliveira, Sungkeun Cho and Kwangkeun YiNon-Monotonic Self-Adjusting ComputationRuy Ley-Wild, Umut Acar and Guy BlellochEventually Consistent TransactionsSebastian Burckhardt, Daan Leijen, Manuel Fahndrich and MoolySagiv

16.30-18.00 FASE [Verification and Synthesis]Language-Theoretic Abstraction RefinementZhenyue Long, Georgel Calin, Rupak Majumdar and Roland Meyer

best paper nomineeLearning from Vacuously Satisfiable Scenario-Based SpecificationsDalal Alrajeh, Jeff Kramer, Alessandra Russo and Sebastian UchitelExplanations for Regular ExpressionsMartin Erwig and Rahul Gopinath

16.30-18.00 FoSSaCS [Automata]Effective Characterizations of Simple Fragments of Temporal LogicUsing Prophetic AutomataSebastian Preugschat and Thomas Wilke best paper nomineeImproved Ramsey-Based Buchi ComplementationStefan Breuers, Christof Loding and Jorg OlschewskiExtending H1-Clauses with Path DisequalitiesHelmut Seidl and Andreas Reuß

16.30-18.00 TACAS [Tool Demonstrations]Demonstrating Learning of Register Automata [Tool demo]Maik Merten, Falk Howar, Bernhard Steffen, Sofia Cassel and BengtJonssonSymbolic Automata: The Toolkit [Tool demo]Margus Veanes and Nikolaj BjørnerMcScM: A Framework for the Verification of Communicating Ma-chines [Tool demo]Alexander Heußner, Tristan Le Gall and Gregoire SutreSLMC: A Tool for Model Checking Concurrent Systems against Dy-namical Spatial Logic Specifications [Tool demo]Luis Caires and Hugo Torres VieiraTAPAAL 2.0: Integrated Development Environment for Timed-ArcPetri Nets [Tool demo]Alexandre David, Lasse Jacobsen, Morten Jacobsen, Kenneth YrkeJørgensen, Mikael H. Møller and Jirı SrbaA Platform for High Performance Statistical Model Checking -PLASMA [Tool demo]Cyrille Jegourel, Axel Legay and Sean Sedwards

20.00- Banquet (Song Festival Grounds, Narva mnt 95)

32

Main Conferences (Day 4)

Thursday, 29 March

9.00-10.00 TACAS invited talkQuantitative Models for a Not So Dumb GridHolger Hermanns

10.00-10.30 Coffee10.30-12.30 FASE [Testing and Maintenance]

On the Danger of Coverage Directed Test Case GenerationMatt Staats, Gregory Gay, Michael Whalen and Mats HeimdahlReduction of Test Suites Using MutationMacario Polo Usaola, Pedro Reales Mateo and Beatriz Perez Laman-chaModel-Based Filtering of Large Combinatorial Test SuitesTaha Triki, Yves Ledru, Lydie Du Bousquet, Frederic Dadeau andJulien BotellaA New Design Defects Classification: Marrying Detection and Cor-rectionRim Mahouachi, Marouane Kessentini and Khaled Ghedira

10.30-12.30 FoSSaCS [Semantics of Concurrency]Brookes is Relaxed, Almost!Radha Jagadeesan, Gustavo Petri and James RielyRevisiting Trace and Testing Equivalences for Nondeterministic andProbabilistic ProcessesMarco Bernardo, Rocco De Nicola and Michele LoretiIs It a “Good” Encoding of Mixed Choice?Kirstin Peters and Uwe NestmannEvent Structure Semantics of Parallel Extrusion in the pi-CalculusSilvia Crafa, Daniele Varacca and Nobuko Yoshida

10.30-12.30 TACAS [Memory Models and Termination]Counter-Example Guided Fence Insertion under TSOParosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, CarlLeonardsson and Ahmed RezineJava Memory Model-Aware Model CheckingHuafeng Jin, Tuba Yavuz-Kahveci and Beverly A. SandersCompositional Termination Proofs for Multi-Threaded ProgramsCorneliu Popeea and Andrey RybalchenkoDeciding Conditional TerminationRadu Iosif, Marius Bozga and Filip Konecny

12.30-13.50 Lunch

33

13.50-14.50 CC invited talkProgramming Heterogeneous Many-Cores Using DirectivesFrancois Bodin

15.00-16.00 CC [GPUs]Improving Performance of OpenCL on CPUsRalf Karrenberg and Sebastian HackAutomatic Restructuring of GPU Kernels for Exploiting Inter-threadData LocalitySwapneela Unkule, Christopher Shaltz and Apan Qasem

15.00-16.00 FoSSaCS [Modal Logic and Nominal Languages]Narcissists Are Easy, Stepmothers Are HardDaniel Gorın and Lutz SchroderOn Nominal Regular Languages with BindersAlexander Kurz, Tomoyuki Suzuki and Emilio Tuosto

15.00-16.00 TACAS [Internet Protocol Verification]The AVANTSSAR Platform for the Automated Validation of Trustand Security of Service-Oriented Architectures [Regular tool paper]Alessandro Armando, Wihem Arsac, Tigran Avanesov, Michele Bar-letta, Alberto Calvi, Alessandro Cappai, Roberto Carbone, YannickChevalier, Luca Compagna, Jorge Cuellar, Gabriel Erzse, SimoneFrau, Marius Minea, Sebastian Modersheim, David von Oheimb, Gi-ancarlo Pellegrino, Serena Elisa Ponta, Marco Rocchetto, MichaelRusinowitch, Mohammad Torabi Dashti, Mathieu Turuani and LucaViganoReduction-Based Formal Analysis of BGP InstancesAnduo Wang, Carolyn Talcott, Alexander J.T. Gurney, Boon Thau Looand Andre Scedrov

16.00-16.30 Coffee16.30-18.00 FASE [Slicing and Refactoring]

Fine Slicing: Theory and Applications for Computation ExtractionAharon Abadi, Ran Ettinger and Yishai A. Feldman

best paper nomineeSystem Dependence Graphs in Sequential ErlangJosep Silva, Salvador Tamarit and Cesar TomasA Domain-Specific Language for Scripting Refactorings in ErlangHuiqing Li and Simon Thompson

16.30-18.00 FoSSaCS [Games]Robustness of Structurally Equivalent Concurrent Parity GamesKrishnendu ChatterjeeSubgame Perfection for Equilibria in Quantitative ReachabilityGamesThomas Brihaye, Veronique Bruyere, Julie De Pril and Hugo Gim-bertConcurrent Games with Ordered ObjectivesPatricia Bouyer, Romain Brenguier, Nicolas Markey and MichaelUmmels

34

16.30-18.00 TACAS Competition on Software VerificationCompetition OverviewDirk BeyerPredicate Analysis with BLAST 2.7Pavel Shved, Mikhail Mandrykin and Vadim MutilinCPAchecker with Dynamically Adjustable Predicate AnalysisStefan Lowe and Philipp WendlerAdjustable Block Memorization for CPAcheckerDaniel Wonisch† (presented by Alexander Schremmer)Context-Bounded Model Checking with ESBMC v1.17Lucas Cordeiro, Jeremy Morse, Denis Nicole and Bernd FischerProving Reachability Using FshellAndreas Holzer, Daniel Kroening, Christian Schallhart, MichaelTautschnig and Helmut VeithLLBMC: A Bounded Model Checker for LLVM’s Intermediate Rep-resentationCarsten Sinz, Florian Merz and Stephan FalkePredator: A Verification Tool for Programs with Dynamic LinkedData StructuresKamil Dudka, Petr Muller, Petr Peringer and Tomas VojnarHSF(C): A Software Verifier Based on Horn clausesSergey Grebenshchikov, Ashutosh Gupta, Nuno P. Lopes, CorneliuPopeea and Andrey RybalchenkoSatAbs: A Bit-Precise Verifier for C ProgarmsGerard Basler, Alastair Donaldson, Alexander Kaiser, Daniel Kroen-ing, Michael Tautschnig and Thomas WahlWOLVERINE: Battling Bugs with InterpolantsGeorg Weissenbacher, Daniel Kroening and Sharad Malik

35

Main Conferences (Day 5)

Friday, 30 March

9.00-10.00 FoSSaCS invited talkBicategories of Concurrent GamesGlynn Winskel

10.00-10.30 Coffee10.30-12.30 CC [Program analysis]

Programming Paradigm Driven Heap AnalysisMark Marron, Ondrej Lhotak and Anindya BanerjeeParallel Replication-based Points-to AnalysisSandeep Putta and Rupesh NasreA New Method For Program InversionCong Hou, George Vulov, Daniel Quinlan, David Jefferson, RichardFujimoto and Richard VuducAnalytical Bounds for Optimal Tile Size SelectionJun Shirako, Kamal Sharma, Naznin Fauzia, Louis-Noel Pouchet, J.Ramanujam, P. Sadayappan and Vivek Sarkar

10.30-12.30 FoSSaCS [Nets and Processes]Full Abstraction for Set-Based Models of the Symmetric InteractionCombinatorsDamiano Mazza and Neil J. RossOn Distributability of Petri NetsRob van Glabbeek, Ursula Goltz and Jens-Wolfhard Schicke-UffmannFunctions as Session-Typed ProcessesBernardo Toninho, Luis Caires and Frank PfenningDeriving Bisimulation Congruences for Conditional Reactive Sys-temsMathias Hulsbusch and Barbara Konig

10.30-12.30 TACAS [Statistical Model Checking]Minimal Critical Subsystems for Discrete-Time Markov ModelsRalf Wimmer, Nils Jansen, Erika Abraham, Bernd Becker and Joost-Pieter KatoenAutomatic Verification of Competitive Stochastic SystemsTaolue Chen, Vojtech Forejt, Marta Kwiatkowska, David Parker andAistis SimaitisCoupling and Importance Sampling for Statistical Model CheckingBenoit Barbot, Serge Haddad and Claudine PicaronnyVerifying pCTL Model CheckingJohannes Holzl and Tobias Nipkow

12.30-14.00 Lunch

36

14.00-15.30 CC [Objects and Components]Static Detection of Unsafe Component LoadingsTaeho Kwon and Zhendong SuObject Model Construction for Inheritance in C++ and Its Applica-tions to Program AnalysisJing Yang, Gogul Balakrishnan, Naoto Maeda, Franjo Ivancic,Aarti Gupta, Nishant Sinha, Sriram Sankaranarayanan and NaveenSharmaGC-Safe Interprocedural UnboxingLeaf Petersen and Neal Glew

14.00-15.30 FoSSaCS [Automata and Model Checking]First-order Model Checking on Nested Pushdown Trees is Completefor Doubly Exponential Alternating TimeAlexander KartzowModel Checking Languages of Data WordsBenedikt Bollig, Aiswarya Cyriac, Paul Gastin and K. Narayan Ku-marBranching-Time Model Checking of Parametric One-Counter Au-tomataStefan Goller, Christoph Haase, Joel Ouaknine and James Worrell

14.00-15.30 TACAS [Synthesis]Parameterized SynthesisSwen Jacobs and Roderick BloemQuteRTL: Towards an Open Source Framework for RTL Design Syn-thesis and Verification [Regular tool paper]Hu Hsi Yeh, Cheng-Yin Wu and Chung-Yang (Ric) HuangTemplate-based Controller Synthesis for Timed SystemsBernd Finkbeiner and Hans-Jorg Peter

15.30-16.00 Coffee

37

16.00-18.00 CC [Dynamic Analysis and Runtime Support]Compiler Support for Value-based Indirect Branch PredictionMuhammad Umar Farooq, Lei Chen and Lizy Kurian JohnCompiler Support for Fine-Grain Software-Only CheckpointingChuck (Chengyan) Zhao, J. Gregory Steffan, Cristiana Amza and Al-lan KielstraVMAD: An Advanced Dynamic Program Analysis and Instrumenta-tion FrameworkAlexandra Jimborean, Luis Mastrangelo, Vincent Loechner andPhilippe ClaussSambamba: A Runtime System for Online Adaptive ParallelizationKevin Streit, Clemens Hammacher, Andreas Zeller and SebastianHack

16.00-18.00 FoSSaCS [Probabilistic Systems]Synthesizing Probabilistic ComposersSumit Nain and Moshe VardiOn the Complexity of Computing Probabilistic BisimilarityDi Chen, Franck van Breugel and James WorrellProbabilistic Transition System Specification: Congruence and FullAbstraction of BisimulationPedro Ruben D’Argenio and Matias David LeeOn the Complexity of the Equivalence Problem for Probabilistic Au-tomataStefan Kiefer, Andrzej S. Murawski, Joel Ouaknine, Bjorn Wachterand James Worrell

16.00-18.00 TACAS [Provers and Analysis Techniques]Zeno: An Automated Prover for Properties of Recursive Data Struc-turesWilliam Sonnex, Sophia Drossopoulou and Susan EisenbachA Proof Assistant for Alloy SpecificationsMattias Ulbrich, Ulrich Geilmann, Aboubakr Achraf El Ghazi andMana TaghdiriReachability under Contextual LockingRohit Chadha, P. Madhusudan and Mahesh ViswanathanBounded Phase Analysis of Message-Passing ProgramsAhmed Bouajjani and Michael Emmi

38

Pre-Conference Satellite Workshops: Programme

All workshops will take place in Building X of the campus of the Tallinn University ofTechnology (Akadeemia tee 3).

BX

Sunday, 25 March

9.00-10.00 Bidirectional Transformations in Database Engineering [Invited talk]Jean-Luc Hainaut

10.00-10.30 Relating Algebraic and Coalgebraic Descriptions of LensesJeremy Gibbons and Michael Johnson

10.30-11.00 Coffee11.00-12.30 Delta Lenses over Inductive Types

Hugo Pacheco, Alcino Cunha and Zhenjiang HuLanguage Evolution, MetasyntacticallyVadim ZaytsevLens put-put Laws: Monotonic and MixedMichael Johnson and Robert Rosebrugh

12.30-14.00 Lunch

14.00-15.00 Bidirectional Transformations with Graphical Constraints [Invitedtalk (joint with GT-VMT)]Juan de Lara

15.00-15.30 Complex Attribute Manipulation in TGGs with Constraint-BasedProgramming TechniquesAnthony Anjorin, Gergely Varro and Andy Schurr

15.30-16.00 Coffee16.00-17.30 Attribute Handling for Bidirectional Model Transformations: The

Triple Graph Grammar CaseLeen Lambers, Stephan Hildebrandt, Holger Giese and FernandoOrejasBidirectional Transformations Meets Dynamic Updates: Promise &PerilsErwann WernliObservations Relating to the Equivalences Induced on Model Sets byBidirectional TransformationsPerdita Stevens

39

FICS

Saturday, 24 March

9.25-9.30 Opening9.30-10.30 Type-Based Termination, Inflationary Fixed-Points, and Mixed

Inductive-Coinductive Types [Invited talk]Andreas Abel

10.30-11.00 Coffee11.00-12.30 Cut-Elimination for the mu-Calculus with One Variable

Grigori Mints and Thomas StuderStructured General Corecursion and Coinductive GraphsTarmo UustaluCharacteristic Formulae for Relations with Nested Fixed PointsAnna Ingolfsdottir and Luca Aceto

12.30-14.00 Lunch

14.00-15.00 Higher-Order Model Checking [Invited talk]Luke Ong

15.00-15.30 Model-Checking the Higher-Dimensional Modal mu-CalculusMartin Lange and Etienne Lozes

15.30-16.00 Coffee16.00-17.00 IO vs OI in Higher-Order Recursion Schemes

Axel HaddadInitial Semantics for Strengthened SignaturesAndre Hirschowitz and Marco Maggesi

Please notice the transition to Daylight Saving Time between today and tomorrow.

40

FIT

Sunday, 25 March

9.00-9.45 An Interface and Component Algebra for Service-Oriented Design[Invited talk]Jose Luiz Fiadeiro

9.45-10.30 Show Me Your Friends and I Tell You Who You Are [Invited talk]Karsten Wolf

10.30-11.00 Coffee11.00-12.30 Sequentializing Parameterized Programs

Salvatore La Torre, P. Madhusudan and Gennaro ParlatoRole-Based Interface AutomataOana Andrei, Muffy Calder and Alice MillerRefinement for Transition Systems with ResponsesMarco Carbone, Thomas Hildebrandt, Hugo A. Lopez, Gian Perroneand Andrzej Wasowski

12.30-14.00 Lunch

14.00-14.45 Challenges and Solutions in Interface-Based Design of ComponentSystems [Invited talk]Rolf Hennicker

14.45-15.30 Beyond the Classical Modal Transition Systems [Invited talk]Jirı Srba

15.30-16.00 Coffee16.00-16.45 On Quantitative Modal Automata [Invited talk]

Axel Legay16.45-17.30 A Parametric Counterexample Approach for Robust Timed Specifi-

cations [Invited talk]Louis-Marie Traonouez

41

GT-VMT (Day 1)

Saturday, 24 March

9.25-9.30 Opening9.30-10.30 Generation of Meta Model Instances [Invited talk]

Gabriele Taentzer10.30-11.00 Coffee11.00-12.30 Optimizing Model-Based Software Product Line Testing with Graph

TransformationsAnthony Anjorin, Sebastian Oster, Ivan Zorcic and Andy SchurrVisual Contracts as Test Oracle in AGG 2.0Tamim Khan, Olga Runge and Reiko HeckelCoverage Criteria for Testing DMM SpecificationsSvetlana Arifulina, Chiristian Soltenborn and Gregor Engels

12.30-14.00 Lunch

14.00-15.30 Algebraic Approach to Timed Petri NetsKarsten Gabriel, Pascal Lingnau and Claudia ErmelModel Checking Communicating Processes: Run Graphs, GraphGrammars, and MSOAlexander HeußnerRemedy of Mixed Initiative Conflicts in Model-Based System Engi-neeringFenglin Han and Peter Herrmann

15.30-16.00 Coffee16.00-17.00 View-based Modelling and State-Space Generation for Graph Trans-

formation SystemsNiaz Arijo and Reiko HeckelGraph Passing in Graph TransformationAmir Hossein Ghamarian and Arend Rensink

Please notice the transition to Daylight Saving Time between today and tomorrow.

42

GT-VMT (Day 2)

Sunday, 25 March

9.00-10.30 Towards Alternating Automata for Graph LanguagesH. J. Sander Bruggink, Mathias Hulsbusch and Barbara KonigModeling Context with Graph AnnotationsPaolo Bottoni and Francesco Parisi-PresicceLayout Improvement in Diagram Editors by Automatic Ad-hoc Lay-outSonja Maier and Mark Minas

10.30-11.00 Coffee11.00-12.30 A Flattening Approach for Attributed Type Graphs with Inheritance

in Algebraic Graph TransformationChristine Natschlager and Klaus-Dieter ScheweIncremental Pattern Matching for Regular ExpressionsArash Jalaliv, Amir Hossein Ghamarian and Arend RensinkDiscussion

12.30-14.00 Lunch

14.00-15.00 Bidirectional Transformations with Graphical Constraints [Invitedtalk (joint with BX)]Juan de Lara

43

iWIGP

Sunday, 25 March

9.00-9.45 A Cryptographic Moving-Knife Cake-Cutting ProtocolYoshifumi Manabe and Tatsuaki Okamoto

9.45-10.30 Computing Nash Equilibrium in Wireless Ad Hoc Networks: ASimulation-Based ApproachSujata Ghosh, Thiri Haymar Kyaw, Sumit Sourabh and Rineke Ver-brugge

10.30-11.00 Coffee11.00-11.45 Rich Counter-Examples for Temporal-Epistemic Logic Model

CheckingSimon Busard and Charles Pecheur

11.45-12.30 SMT-Based Reactive Synthesis [Invited talk]Swen Jacobs

12.30-14.00 Lunch

14.00-14.45 Processes, Roles and Their InteractionsJohannes Reich

14.45-15.30 Quantitative Verification and Synthesis [Invited talk]Barbara Jobstmann

15.30-16.00 Coffee

44

MBT

Sunday, 25 March

9.25-9.30 Opening9.30-10.30 Model-Based Security Testing [Invited talk]

Ina Schieferdecker10.30-11.00 Coffee11.00-12.30 Test-Cases on Different Levels of Abstraction in a Model Based De-

velopment ToolJan Olaf Blech, Dongyue Mou and Daniel Ratiu ReusingTowards Symbolic Model-Based Mutation Testing. CombiningReachability and Refinement CheckingBernhard Aichernig and Elisabeth JobstlExact Gap Computation for Code Coverage Metrics in ISO-CDirk Richter and Christian Berg

12.30-14.00 Lunch

14.00-15.30 Constraint-Based Heuristic On-line Test Generation from Non-deterministic I/O EFSMsDanel Ahman and Marko KaarameesModel-Based Testing of Safety Critical Real-Time Control LogicSoftwareYevgeny Gerlits and Alexey KhoroshilovRule-based Test Generation with Mind MapsDimitry Polivaev

15.30-16.00 Coffee16.00-17.30 Applying SMT Solvers to the Test Template Framework

Maximiliano Cristia and Claudia FrydmanUsing Built-In Domain-Specific Modeling Support to Guide Model-Based Test GenerationTeemu Kanstren and Olli-Pekka PuolitaivalTalking Quiescence: A Novel, Rigorous Theory that Supports Paral-lel Composition, Action Hiding and DeterminisationGerjan Stokkink, Mark Timmer and Marielle Stoelinga

45

MSFP

Sunday, 25 March

9.00-10.00 Fibred Data Types [Invited talk]Neil Ghani

10.00-10.30 Step-Indexed Normalization for a Language with General RecursionChris Casinghino, Vilhelm Sjoberg and Stephanie Weirich

10.30-11.00 Coffee11.00-12.30 An Investigation of the Laws of Traversals

Mauro Jaskelioff and Ondrej RypacekEvaluation Strategies for Monadic ComputationsTomas PetricekTracing Monadic Computations and Representing EffectsMaciej Pirog and Jeremy Gibbons

12.30-14.00 Lunch

14.00-15.00 Dependently Typed Continuation Monads as Models in Logic [In-vited talk]Danko Ilik

15.00-15.30 From Mathematics to Abstract Machine: A Formal Derivation of anExecutable Krivine MachineWouter Swierstra

15.30-16.00 Coffee16.00-17.30 Parametric Compositional Data Types

Patrick Bahr and Tom HvitvedA Formal Comparison of Approaches to Datatype-Generic Program-mingJose Pedro Magalhaes and Andres LohIrrelevance, Heterogenous Equality, and Call-by-Value DependentType SystemsVilhelm Sjoberg, Chris Casinghino, Ki Yung Ahn, Nathan Collins,Harley D. Eades III, Peng Fu, Garrin Kimmell, Tim Sheard, AaronStump and Stephanie Weirich

46

VSSE

Sunday, 25 March

9.00-9.15 Welcome and Some Ideas from PINCETTE ProjectHana Chockler

9.15-9.45 Software Upgrade Checking Using Interpolation-Based FunctionSummariesOndrej Sery

9.45-10.30 Finding Races in Evolving Concurrent Programs Through Check-inDriven AnalysisAlastair Donaldson

10.30-11.00 Coffee11.00-11.45 SymDiff: Leveraging and Extending Program Verification Tech-

niques for Comparing ProgramsShuvendu K. Lahiri

11.45-12.30 Regression Verification for Multi-Threaded ProgramsOfer Strichman

12.30-14.00 Lunch

14.00-14.45 Empirical Analysis of Evolution of VulnerabilitiesFabio Massacci

14.45-15.30 Testing Evolving SoftwareAlex Orso

15.30-16.00 Coffee16.00-16.45 Automated Continuous Evolutionary Testing

Peter M. Kruse16.45-17.30 Discussion

47

WRLA (Day 1)

Saturday, 24 March

9.25-9.30 Opening9.30-10.30 Rigorous Component-Based System Design [Invited talk]

Saddek Bensalem, Ananda Basu, Marius Bozga, Paraskevas Bourgosand Joseph Sifakis

10.30-11.00 Coffee11.00-12.00 Design and Analysis of Cloud-Based Architectures with KLAIM and

Maude [Invited talk]Martin Wirsing, Jonas Eckhardt, Tobias Muhlbauer and JoseMeseguer

12.00-12.30 Some Like It Very Hot: Formal Modeling and Analysis of ExtremeHeat Exposure to the Human Body in HI-MaudeMuhammad Fadlisyah, Peter Csaba Olveczky and Erika Abraham

12.30-14.00 Lunch

14.00-15.30 Order-Sorted Equality Enrichments Modulo AxiomsRaul Gutierrez, Jose Meseguer and Camilo RochaA Rule-Based Framework for Building Superposition-Based Deci-sion ProceduresElena Tushkanova, Alain Giorgetti, Christophe Ringeissen and OlgaKouchnarenkoModelling and Analyzing Adaptive Self-Assembling Strategies withMaudeRoberto Bruni, Andrea Corradini, Alberto Lluch Lafuente, FabioGadducci, Andrea Vandin

15.30-16.00 Coffee16.00-17.00 Narrowing in Rewriting Logic and Applications [Invited talk]

Santiago Escobar17.00-17.30 Using Narrowing to Test Maude Specifications

Adrian Riesco

Please notice the transition to Daylight Saving Time between today and tomorrow.

48

WRLA (Day 2)

Sunday, 25 March

9.00-10.00 Analyzing PHP Source Code Using Rascal - A Rewriting Logic Per-spective [Invited talk]Mark Hills, Paul Klint and Jurgen Vinju

10.00-10.30 Specifying and Analyzing the Kademlia Protocol in MaudeIsabel Pita and Adrian Riesco

10.30-11.00 Coffee11.00-12.30 Timed CTL Model Checking in Real-Time Maude

Daniela Lepri, Erika Abraham and Peter Csaba OlveczkyModel Checking LTLR Formulas under Localized FairnessKyungmin Bae and Jose MeseguerState Space c-Reductions of Concurrent Systems in Rewriting LogicAlberto Lluch Lafuente, Jose Meseguer and Andrea Vandin

12.30-14.00 Lunch

14.00-15.00 The K Framework Distilled [Invited talk]Dorel Lucanu and Grigore Rosu

15.00-15.30 Bounded Model Checking of Recursive Programs with Pointers in KIrina Mariuca Asavoae, Frank de Boer, Marcello M. Bonsangue,Dorel Lucanu and Jurriaan Rot

15.30-16.00 Coffee16.00-17.30 Facilitating the Transformation of State Machines from Equations

into Rewrite RulesMin Zhang and Kazuhiro OgataMaking Maude Definitions More InteractiveAndrei Arusoaie, Traian Serbanuta, Chucky Ellison and GrigoreRosuClosing

49

Post-Conference Satellite Workshops: Programme

All workshops will take place in Building X of the campus of the Tallinn University ofTechnology (Akadeemia tee 3).

ACCAT

Sunday, 1 April

9.00-10.00 On Automorphisms of Graph-Like Objects and the Subobject Iso-morphism Problem [Invited talk]Tobias Heindel

10.00-10.30 Characterising van Kampen Squares via Descent DataHarald Konig, Uwe Wolter and Michael Lowe

10.30-11.00 Coffee11.00-12.00 Weak ω-groupoids in Type Theory [Invited talk]

Thorsten Altenkirch12.00-12.30 Transition Systems of Stochastic Process Languages

Diego Latella, Mieke Massink, E.P. De Vink

12.30-14.00 Lunch

14.00-15.30 A Comprehensive Study of an Algebraic Group Representation De-signed for the AI Classical Planning CalculusOlivier BartheyeDecorated Proofs for Computational Effects: StatesJean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude ReynaudSatisfaction, Restriction and Amalgamation of Constraints in theFramework of M-Adhesive CategoriesHanna Scholzel, Hartmut Ehrig, Maria Maximova, Karsten Gabriel,Frank Hermann

15.30-16.00 Coffee16.00-17.00 CT for BX: Category Theory Foundations for Bidirectional Model

Transformations [Invited talk]Zinovy Diskin

17.00-17.30 Discussion: Past and Future of ACCAT

50

AIPA (Day 1) (joint with SVARM)

Saturday, 31 March

9.00-10.30 Software Verification Using k-InductionPhilipp RummerA Decision Procedure for Skiplists with Unbounded Height andLengthCesar SanchezInterpolation for Resolution, Superposition and DPLL(Gamma+T)Maria Paola Bonacina

10.30-11.00 Coffee11.00-12.30 Combining Interactive and Automated Theorem Proving in Why3

[Invited talk]Jean-Christophe Filliatre

12.00-12.30 A Framework for Higher-Order Separation Logic in CoqJesper Bengtson

12.30-14.00 Lunch

14.00-15.30 Sharing the Burden of (Dis)proof with Nitpick, Quickcheck, andSledgehammer [Invited talk]Jasmin Blanchette

15.00-15.30 Synthesizing Software Verifiers from Proof RulesCorneliu Popeea

15.30-16.00 Coffee16.00-17.30 Building a Modern Concolic Tester

Tuomas LauniainenAutomated Synthesis of Geometric Construction ProceduresPredrag JanicicEfficient CTL Model-Checking for Pushdown SystemsFu Song

SVARM is a meeting of COST action IC0901 Rich Model Toolkit. It is not affiliated withETAPS.

51

AIPA (Day 2)

Sunday, 1 April

9.00-10.00 Using Satallax to Generate Proof Terms for Conjectures in Coq [In-vited talk (joint with SVARM)]Chad Brown

10.00-10.30 TFF1: The TPTP Typed First-Order Form with Rank-1 Polymor-phism [joint with SVARM]Jasmin Blanchette

10.30-11.00 Coffee11.00-12.30 No session (COST IC0901 MC meeting)

12.30-14.00 Lunch

14.00-15.30 Now f Is Continuous (Exercise!)Rob ArthanDeciding Regular Expression (In-)Equivalence in CoqDavid PereiraUnification in the Matita ITPClaudio Sacerdoti Coen

15.30-16.00 Coffee16.00-16.30 Heterogeneous-Equality-Free Compilation of Dependent Pattern-

MatchingPierre Boutillier

52

BYTECODE

Saturday, 31 March

9.00-10.00 Using Bytecode Transformation to Retrofit Fine-Grained SecurityPolicies on Unmodified Android [Invited talk]Jeff Foster

10.00-10.30 Embeddable Security-by-Contract Verifier for Java CardOlga Gadyatskaya, Eduardo Lostal and Fabio Massacci

10.30-11.00 Coffee11.00-12.00 Bytecode and Safety-Critical Systems: Friend or Foe? [Invited talk]

James Hunt12.00-12.30 Study, Formalisation, and Analysis of Dalvik Bytecode

Henrik Søndberg Karlsen, Erik Ramsgaard Wognsen, Mads ChristianOlesen and Rene Rydhof Hansen

12.30-14.00 Lunch

14.00-15.00 Quantitative Analysis of Java/.Net Like Programs to UnderstandHeap Memory Requirements [Invited talk]Diego Garbervetsky

15.00-15.30 Log-Based Lazy Monitoring of OSGi BundlesGiulio Caravagna, Gabriele Costa, Giovanni Pardini and Luca Wie-gand

15.30-16.00 Coffee16.00-17.00 Conditional Termination of Loops over Arrays

Elvira Albert, Samir Genaim and Guillermo Roman-DıezBCT: A Translator from MSIL to BoogieMichael Barnett and Shaz Qadeer (presented by Rustan Leino)

53

CMCS (Day 1)

Saturday, 31 March

9.25-9.30 Opening9.30-10.30 From Lawvere to Brandenburger-Keisler: Interactive Forms of Diag-

onalization and Self-Reference [Keynote talk]Samson Abramsky and Jonathan Zvesper

10.30-11.00 Coffee11.00-12.30 From Transitions to Executions

Eleftherios Matsikoudis and Edward LeeTrace Semantics via DeterminizationBart Jacobs, Alexandra Silva and Ana SokolovaStructural Operational Semantics for Continuous State ProbabilisticProcessesGiorgio Bacci and Marino Miculan

12.30-14.00 Lunch

14.00-14.30 Stream Automata Are CoalgebrasVincenzo Ciancia and Yde Venema

14.30-15.30 On Coalgebraic Logic over Posets [Short contribution]Adriana Balan, Alexander Kurz and Jirı VelebilCoalgebraic Dynamic Quantum Logic [Short contribution]Jort Bergfeld, Kohei Kishida and Sonja SmetsState-Based Simulation of Linear Course-of-Value Iteration [Shortcontribution]Baltasar Trancon y Wideman

15.30-16.00 Coffee16.00-17.20 Nondeterminism as a First Class Citizen for Hidden Logic [Short

contribution]Daniel Gebler and Jorg EndrullisFinal Coalgebras in Categories with Factorization Systems [Shortcontribution]Giorgio BacciWeak Bisimulations for Coalgebras over Ordered Functors [Shortcontribution]Tomasz BrengosReflexive Economics and Categorical, Coalgebraic and Domain The-oretical Modelling [Short contribution]Viktor Winschel

54

CMCS (Day 2)

Sunday, 1 April

9.00-10.00 Defining Context-Free Power Series Coalgebraically [Invited talk]Marcello Bonsangue, Jan Rutten and Joost Winter

10.00-10.30 On Finitary Functors and Their PresentationsJirı Adamek, Stefan Milius and Lawrence Moss

10.30-11.00 Coffee11.00-11.30 Tracing the Man in the Middle in Monoidal Categories

Dusko Pavlovic11.30-12.30 Lindenmayer Systems, Coalgebraically [Short contributions]

Baltasar Trancon y Widemann and Joost WinterDistributive Laws of Directed Containers [Short contributions]Danel Ahman and Tarmo UustaluThe Ball Monad and Its Metric Trace Semantics in Kleisli Categories[Short contributions]Bart Jacobs and Frank Roumen

12.30-14.00 Lunch

14.00-15.00 Relational Presheaves as Labelled Transition Systems [Invited talk]Paweł Sobocinski

15.00-15.30 Permutations in Coinductive Graph RepresentationCelia Picard and Ralph Matthes

15.30-16.00 Coffee16.00-17.30 Internal Models for Coalgebraic Modal Logics

Toby WilkinsonAn alpha-Corecursion Principle for the Infinitary Lambda CalculusAlexander Kurz, Daniela Petrisan, Paula Severi and Fer-Jan de VriesLax Extensions of Coalgebra FunctorsJohannes Marti and Yde Venema

55

DICE (Day 1)

Saturday, 31 March

9.25-9.30 Opening9.30-10.30 Computation by Interaction for Structuring Resource Bounded Com-

putation [Invited talk]Ulrich Schopp

10.30-11.00 Coffee11.00-12.30 Quantitative Classical Realizability for Side Effects and Recursive

TypesAlois Brunel and Antoine MadetA Bounded Linear Type Theory for Encapsulated StateJames Laird and Pierre ClairambaultA Polytime Lambda-Calculus Based on Linear Logic by LevelsAndrei Dorman and Damiano Mazza

12.30-14.00 Lunch

14.00-15.30 A Complete Polynomial lambda CalculusSimona Ronchi Della Rocca and Erika De BenedettiDeep into Optimality: Complexity and Correctness of Sharing Im-plementation of Bounded LogicsStefano Guerrini, Thomas Leventis and Marco SolieriOn the Invariance of Derivational Complexity for Head ReductionBeniamino Accattoli and Ugo Dal Lago

15.30-16.00 Coffee16.00-17.00 A New Path Order that Induces Tight Polynomial Derivation Length

Martin Avanzini, Naohi Eguchi and Georg MoserHigher-Order Interpretations and Program ComplexityPatrick Baillot and Ugo Dal Lago

17.00-18.00 Business Meeting

56

DICE (Day 2)

Sunday, 1 April

10.30-11.00 Coffee11.00-12.00 Implicit Complexity for Functional Reactive Programs [Invited talk]

Neelakantan R. Krishnaswami12.00-12.30 Recursion and Induction for Computational Complexity

Reinhard Kahle and Isabel Oitavem

12.30-14.00 Lunch

14.00-15.30 Realizability Models for dlPCFAlois Brunel and Marco GaboardiToward a Bounded Linear Type system for PCF in Call-by-valueBarbara PetitOn the Expressivity of Linear Logic Subsystems Characterizing Poly-nomial TimeMatthieu Perrinel

15.30-16.00 Coffee

57

FESCA

Saturday, 31 March

9.25-9.30 Opening9.30-10.30 Modeling of Event-Based Communication in Component-based Ar-

chitectures: State-of-the-Art and Future Directions [Invited talk]Samuel Kounev

10.30-11.00 Coffee11.00-12.30 Behavioral Refinement and Compatibility of Statechart Extensions

Christian PrehoferFrom Timed Reo Networks to Networks of Timed AutomataNatallia Kokash, Mohammad Mahdi Jaghoori and Farhad ArbabA Model Slicing Method for Workflow VerificationFazle Rabbi, Hao Wang, Wendy MacCaull and Adrian Rutle

12.30-14.00 Lunch

14.00-15.30 Assembling Components Using SysML with Non-Functional Re-quirementsSamir Chouali, Ahmed Hammad and Hassan MountassirIncorporating Formal Techniques into Industrial Practice: An Expe-rience ReportAmmar Osaiweran, Mathijs Schuts, Jozef Hooman and Jacco Wes-seliusA Design Tool for Service-Oriented Systems [Tool paper]Eduard Enoiu, Raluca Marinescu, Aida Causevic and Cristina Sece-leanu

15.30-16.00 Coffee16.00-17.30 SOFA 2 Component Framework and Its Ecosystem [Tutorial]

Michal Malohlava

58

GRAPHITE

Sunday, 1 April

9.25-9.30 Opening9.30-10.30 Graph Transformation with Time for Domain-Specific Modelling and

Simulation [Invited talk]Juan de Lara

10.30-11.00 Coffee11.00-12.30 A Comparison of Sequential and GPU Implementations of Iterative

Methods to Compute Reachability ProbabilitiesElise Cormie-BowinsEfficient Instantiation of Parameterised Boolean Equation Systems toParity GamesGijs Kant and Jaco van de PolLex-Partitioning: A New Option for BDD SearchStefan Edelkamp, Peter Kissmann and Alvaro Torralba Arias deReyna

12.30-14.00 Lunch

14.00-15.00 Logic without Formulas: Automata as a Computational Notation [In-vited talk]Pierre Wolper

15.00-15.30 Graph Subsumption in Abstract State Space ExplorationEduardo Zambon, Arend Rensink

15.30-16.00 Coffee16.00-17.00 Graphs in Bioinformatics and Social Networks [Invited talk]

Jaak Vilo17.00-17.30 A Structural Analysis of the A5/1 State Transition Graph

Andreas Beckmann, Jaroslaw Fedorowicz, Jorg Keller and UlrichMeyer

59

HAS

Saturday, 31 March

9.00-9.45 Efficient Computing in Cyber-Physical SystemsPeter Marwedel

9.45-10.30 Arenas of Finite State Machines and their Application to the Mod-elling and Analysis of Air Traffic Management SystemsGiordano Pola

10.30-11.00 Coffee10.30-11.15 Towards a Formal Basis of Robust Behaviour

Martin Franzle11.15-12.00 Hybrid Behaviour of Continuous Time Markov Chains

Luca Bortolussi

12.30-13.30 Lunch

13.30-14.30 Hard Real-Time. Probably ProvableHolger Hermanns

14.30-15.30 Analyzing Execution Semantics of High-level Formalisms for Mod-elling Hybrid Dynamic SystemsPieter Mosterman

15.30-16.00 Coffee16.00-17.45 A Resource-Aware Framework for Embedded System Design and Its

Extension Towards AdaptivityCristina Seceleanu

16.45-17.30 Verifying Reasoning within Agent-based Hybrid Control SystemsLouise Dennis

17.30-18.00 Discussions

60

LDTA (Day 1)

Saturday, 31 March

9.25-9.30 Opening9.30-10.30 Programming Language Approaches to Bidirectional Transformation

[Invited talk]Janis Voigtlander

10.30-11.00 Coffee11.00-12.30 A Language Generic Solution for Name Binding Preservation in

RefactoringsMaartje De Jonge and Eelco VisserFrom HOT to COOL – Transforming Higher-Order Typed Languagesto Concept-Constrained Object-Oriented LanguagesDaniel Lincke, Sibylle SchuppModel Transformations with TomJean-Christophe Bach, Xavier Cregut, Pierre-Etienne Moreau, MarcPantel

12.30-14.00 Lunch

14.00-15.30 Grammar Fragments Fly First-ClassMarcos Viera, Doaitse Swierstra and Atze DijkstraUUAG Meets AspectAG: How to Make Attribute Grammars First-ClassMarcos Viera, Doaitse Swierstra and Arie MiddelkoopLanguage Composition UntangledSebastian Erdweg, Paolo G. Giarrusso and Tillmann Rendel

15.30-16.00 Coffee16.00-17.30 Tool Challenge Report and Discussion

Eric van Wyk

61

LDTA (Day 2)

Sunday, 1 April

9.00-10.30 LDTA@ETAPS RetrospectiveMark van den Brand

10.30-11.00 Coffee11.00-12.30 Declarative Specification of Template-Based Textual Editors

Tobi Vollebregt, Lennart C. L. Kats and Eelco VisserNotation-Parametric Grammar RecoveryVadim ZaytsevImproving Precision of Generated ASTsJohnni Winther

12.30-14.00 Lunch

14.00-15.30 Verification of Model TransformationsSuzana AndovaFormal Verification of GrammarwareAnthony SloaneClosing

15.30-16.00 Coffee

62

LINEARITY

Sunday, 1 April

9.25-9.30 Opening9.30-10.30 The Geometry of Types [Invited talk]

Ugo Dal Lago10.30-11.00 Coffee11.00-12.30 Standardization in Resource Lambda Calculus

Maurizio Dominici, Simona Ronchi Della Rocca and Paolo Tran-quilliExtending the Interaction Nets Calculus by Generic RulesEugen JireschHigher-Order Port-Graph RewritingMaribel Fernandez and Sebastien Maulat

12.30-14.00 Lunch

14.00-15.00 Linear Types in Programming Languages: Progress and Prospects[Invited talk]Simon Gay

15.00-15.30 Linearly Refined Session TypesPedro Baltazar, Dimitris Mostrous, Vasco Vasconcelos

15.30-16.00 Coffee16.00-17.30 Relating Reasoning Methodologies in Linear Logic and Process Al-

gebraYuxin Deng, Iliano Cervesato, Robert SimmonsA Linear Analysis of Call-by-Value Lambda CalculusBeniamino AccattoliLinear Dependent Types with Local VariablesPaolo Torrini

63

PLACES

Saturday, 31 March

9.00-10.30 Work-Streaming Compilation of FuturesAntoniu Pop and Albert CohenVariant-Frequency Semantics for Green FuturesYu David LiuAn Event-Based Model for ContractsMassimo Bartoletti, Tiziana Cimoli, G. Michele Pinna and RobertoZunino

10.30-11.00 Coffee11.00-12.30 Stratified Protocols in Session-Types

Romain DemangeonMerging Multiparty Protocols in Multiparty ChoreographiesMarco Carbone and Fabrizio MontesiQIRAL: A High Level Language for Lattice QCD Code GenerationDenis Barthou, Gilbert Grosdidier, Michael Kruse, Olivier Pene,Claude Tadonki

12.30-14.00 Lunch

14.00-15.00 Can GPGPU Programming Be Liberated from the Data Parallel Bot-tleneck? A Style of Braided Parallelism and its Programs [Invitedtalk]Benedict Gaster

15.00-15.30 Mapping the Join Calculus to Heterogeneous HardwarePeter Calvert and Alan Mycroft

15.30-16.00 Coffee16.00-17.30 Specifying Stateful Asynchronous Properties for Distributed Pro-

gramsTzu-Chun Chen and Kohei HondaModularizing and Specifying Protocols among ThreadsSung-Shik T.Q. Jongmans and Farhad ArbabTyping Context-Dependent Behavioural VariationPierpaolo Degano, Gianluigi Ferrari, Letterio Galletta and GianlucaMezzetti

64

QAPL (Day 1)

Saturday, 31 March

9.25-9.30 Opening9.30-10.30 UPPAAL-SMC: Statistical Model Checking for Priced Timed Au-

tomata [Invited talk]Peter Bulychev, Alexandre David, Kim Guldstrand Larsen, MariusMikucionis, Danny Bøgsted Poulsen, Axel Legay, Zheng Wang

10.30-11.00 Coffee11.00-12.30 Efficient Computation of Exact Solutions for Quantitative Model

CheckingSergio GiroMeasuring Progress of Probabilistic LTL Model CheckingElise Cormie-Bowins and Franck van BreugelAutomated Verification of Quantum Protocols using MCMASFrancesco Belardinelli, Pavel Gonzalez and Alessio Lomuscio

12.30-14.00 Lunch

14.00-15.00 Mean Field and Fluid Approaches to Markov Chain Analysis [Invitedtalk]Jeremy Bradley

15.00-15.30 A Logic for Model-Checking of Mean-Field ModelsAnna Kolesnichenko, Anne Remke, Pieter-Tjerk de Boer andBoudewijn Haverkort

15.30-16.00 Coffee16.00-17.00 Efficient Modelling and Generation of Markov Automata

Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol and Marielle I.A. StoelingaTowards Fluid Model CheckingLuca Bortolussi and Jane Hillston

65

QAPL (Day 2)

Sunday, 1 April

9.30-10.30 Quantitative Side-Channels in RSA and AES [Invited talk]Boris Kopf

10.30-11.00 Coffee11.00-12.30 A Non-Local Method for Robustness Analysis of Floating Point Pro-

gramsIvan Gazeau, Dale Miller and Catuscia PalamidessiQuantitative Information Flow as Safety and Liveness Hyperproper-tiesHirotoshi Yasuoka and Tachio TerauchiDifferential Privacy for Relational Algebra: Improving the Sensitiv-ity Bounds via Constraint SystemsCatuscia Palamidessi and Marco Stronati

12.30-14.00 Lunch

14.00-15.30 Hybrid Performance Modelling of Opportunistic NetworksLuca Bortolussi, Vashti Galpin and Jane HillstonWeak Markovian Bisimulation Congruences and Exact CTMC-LevelAggregations for Concurrent ProcessesMarco BernardoWhy Confluence Reduction is Better than Partial Order Reduction inProbabilistic and Non-Probabilistic Branching TimeHenri Hansen and Mark Timmer

15.30-16.00 Coffee

66

Conference Venues

The main conference sessions will take place in the conference center of SwissotelTallinn (Tornimae 3), 6th floor.

Swissotel is in Tallinn’s new “city” where there are a number of tall buildings. It is lessthan 1 km from the Old Town.

Registration will take place in the conference center, the desk will be open from 8.00 on26–28 March, from 8.30 on 29–30 March.

Lunches (stand-up buffet) and coffee breaks will be served in the foyer of the conferencecenter.

Swissotel and Elion will provide ETAPS participants with wireless internet access on theconference floor.

The hotel has a cafe in the lobby, another one on the 8th floor and a restaurant with greatviews on the 30th floor. ETAPS participants are welcome to use their services.

The satellite workshops will all take place on the campus of Tallinn University of Tech-nology in Mustamae, approx 7 kms from the city center, but easily reached by publictransport.

The workshops will be held in the building of the Tallinn School of Economics and Busi-ness Administration, Building X (“X” for no. 10) of the university (Akadeemia tee 3).

The registration desk will be near the workshop rooms. It will be open from 8.30 on 24March, from 8.00 on 25 March, and from 8.30 on 31 March and 1 April.

Coffee breaks will be served near the workshop rooms. Lunches will be served in thecafeteria of the TUT Library, Building R (“R” for Raamatukogu, i.e., Library) and in thecafeteria of Building X. The two buildings are connected by a passageway on the 2ndfloor (as are multiple other buildings of the campus). You must show your badge to getyour food.

In both buildings X and R you can access the internet either via TUT free public wifinetworks or via Eduroam.

The TUT campus is reached from the city by trolleybuses no. 3 (stop “Keemia”, closest),no. 4 (stop “Ehitajate tee”, almost as close), no. 1, 2, 5 (stop “Akadeemia tee”, furthest).All these trolleybuses go every 10..15 minutes, also on Saturday and Sunday mornings.The travel time is about 25 minutes, depending on the line and where exactly you get onthe trolleybus.

Good stops for catching these trolleybuses in the city center are “Kaubamaja” (trolley-buses no. 1, 3), “Estonia” (National Opera, 2), “Vabaduse valjak” (Freedom square, 1, 2,3), “Tonismagi” (1), “Hotell Tallinn” (1), “Balti jaam” (Railway station, 4, 5).

NB. Route numbers for bus, tram and trolleybus lines overlap, so trolleybus line no. 2 isnot the same as bus no. 2 or tram no. 2.

67

Social Event Places

On Monday, 26 March, all main conference particants are invited to the ETAPS 2012 wel-come reception at the historic House of the Brotherhood of the Blackheads (Mustpeademaja, Pikk 26) in the Old Town. This event is included in the standard main conferenceregistration fee. Do not worry about the amount of food, you will not need to eat dinnerbefore or after the reception.

The ETAPS 2012 banquet will take place at the Song Festival Grounds (Lauluvaljak,Narva mnt 95) in Kadriorg on Wednesday, 28 March.

On Sunday, 25 March, the pre-conference workshop dinner will be held at RestaurantMaikrahv (Raekoja plats 8) in the very center of the Old Town.

The post-conference workshop dinner will be on Saturday, 31 March, at Olde Hansa(Vana turg 1), Tallinn’s medieval restaurant, just a few steps from the Town Hall Square.The CMCS workshop dinner will be held at the same time at MEKK Ateljee in HotelBern (Aia 10), just outside the Old Town.

The banquet and workshop dinners are not included in the main conference or workshopregistration fees.

All social events start at 20.00.

NB. Please bring your ticket with you to the event.

All social event locations, except for that of the banquet on Wednesday, 28 March—theSong Festival Grounds—are within walking distance from all central hotels. See the mapson the following pages.

The Song Festival Grounds (Narva mnt 95) is about 3 kms from the city centre.

We have arranged for chartered buses to the banquet. These will depart from SwissotelTallinn (Tornimae 3) and from the Russian Cultural Center (Vene Kultuurikeskus, Merepst 5, a central spot) at 19.40. You can also get back to your hotel by a chartered bus.

If you want to come on your own by public transport, you can take any of the buses no.1A, 5, 8, 34A or 38 to the stop “Lauluvaljak”.

68

Map 1 (center)

Sw

issôte

l

v

v

Bus t

o b

anquet

Bus t

o b

anquet

MEKK A

teljee

Mustp

eade M

aja

Old

e H

ansa

Maik

rahv

69

Map 2 (Mustamae)

Lib

rary

entr

ance

Buildin

g X

entr

ance

Institu

te o

f C

ybern

etics a

t T

UT

TT

Ü K

ÜB

ER

NE

ET

IKA

IN

ST

ITU

UT

70

Map 3 (Kadriorg)

Laulu

väljak

Laulu

väljak

Song F

estival G

rounds

Oru

Oru

J. P

oska

J. P

oska

Sw

issôte

l

v

v

Tallin

na Ü

likool

Uus-S

adam

a

Viru K

eskusPro

nksi

Pro

nksi

71

Practicalities

Wireless internet is available for free in very many places in Estonia. Tallinn is packedwith public wifi hotspots (some 375 in all Tallinn, around 200 in the center). In particular,you should be able to connect yourself in any decent cafe.

In Estonia, we use bank cards a lot, to pay even the smallest amounts of money and wecarry very little cash (only in cities, however). Card payments are generally very safe.

ATMs in Estonia first give you your money and only then return your card. In fact, youmust explicitly ask the machine to return your card. Do not leave your card in the machine.

While the public transport network in Tallinn is useful and efficient, you must be carefulwith taxis. The tariffs of opportunist drivers can be 2..5 times higher than normal. Usually,these are properly displayed on a large yellow sticker on the rear passenger window of thecar, and if you did not pay attention, it was your fault. Know the right rates, order yourtaxi by phone or ask the hotel.

Smoking is restricted. You cannot smoke in public places, restaurants etc. Designatedsmoking areas are rare. Mostly you must smoke out on the street.

72