skip to content
 

Seminars (LAA)

Videos and presentation materials from other INI events are also available.

Search seminar archive

Event When Speaker Title Presentation Material
LAAW01 9th January 2006
09:00 to 10:00
M Otto Model theoretic methods for special classes of (finite) structures
LAAW01 9th January 2006
10:00 to 11:00
B Kujipers Topological queries - topological invariants and query languages
LAAW01 9th January 2006
11:00 to 12:00
J Van de Bussche Logical aspects of spatial databases
LAAW01 9th January 2006
13:00 to 14:00
D Macpherson Asymptotics of definable sets in finite structres
LAAW01 9th January 2006
14:00 to 15:00
T Wilke Logics, automata, and finite semigroups
LAAW01 9th January 2006
15:00 to 16:00
I Walukiewicz Towards understanding tree languages - part 1
LAAW01 9th January 2006
16:00 to 17:00
M Djordjevic Connections between finite and infinite model theory
LAAW01 9th January 2006
17:00 to 18:00
K Etessami Analysis of recursive Markov chains, recursive Markov decision processes, and recursive stochastic games
LAAW01 10th January 2006
13:00 to 14:00
R Elwes Asymptotics of definable sets in finite structures
LAAW01 10th January 2006
15:00 to 16:00
I Walukiewicz Towards understanding tree languages - part 2
LAAW01 11th January 2006
13:00 to 14:00
D Macpherson Asymptotics of definable sets in finite structures
LAAW01 12th January 2006
11:00 to 12:00
S Rubin Classifying automatic structures
LAAW01 12th January 2006
12:00 to 13:00
N Schweikardt (Finite) model theory of tree and tree-like structures
LAAW01 12th January 2006
13:00 to 14:00
S Kreutzer (Finite) model of tree and tree-like structures
LAAW01 13th January 2006
17:00 to 18:00
M Bodirsky The algebraic approach to infinite-valued constraint satisfaction
LAA 19th January 2006
11:00 to 12:00
J Marcinkowski On the selectivity of a semantic subsumption index
LAA 24th January 2006
11:00 to 12:00
N Alechina Epistemic logics for time and space bounded reasoning
LAA 26th January 2006
11:00 to 12:00
A Bulatov Complexity of constraint problems via polymorphisms
LAA 31st January 2006
11:00 to 12:00
M Valeriote Tractable constraint languages arising from some algebras that generate congruence distributive varieties
LAA 2nd February 2006
11:00 to 12:00
L Ong Game semantics and its algorithmic applications: Part I
LAA 3rd February 2006
11:00 to 12:00
B Cook Automatically proving the termination of C programs
LAA 6th February 2006
11:00 to 12:00
A Atserias Non-uniform hardness for NP via black-box adversaries
LAA 7th February 2006
11:00 to 12:00
L Ong Game semantics and its algorithmic applications: Part II
LAA 9th February 2006
11:00 to 12:00
L Ong Game semantics and its algorithmic applications: Part III
LAA 9th February 2006
16:00 to 17:00
A Atserias Part II on hardness for NP Informal Discussion
LAA 13th February 2006
11:00 to 12:00
O Kupferman Avoiding determinization
LAA 14th February 2006
11:00 to 12:00
L Ong Game semantics and its algorithmic applications: Part IV
LAA 15th February 2006
11:30 to 12:30
L Hella Complete problems for higher order logics
LAA 16th February 2006
11:00 to 12:00
L Ong Game semantics and its algorithmic applications: Part V
LAA 17th February 2006
11:00 to 12:00
K Markstrom A class of SAT-instances which are hard for resolution based SAT-solvers
LAA 20th February 2006
11:00 to 12:00
H Chen The computational complexity of quantified constraint satisfaction
LAA 21st February 2006
11:00 to 12:00
L Cardelli Biological systems as reactive systems
LAA 22nd February 2006
11:00 to 12:00
A Arratia-Quesada Syntactic vs. semantic approximations to logics that capture complexity classes
LAA 23rd February 2006
11:00 to 12:00
V Dalmau Beyond Hypertee Width: Decomposition methods without decompositions
LAA 24th February 2006
11:00 to 12:00
L Hella Complete problems for higher order logics
LAAW02 27th February 2006
09:30 to 11:00
F Neven The automaton approach to XML schema languages: from practice to theory
LAAW02 27th February 2006
11:30 to 12:30
D Suciu Probabilities in databases and in logics I
LAAW02 27th February 2006
14:00 to 15:00
P Kolaitis Foundations of Schema mappings I
LAAW02 27th February 2006
15:30 to 16:15
V Sazonov Querying hyperset/web-like databases
LAAW02 27th February 2006
16:15 to 17:00
J Lynch Concentration bounds for Markov processes of metafinite models
LAAW02 27th February 2006
17:00 to 17:45
M Marx XPath with transitive closure
LAAW02 28th February 2006
09:30 to 10:15
L Bertossi Cardinality-based semantics for consistent query answering: incremental and parameterized complexity
LAAW02 28th February 2006
10:15 to 11:00
G Gottlob Computational problems of data exchange
LAAW02 28th February 2006
11:30 to 12:30
D Suciu Probabilities in databases and in logics II
LAAW02 28th February 2006
14:00 to 15:00
P Kolaitis Foundations of Schema mappings II
LAAW02 28th February 2006
15:30 to 16:15
P Gardner Context logic and tree update
LAAW02 28th February 2006
16:15 to 17:00
M Katz Approximation logic and databases
LAAW02 28th February 2006
17:00 to 17:45
S Lindell A normal form for singulary logic over physically realizable data models
LAAW02 1st March 2006
09:15 to 10:15
C Koch Queries on tree-structured data: Logical languages and complexity
LAAW02 1st March 2006
10:15 to 11:00
C Beeri BPQL - A query language for business processes
LAAW02 1st March 2006
11:30 to 12:30
L Segoufin Pebble tree walking automata and TC-logics on trees
LAAW02 2nd March 2006
09:15 to 10:15
N Schweikardt The complexity of processing data streams and external memory data I
LAAW02 2nd March 2006
10:15 to 11:00
D Calvanese Ontology mediated data management
LAAW02 2nd March 2006
11:30 to 12:30
V Vianu Automatic verification of communicating data-aware web services
LAAW02 2nd March 2006
14:00 to 15:00
L Libkin Database normalization revisited: an information-theoretic approach
LAAW02 2nd March 2006
15:30 to 16:15
S Szeider On the clique-width of graphs
LAAW02 2nd March 2006
16:15 to 17:00
N Alechina Complete axiomatisation for PDLpath
LAAW02 2nd March 2006
17:00 to 17:45
M Arenas Locally consistent transformations and query answering in data exchange
LAAW02 3rd March 2006
09:15 to 10:15
N Schweikardt The complexity of processing data streams and external memory data
LAAW02 3rd March 2006
10:15 to 11:00
P Barcelo Temporal logics for n-ary queries over XML documents
LAAW02 3rd March 2006
11:30 to 12:30
M Grohe Law enforcement on hypergraphs
LAA 6th March 2006
11:00 to 12:00
A Krokhin Constraint satisfaction problems and dualities
LAA 7th March 2006
11:00 to 12:00
J Krajicek Basic proof complexity I
LAA 8th March 2006
11:00 to 12:00
C Steinhorn On asymptotic classes of finite structures
LAA 9th March 2006
11:00 to 12:00
J Krajicek Basic proof complexity II
LAA 10th March 2006
11:00 to 12:00
T Griffin Metarouting: An algebraic approach to defining routing protocols
LAA 13th March 2006
11:00 to 12:00
G Kun CSP and MMSNP are computationally equivalent
LAA 14th March 2006
11:00 to 12:00
J Krajicek Basic proof complexity III
LAA 15th March 2006
11:00 to 12:00
P Hell Graph partitions
LAA 16th March 2006
11:00 to 12:00
J Krajicek Basic proof complexity IIII
LAA 17th March 2006
11:00 to 12:00
V Goranko Infinite state model checking in modal logic
LAA 17th March 2006
14:15 to 15:15
M Vardi Logic and Algorithms
LAA 27th March 2006
11:00 to 12:00
S Szeider Fixed-parameter algorithms for propositional satisfiability and constraint satisfaction
LAA 28th March 2006
11:00 to 12:00
J Nesetril Small extensions
LAA 30th March 2006
11:00 to 12:00
K Fisler Verification and change-impact analysis of access-control policies
LAA 3rd April 2006
11:00 to 12:00
R Milner Ubiquitous computing: shall we understand it?
LAA 4th April 2006
11:00 to 12:00
S Kreutzer Approximation schemes for first-order definable optimisation problems
LAA 6th April 2006
11:00 to 12:00
S Vorobyov Games as controlled optimization problems
LAA 7th April 2006
11:00 to 12:00
W Hodges The semantics of modularity
LAAW04 10th April 2006
10:00 to 11:00
P Pudlak $On \forall\Sigma_1^b$ sentences provable in bounded arithmetic
LAAW04 10th April 2006
11:30 to 12:00
P Nguyen The complexity of proving the discrete Jordan Curve theorem and related principles
LAAW04 10th April 2006
12:00 to 12:30
A Beckmann Uniform proof complexity
LAAW04 10th April 2006
14:00 to 15:00
N Thapen $T^1_2, T^2_2$ and search problems
LAAW04 10th April 2006
15:30 to 16:00
E Jerabek Approximate counting in bounded arithmetic
LAAW04 10th April 2006
16:00 to 16:30
C Pollett When can $S^1_2$ prove the weak pigeonhole principle?
LAAW04 11th April 2006
09:30 to 10:30
S Cook Capturing complexity classes by their reasoning power
LAAW04 11th April 2006
10:30 to 11:00
M Vardi Constraint propagation as a proof system
LAAW04 11th April 2006
11:30 to 12:00
M Soltys The proof complexity of matrix algebra
LAAW04 11th April 2006
12:00 to 12:30
S Perron A minimal quantified proof system for polytime reasoning
LAAW04 11th April 2006
14:00 to 15:00
R Impagliazzo Which SAT instances are the hardest?
LAAW04 11th April 2006
15:30 to 16:00
S Riis Sporadic propositional proofs
LAAW04 11th April 2006
16:00 to 16:30
N Galesi Resolution by pebbling games
LAAW04 12th April 2006
09:30 to 10:30
T Pitassi Using lower bounds in proof complexity
LAAW04 12th April 2006
10:30 to 11:00
J Nordstrom Narrow proofs may be spacious: separating space and width in resolution
LAAW04 12th April 2006
11:30 to 12:30
N Segerlind Connections between zero-one programming, communication complexity and proof complexity
LAAW04 13th April 2006
09:30 to 10:30
I Tzameret The strength of multilinear proofs
LAAW04 13th April 2006
10:00 to 10:30
ML Bonet A complete resolution-like calculus for Maxsat
LAAW04 13th April 2006
11:30 to 12:30
S Dantchev Parametrised proof complexity
LAAW04 13th April 2006
14:00 to 14:30
P Naumov Meta complexity of propositional proofs
LAAW04 13th April 2006
14:30 to 15:30
M Alekhnovich On the power of Lovasz-Schrijver hierarchy
LAA 18th April 2006
11:00 to 12:00
T Brihaye O-minimal hybrid systems, bisimulation and control
LAA 20th April 2006
11:00 to 12:00
J Krajicek Forcing with random variables and complexity of computations and proofs
LAA 21st April 2006
11:00 to 12:00
J Vaananen Team logic
LAA 24th April 2006
11:00 to 12:00
P Pudlak On lower bounds in non-classical logics
LAA 25th April 2006
11:00 to 12:00
S Kreutzer Graph searching games and graph decompositions I
LAA 26th April 2006
11:00 to 12:00
S Dantchev Complexity gaps for resolution-based proof systems
LAA 27th April 2006
11:00 to 12:00
S Kreutzer Graph searching games and graph decompositions II
LAA 2nd May 2006
11:00 to 12:00
S Kreutzer Graph searching games and graph decompositions III
LAA 3rd May 2006
11:00 to 12:00
K Kulesza Observations on inverting the VMPC one-way function
LAA 4th May 2006
11:00 to 12:00
S Kreutzer Graph searching games and graph decompositions IV
LAA 5th May 2006
11:00 to 12:00
P Abdulla Confluent Markov chains
LAAW05 8th May 2006
10:00 to 11:00
Z Manna From verification conditions to constraints
LAAW05 8th May 2006
11:30 to 12:00
A Bradley Solving verification constraint problems with constraint programming
LAAW05 8th May 2006
14:00 to 15:00
P Cousot Program verification by parametric abstraction and semi-definite programming
LAAW05 8th May 2006
15:30 to 16:00
K Fisler Parameterized interfaces for open system verification of product lines
LAAW05 8th May 2006
16:00 to 16:30
S Sankaranarayanan Polyhedral analysis of systems software
LAAW05 8th May 2006
16:30 to 17:00
B Cook Proving termination of programs
LAAW05 9th May 2006
09:00 to 10:00
E Clarke Bounded and unbounded model checking with SAT
LAAW05 9th May 2006
10:00 to 10:30
D Kroening Model checking C++ programs that use the STL
LAAW05 9th May 2006
10:30 to 11:00
K Namjoshi Incremental model checking
LAAW05 9th May 2006
11:30 to 12:00
J Marques-Silva Towards more efficient SAT-based model checking
LAAW05 9th May 2006
12:00 to 12:30
A Lisitsa Uniform + supercompilation = verification
LAAW05 9th May 2006
14:00 to 15:00
L Cardelli Artifical Biochemistry
LAAW05 9th May 2006
15:30 to 16:00
R Dechter Generalizing BDD trees using minimal and/or graphs
LAAW05 9th May 2006
16:00 to 16:30
U Junker Return of the JTMS: Preferences orchestrate conflict learning and solution synthesis
LAAW05 9th May 2006
16:30 to 17:00
A Gupta Enhancing software model checking with static program analysis
LAAW05 9th May 2006
17:00 to 17:30
M Leconte State of the art in constraint programming solvers
LAAW05 10th May 2006
09:00 to 10:00
Z Hanna Logic verification challenges in system level design at Intel
LAAW05 10th May 2006
10:00 to 10:30
J Havlicek Constraints in hardware verification: some industrial perspectives
LAAW05 10th May 2006
10:30 to 11:00
D Lugiez Symbolic constraint solving for cryptographic protocols
LAAW05 10th May 2006
11:30 to 12:00
OG Grumberg Automatic refinement and vacuity detection for symbolic trajectory evaluation
LAAW05 11th May 2006
09:00 to 10:00
MZ Kwiatkowska Linear constraints in probabilistic model checking
LAAW05 11th May 2006
10:00 to 10:30
M Jurdzinski Time average games
LAAW05 11th May 2006
10:30 to 11:00
O Maler Controller synthesis with adversaries
LAAW05 11th May 2006
11:30 to 12:00
P Abdullah Language inclusion for timed automata
LAAW05 11th May 2006
14:00 to 15:00
K McMillan Consequence generation, interpolants and invariant discovery
LAAW05 11th May 2006
15:30 to 16:30
Y Naveh Constraint satisfaction for random stimuli generation
LAAW05 11th May 2006
16:30 to 17:00
S Qadeer Verifying properties of well-founded linked lists
LAAW05 11th May 2006
17:00 to 17:30
A Bouajjani Reasoning about dynamic networks of counter systems
LAAW05 12th May 2006
09:00 to 10:00
P Wolper On the use of automata for representing arithmetic constraints
LAAW05 12th May 2006
10:00 to 10:30
D Mitchell Modelling with FO(ID); Solving with SAT
LAAW05 12th May 2006
10:30 to 11:00
S Cotton Satisfiability modulo theory chains with DPLL(T)
LAAW05 12th May 2006
11:30 to 12:00
K Sakallah A progressive approach to solving satisfiability modulo theories (SMT)
LAAW05 12th May 2006
14:00 to 15:00
E Giunchiglia State of the art in QBF reasoning, with emphasis on applications in FV
LAAW05 12th May 2006
15:30 to 16:30
E Amir Compact propositional encodings of first-order theories
LAA 15th May 2006
11:00 to 12:00
E Amir Connecting logic and learning
LAA 16th May 2006
11:00 to 12:00
F Klaedtke Don't care words with an application to the automata-based approach for real addition
LAA 17th May 2006
11:00 to 12:00
M Kwiatkowska Model checking for probabilistic real-time systems
LAA 18th May 2006
11:00 to 12:00
N Piterman Solving games without determinization
LAA 23rd May 2006
11:00 to 12:00
A Bouajjani Automata-based techniques for the analysis of dynamic concurrent programs
LAA 25th May 2006
11:00 to 12:00
S Lindell A physical analysis of mechanical computability
LAA 30th May 2006
11:00 to 12:00
H Vollmer Post's lattice with applications to complexity theory (Part I)
LAA 1st June 2006
11:00 to 12:00
H Vollmer Post's lattice with applications to complexity theory (Part II)
LAA 5th June 2006
11:00 to 12:00
H Vollmer Post's lattice with applications to complexity theory (Part III)
LAA 6th June 2006
11:00 to 12:00
M Vardi And logic begat computer science: When giants roamed the Earth
LAA 8th June 2006
11:00 to 12:00
D Richerby Choiceless polynomial time
LAA 12th June 2006
11:00 to 12:00
A Dawar Model theory on well-behaved finite structures
LAA 13th June 2006
11:00 to 12:00
K Etessami Analysis of recursive Markov chains, recursive Markov decision processes and recursive stochastic games (Part I)
LAA 14th June 2006
11:00 to 12:00
H Veith Environment abstraction for parameterised systems
LAA 15th June 2006
11:00 to 12:00
K Etessami Analysis of recursive Markov chains, recursive Markov decision processes and recursive stochastic games (Part II)
LAA 20th June 2006
11:00 to 12:00
K Etessami Analysis of recursive Markov chains, recursive Markov decision processes and recursive stochastic games. Part III.
LAA 22nd June 2006
11:00 to 12:00
D Niwinski On the complexity of infinite computations
LAA 23rd June 2006
11:00 to 12:00
M Jurdzinski A deterministic subexponential algorithm for solving parity games
LAA 26th June 2006
11:00 to 12:00
D Mitchell Modelling in logic; solving with SAT
LAA 27th June 2006
11:00 to 12:00
R Trefler Patterns of compositional reasoning
LAA 28th June 2006
11:00 to 12:00
P Gastin A fresh look at testing for asynchronous communication
LAA 29th June 2006
11:00 to 12:00
JF Lynch Models of biological regulatory networks
LAAW06 3rd July 2006
09:00 to 10:25
J van Benthem Dynamic-epistemic logic of games
LAAW06 3rd July 2006
10:30 to 10:45
L Kaiser Game quantification on automatic structures and hierarchical games
LAAW06 3rd July 2006
11:30 to 12:00
J Duparc Towards the Wadge hierarchy of weak alternating tree automata
LAAW06 3rd July 2006
12:00 to 12:30
J Obdrzalek Are parity games spineless?
LAAW06 3rd July 2006
14:00 to 14:30
T Colcombet Ramseyan factorisation for trees
LAAW06 3rd July 2006
14:30 to 14:45
M Samuelides Pebble tree-walking automata
LAAW06 3rd July 2006
14:45 to 15:00
V Barany A hierachy of automatically presentable omega-words having a decidable MSO theory
LAAW06 3rd July 2006
15:30 to 16:00
D Janin On distributed synthesis of discrete systems
LAAW06 3rd July 2006
16:00 to 16:30
J Esparza Solving fixpoint equations in omega-continuous semirings: Some ideas and many questions
LAAW06 3rd July 2006
16:30 to 17:00
N Immerman On size versus number of variables
LAAW06 4th July 2006
09:00 to 10:25
D Monderer Mechanism design
LAAW06 4th July 2006
10:30 to 11:00
K Apt Stable partitions in coalition games
LAAW06 4th July 2006
11:30 to 12:00
W Zielonka From discounting to parity games
LAAW06 4th July 2006
12:00 to 12:30
H Gimbert Positional stochastic games
LAAW06 4th July 2006
14:00 to 14:30
K Etessami Recursive concurrent stochastic games
LAAW06 4th July 2006
14:30 to 15:00
D Berwanger Backwards induction for games of infinite horizon
LAAW06 4th July 2006
15:30 to 16:55
G Gottlob Hypertree decompositions
LAAW06 5th July 2006
09:00 to 10:25
M Vardi Games as an algorithmic construct
LAAW06 5th July 2006
10:30 to 11:00
Y Venema Coalgebra automata
LAAW06 5th July 2006
11:30 to 12:00
S Froschle When is secrecy decidable?
LAAW06 5th July 2006
12:00 to 12:15
F Horn Finitary parity and streett games
LAAW06 5th July 2006
12:15 to 12:30
S Lasota Faster algorithm for bisimulation equivalence of normed context-free processes
LAAW06 6th July 2006
09:00 to 10:25
R Alur Nested words and trees
LAAW06 6th July 2006
10:30 to 11:00
A Murawski Game semantics and automata
LAAW06 6th July 2006
11:30 to 12:00
T Touili Verifying concurrent message-passing C programs with recursive calls
LAAW06 6th July 2006
12:00 to 12:15
K Rozier Algorithms for automata-theoretic linear temporal logic model checking
LAAW06 6th July 2006
12:15 to 12:30
D Tabakov Experimental evaluation of complementation of non-deterministic Buechi automata
LAAW06 6th July 2006
14:00 to 14:30
M Jurdzinski Optimality equations and strategy improvement for average payoff games
LAAW06 6th July 2006
14:30 to 14:45
A Trivedi A strategy improvement algorithm for optimal time reachability games
LAAW06 6th July 2006
14:45 to 15:00
P Krcal Communicating timed automata
LAAW06 6th July 2006
15:30 to 16:00
B Jonsson Proving liveness by backwards reachability
LAAW06 6th July 2006
16:00 to 16:30
M Lange Model checking games for fixpoint logic with Chop
LAAW06 7th July 2006
09:00 to 10:25
D Caucal Deterministic grammars
LAAW06 7th July 2006
10:30 to 11:00
R Lazic On LTL with the freeze quantifier and register automata
LAAW06 7th July 2006
11:30 to 12:00
S Vorobyov Are one-player games always simple?
LAAW06 7th July 2006
12:00 to 12:30
I Walukiewicz Tree algebras
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons