ETAPS 2014 Programme Saturday April 5th

Saturday, April 5th
09h00 - 10h30
CMCS
Room: F320
  • Davide Sangiorgi. Higher-order languages: bisimulation and coinductive techniques (invited talk)
DICE
Room: F316
  • Akitoshi Kawamura. Applying higher-type complexity to analysis (invited talk)
GRAPHITE
Room: F116
  • Radu Mateescu. Walking Back and Forth in Labelled Transition Systems (invited talk)
GTVMT
Room: F018
  • Philippe Palanque. Model-Based Engineering of Resilient Interactive Systems (invited talk)
HOTSPOT
Room: F112
  • Mark Ryan and Jia Liu. Verifiably accountable surveillance
  • Lili Xu, Konstantinos Chatzikokolakis, Huimin Lin and Catuscia Palamidessi. Metrics for Differential Privacy in Concurrent Systems
  • Chiara Bodei, Pierpaolo Degano, Letterio Galletta and Francesco Salvatori. Here you can't: context-aware security
SR
Room: F309
  • Thomas Henzinger. Simulation Games (invited talk)
VSSE
Room: F114
  • Leon Moonen. Model-based information flow analysis to support software certification
  • Arie Gurfinkel. Verifying Programs with Evolving (Under)-Approximations
WRLA
Room: F022
  • Peter Ölveczky. Real-Time Maude and its Applications (invited talk)
  • Si Liu, Peter Csaba Ölveczky and José Meseguer. A Framework for Mobile Ad hoc Networks in Real-Time Maude
10h30 - 11h00 Coffee Break
11h00 - 12h30
CMCS
Room: F320
  • Sebastian Enqvist and Joshua Sack. A coalgebraic view of characteristic formulas in equational modal fixed point logic
  • H. Peter Gumm and Mehdi Zarrad. Coalgebraic simulations and congruences
  • Wolfram Kahl. Categories of coalgebras with monadic homomorphisms
DICE
Room: F316
  • Patrick Baillot, Erika De Benedetti and Simona Ronchi Della Rocca. Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
  • Brian Redmond. Soft Linear Logic and the Polynomial Hierarchy
GRAPHITE
Room: F116
  • Gijs Kant and Jaco Van De Pol. Generating and Solving Symbolic Parity Games
  • Maribel Fernandez, Helene Kirchner and Bruno Pinaud. Strategic portgraph rewriting: an interactive modelling and analysis framework
  • Roi Blanco, Paolo Boldi and Andrea Marino. Entity-Linking via Graph-Distance Minimization
GTVMT
Room: F018
  • Frederik Deckwerth and Gergely Varro. Generating Preconditions from Graph Constraints by Higher Order Graph Transformation
  • Paolo Bottoni, Andrew Fish, Alexander Heußner and Francesco Parisi-Presicce. Modeling Spider Diagrams with Resources
HOTSPOT
Room: F112
  • Massimo Bartoletti, Alceste Scalas and Roberto Zunino. Towards a theory of honesty
  • Davide Basile, Pierpaolo Degano and Gian-Luigi Ferrari. Automata for Service Contracts
  • Pedro Adão, Claudio Bozzato, Gian-luca Dei Rossi, Riccardo Focardi and Flaminia Luccio. A semantic based tool for firewall configuration
SR
Room: F309
  • Véronique Bruyère, Emmanuel Filiot, Mickael Randour and Jean-Francois Raskin. Expectations or Guarantees? I Want It All! A crossroad between games and MDPs
  • Lluis Godo and Enrico Marchioni. Games for the Strategic Influence of Expectations
  • Wojtek Jamroga, Matthijs Melissen, and Henning Schnoor. Defendable Security in Interaction Protocols
VSSE
Room: F114
  • Barbara Jobstmann. Program Repair without Regret
  • K. Rustan M. Leino. Programming in Stages
WRLA
Room: F022
  • Kyungmin Bae and Jose Meseguer. Infinite-State Model Checking of LTLR Formulas Using Narrowing
  • Thomas Genet. Towards Static Analysis of Functional Programs using Tree Automata Completion
  • Salvador Lucas and Jose Meseguer. 2D Dependency Pairs for Proving Operational Termination of CTRSs
12h30 - 14h00 Lunch
14h00 - 16h00
CMCS
Room: F320
  • Paul Andre Mellies. The algebraic and coalgebraic sides of game semantics
  • Marina Lenisa. Coalgebraic games (invited talk)
DICE
Room: F316
  • Georg Moser. Automated Complexity Analysis Based on the Dependency Pair Method (invited talk)
  • Martin Avanzini and Naohi Eguchi. A New Term Rewriting Characterisation of ETIME functions
GRAPHITE
Room: F116
  • Giorgio Delzanno, Arend Rensink and Riccardo Traverso. Graph- versus Vector-Based Analysis of a Consensus Protocol
  • William Mansky, Dennis Griffith and Elsa Gunter. Specifying and Executing Optimizations for Parallel Programs
  • Valerio Senni and Michele Stawowy. Backwards State-space Reduction for Planning in Dynamic Knowledge Bases
  • Steffen Ziegert. Graph Transformation Planning via Abstraction
GTVMT
Room: F018
  • Erhan Leblebici, Anthony Anjorin, Andy Schürr, Stephan Hildebrandt, Jan Rieke and Joel Greenyer. A Comparison of Incremental Triple Graph Grammar Tools
  • Eduardo Zambon and Arend Rensink. Solving the N-Queens Problem with GROOVE - Towards a Compendium of Best Practices
HOTSPOT
Room: F112
  • David Naccache. New Algorithmic Approaches to Point Constellation Recognition (invited talk)
  • Afonso Arriaga, Qiang Tang and Peter Ryan. Trapdoor Privacy in Asymmetric Searchable Encryption Schemes
  • Jiangshan Yu, Vincent Cheval and Mark Ryan. DTKI: Distributed transparent key infrastructure
SR
Room: F309
  • Francesco Belardinelli. Reasoning about Knowledge and Strategies: Epistemic Strategy Logic
  • Xiaowei Huang and Ron van der Meyden. An Epistemic Strategy Logic
  • Alessio Lomuscio. TBA (invited talk)
VSSE
Room: F114
  • Fabrizio Pastore. Verification-Aided Regression Testing
  • Margus Veanes. Applications of Symbolic Finite Automata
  • Grigory Fedyukovich. Producing Effective Interpolants for SAT-based Incremental Verification and Upgrade Checking
WRLA
Room: F022
  • Cesare Tinelli. Extending SMT solving with constrained deduction and rewrite rules (invited talk)
  • Camilo Rocha, José Meseguer and Cesar Munoz. Rewriting Modulo SMT and Open System Analysis
  • Luis Aguirre, Narciso Marti-Oliet, Miguel Palomino and Isabel Pita. Conditional Narrowing Modulo in Rewriting Logic and Maude
16h00 - 16h30 Coffee Break
16h30 - 18h00
CMCS
Room: F320
  • Pierre Lescanne. Coinduction, equilibrium and escalation, or the rationality of madness
  • Henning Basold, Helle Hvid Hansen and Jan Rutten. A note on typed behavioural differential equations
  • Baltasar Trancón Y Widemann and Markus Lepper. Foundations of total functional data-flow programming, coinductively
DICE
Room: F316
  • Beniamino Accattoli and Ugo Dal Lago. Beta Reduction is Invariant, Indeed
GTVMT
Room: F018
  • Mudhafar Hussein, Reiko Heckel, Vincent Danos and Pawel Sobocinski. Modelling Adaptive Networks: The Case of the Petrified Voters
  • Jan Stückrath and Benjamin Weyers. Lattice-extended Coloured Petri Net Rewriting for Adaptable User Interface Models
HOTSPOT
Room: F112
  • Miriam Paiola and Bruno Blanchet. From the Applied Pi Calculus to Horn Clauses for Protocols with Lists
  • Vincent Cheval and Veronique Cortier. Timing attacks: symbolic framework and proof techniques
  • Ghazi Maatoug, Frédéric Dadeau and Michaël Rusinowitch. Model-Based Vulnerability Testing of Payment Protocol Implementations
SR
Room: F309
  • Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, and Jean-Francois Raskin. Doomsday Equilibria for Omega-Regular Games
  • Patricia Bouyer, Nicolas Markey, and Steen Vester. Nash Equilibria in Symmetric Games with Partial Observation
WRLA
Room: F022
  • Salvador Lucas and Jose Meseguer. Strong and Weak Operational Termination of Order-Sorted Rewrite Theories
  • Dominik Klein. Key-Secrecy of PACE with OTS/CafeOBJ
  • Si Liu, Muntasir Raihan Rahman, Stephen Skeirik, Indranil Gupta and José Meseguer. Formal Modeling and Analysis of Cassandra in Maude
  • Irina Mariuca Asavoae, Mihail Asavoae and Adrian Riesco. Towards a Formal Semantics-Based Technique for Interprocedural Slicing

Who's online

We have 56 guests and no members online

Site Hosted by