Talks

All talks are available via our talks feed. Our news feed additionally updates you on upcoming events, open positions, …

Date Speaker Topic
Fri, Jun 14 2013 Joel Ouaknine A Survey of Classical and Real-Time Verification
Tue, Jun 04 2013 Christoph Weidenbach The Design of Automated Reasoning Systems
Thu, May 23 2013 Alexey Gotsman Abstraction for Weakly Consistent Systems
Thu, May 23 2013 Doron Peled Concurrent Software Synthesis: Old Challenge - New Ideas
Thu, May 16 2013 Donald Knuth All questions answered
Thu, Apr 18 2013 Peter Robinson Sublinear Bounds for Randomized Leader Election
Mon, Apr 15 2013 Andre Platzer How to Prove Your Robot Safe
Mon, Apr 22 2013 Hubie Chen Meditations on Quantified Constraint Satisfaction
Thu, Apr 11 2013 Wilfried Steiner Model-Checking Fault-Tolerant Clock Synchronization Protocols
Thu, Mar 07 2013 Reiner Hähnle Abstract Symbolic Execution
Thu, Mar 28 2013 Torsten Schaub Potassco, the Potsdam Answer Set Solving Collection.
Mon, Feb 25 2013 EunJung Kim Linear kernels and single-exponential algorithms via protrusion decompositions
Thu, Feb 21 2013 Diego Calvanese Verification of Relational Data-Centric Dynamic Systems with External Services
Tue, Mar 05 2013 Pietro Baroni Abstract argumentation semantics: from limits to perspectives
Mon, Feb 25 2013 Loris Bozzato CKR: a general framework for context in Semantic Web
Wed, Jan 30 2013 Samanta Roopsha Robustness Analysis of Networked Systems
Thu, Jan 31 2013 Javier Esparza Parameterized Verification of Asynchronous Shared-Memory Systems
Thu, Jan 17 2013 Alexander Pretschner Model-Based Security Testing: From Models to the Real World
Thu, Dec 13 2012 Andrey Rybalchenko Program verification as constraint solving (also for existential and universal CTL properties)
Thu, Nov 29 2012 Tomer Kotek Applications of logic in graph theory: definability of graph invariants
Tue, Nov 20 2012 Madalina Erascu Computational Logic and Quantifier Elimination Techniques for (Semi-)automatic Static Analysis and Synthesis of Algorithms
Thu, Jan 01 1970 Christoph Lenzen Fast Routing Table Construction Using Small Messages
Thu, Nov 15 2012 Miroslaw Truszczynski Connecting first-order ASP and the logic FO(ID) through reducts
Mon, Nov 05 2012 James Delgrande Revising Horn Theories
Mon, Oct 22 2012 Andreas Griesmayer Model checking Business Processes with Multi-Agent Systems
Tue, Oct 16 2012 Leonid Libkin Graph Logics and Relations on Words
Tue, Oct 02 2012 Robert Ganian Generalizing vertex cover as a graph parameter
Tue, Sep 04 2012 Xavier Rival MemCAD, a Modular Abstract Domain for Reasoning on Memory States
Tue, Aug 28 2012 Workshop on Logic and Algebra
Mon, Aug 13 2012 Florent Madelaine On the complexity of the model checking problem for syntactic fragments of first-order logic
Mon, Jun 25 2012 Iyad Kanj What makes normalized weighted satisfiability tractable
Fri, Jun 22 2012 Ruslan L. Smeliansky Computer Systems Laboratory – Skills, Experience, Main Research Directions
Wed, Jun 20 2012 Werner Dietl Verification Games: Making Verification Fun
Thu, Jun 14 2012 Ana Sokolova Quantitative Relaxation of Concurrent Data Structure
Fri, Jun 01 2012 Vladimir Zakharov Automata-theoretic approach to the equivalence checking problem for sequential programs
Thu, May 31 2012 Vladimir Zakharov Equivalence Checking Problem: 1953 - 2011 (survey)
Wed, Jun 06 2012 Stefan Szeider Mini-Workshop on Logic, Proofs and Algorithms
Wed, May 30 2012 Nikolaj Bjorner Taking Satisfiability to the Next Level with Z3
Fri, May 25 2012 Byron Cook A New Approach to Temporal Property Verification
Wed, May 30 2012 Justyna Petke On the bridge between Constraint Satisfaction and Boolean Satisfiability
Mon, May 21 2012 Neeldhara Misra From FVS to F-deletion: the Story of a Simple Algorithm
Mon, May 07 2012 Hubie Chen Decomposing First-Order Logic
Thu, Apr 26 2012 Christoph Lenzen Improved Bounds for Byzantine Self-stabilizing Clock Synchronization
Fri, May 04 2012 Concepts and Meaning -- Workshop in honour of Alexander Leitsch's 60th Birthday
Tue, Apr 24 2012 Meghyn Bienvenu On the compexity of querying data through ontologies
Fri, Apr 13 2012 TUTORIAL: Social Choice - problems, results, tools and recent extensions
Fri, Mar 23 2012 Simone Bova Expression Complexity of Conjunctive Queries
Wed, Mar 28 2012 Giorgio Levi Abstract interpretation: from theory to applications
Thu, Mar 15 2012 Jasmin Fisher From Coding the Genome to Algorithms Decoding Life
Thu, Mar 08 2012 Laura Kovacs Playing in the Grey Area of Proofs
Thu, Mar 08 2012 Ana Sokolova Course on Coalgebra in Computer Science
Mon, Mar 12 2012 Johannes Fürnkranz Course on Inductive Rule Learning
Tue, Feb 21 2012 Daniel Paulusma Lift Contractions
Mon, Feb 13 2012 Olga Tveretina Relative Efficiency of Propositional Proof Systems Based on Resolution and OBDDs
Wed, Jan 25 2012 Edmund M. Clarke 30 Years of Model Checking
Wed, Jan 25 2012 Joao Marques-Silva Practical Algorithms for Minimal Unsatisfiable Core Extraction
Wed, Jan 25 2012 Georg Weissenbacher Battling Bugs with Interpolants
Wed, Jan 25 2012 Fedor V. Fomin Kernelization Algorithms
Wed, Jan 25 2012 Thomas A. Henzinger Formal Specification and Verification of Markovian Population Models
Tue, Jan 10 2012 Moritz Müller On lower bounds for Res(k)
Sat, Sep 03 2011 Daniel Lokshtanov Generalization and Specialization of Kernelization
Fri, Sep 02 2011 Anders Yeo Simultaneously Satisfying Linear Equations Over F_2: Parameterized Above Average
Fri, Sep 02 2011 Pierre Marquis A Few Words about Knowledge Compilation
Sat, Sep 03 2011 Bart Jansen Kernelization for a Hierarchy of Structural Parameters
Sun, Sep 04 2011 Michael R. Fellows Kernelization and the Larger Picture of Practical Algorithmics, in Contemporary Context
Sat, Sep 03 2011 Sourav Chakraborty Property Testing: Sublinear Algorithms for Promise Problems
Fri, Sep 02 2011 Armin Biere Preprocessing and Inprocessing Techniques in SAT
Fri, Sep 02 2011 Fedor V. Fomin Protrusions in graphs and their applications