LIX Colloquium

Reachability Problems'09

September 23rd-25th 2009

Ecole Polytechnique, France

## Main.AcceptedPapers History

Show minor edits - Show changes to output

September 04, 2009, at 02:27 PM
by

- Changed line 1 from:

!!! Accepted Papers

to:

!! Accepted Papers

June 16, 2009, at 10:45 PM
by

- Changed lines 5-6 from:

* Maurice Margenstern.

** ''The periodic domino problem is undecidable in the hyperbolic plane.''

** ''The periodic domino problem is undecidable in the hyperbolic plane.''

to:

* Maurice Margenstern. ''The periodic domino problem is undecidable in the hyperbolic plane.''

June 16, 2009, at 10:45 PM
by

- Changed lines 5-6 from:

* Maurice Margenstern. '''The periodic domino problem is undecidable in the hyperbolic plane.'''

to:

* Maurice Margenstern.

** ''The periodic domino problem is undecidable in the hyperbolic plane.''

** ''The periodic domino problem is undecidable in the hyperbolic plane.''

June 16, 2009, at 10:44 PM
by

- Changed line 5 from:

* Maurice Margenstern. ''The periodic domino problem is undecidable in the hyperbolic plane.''

to:

* Maurice Margenstern. '''The periodic domino problem is undecidable in the hyperbolic plane.'''

June 16, 2009, at 10:44 PM
by

- Changed lines 7-19 from:

* Yohan Boichut, Pierre-Cyrille Heam and Olga Kouchnarenko. How to Tackle Integer Weighted Automata Positivity

* Denis Lugiez. Forward Analysis of Dynamic Networks of Pushdown Systems is Easier without Order

* Parosh Aziz Abdulla, Giorgio Delzanno and Ahmed Rezine. Automatic Verification of Directory-based Consistency Protocols

* Anil Vullikanti, Henning Mortveit and Matt Macauley. Limit Set Reachability in Asynchronous Graph Dynamical Systems

* Amaldev Manuel and R. Ramanujam. Counting multiplicity over infinite alphabets

* Christoph Minnameier and Mila Majster-Cederbaum. Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-based Systems

* Roberto Barbuti, Francesca Levi, Paolo Milazzo and Guido Scatena. Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates

* Pieter Collins and Ivan Zapreev. Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems

* Kenneth McMillan and Lenore Zuck. Abstract Counterexamples for Non-Disjunctive Abstractions

* Bastien Maubert and Sophie Pinchinat. Games with Opacity Condition

* Mohamed Faouzi Atig and Peter Habermehl. On Yen's Path Logic for Petri Nets

* Mouna Chaouch-Saad, Bernadette Charron-Bost and Stephan Merz. A Reduction Theorem for the Verification of Round-Based Distributed Algorithms

* Anil Seth. Games on Higher Order Multi-Stack Pushdown Systems

* Denis Lugiez. Forward Analysis of Dynamic Networks of Pushdown Systems is Easier without Order

* Parosh Aziz Abdulla, Giorgio Delzanno and Ahmed Rezine. Automatic Verification of Directory-based Consistency Protocols

* Anil Vullikanti, Henning Mortveit and Matt Macauley. Limit Set Reachability in Asynchronous Graph Dynamical Systems

* Amaldev Manuel and R. Ramanujam. Counting multiplicity over infinite alphabets

* Christoph Minnameier and Mila Majster-Cederbaum. Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-based Systems

* Roberto Barbuti, Francesca Levi, Paolo Milazzo and Guido Scatena. Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates

* Pieter Collins and Ivan Zapreev. Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems

* Kenneth McMillan and Lenore Zuck. Abstract Counterexamples for Non-Disjunctive Abstractions

* Bastien Maubert and Sophie Pinchinat. Games with Opacity Condition

* Mohamed Faouzi Atig and Peter Habermehl. On Yen's Path Logic for Petri Nets

* Mouna Chaouch-Saad, Bernadette Charron-Bost and Stephan Merz. A Reduction Theorem for the Verification of Round-Based Distributed Algorithms

* Anil Seth. Games on Higher Order Multi-Stack Pushdown Systems

to:

* Yohan Boichut, Pierre-Cyrille Heam and Olga Kouchnarenko. ''How to Tackle Integer Weighted Automata Positivity.''

* Denis Lugiez. ''Forward Analysis of Dynamic Networks of Pushdown Systems is Easier without Order.''

* Parosh Aziz Abdulla, Giorgio Delzanno and Ahmed Rezine. ''Automatic Verification of Directory-based Consistency Protocols.''

* Anil Vullikanti, Henning Mortveit and Matt Macauley. ''Limit Set Reachability in Asynchronous Graph Dynamical Systems.''

* Amaldev Manuel and R. Ramanujam. ''Counting multiplicity over infinite alphabets.''

* Christoph Minnameier and Mila Majster-Cederbaum. ''Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-based Systems.''

* Roberto Barbuti, Francesca Levi, Paolo Milazzo and Guido Scatena. ''Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates.''

* Pieter Collins and Ivan Zapreev. ''Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems.''

* Kenneth McMillan and Lenore Zuck. ''Abstract Counterexamples for Non-Disjunctive Abstractions.''

* Bastien Maubert and Sophie Pinchinat. ''Games with Opacity Condition.'

* Mohamed Faouzi Atig and Peter Habermehl. ''On Yen's Path Logic for Petri Nets.''

* Mouna Chaouch-Saad, Bernadette Charron-Bost and Stephan Merz. ''A Reduction Theorem for the Verification of Round-Based Distributed Algorithms.''

* Anil Seth. ''Games on Higher Order Multi-Stack Pushdown Systems.''

* Denis Lugiez. ''Forward Analysis of Dynamic Networks of Pushdown Systems is Easier without Order.''

* Parosh Aziz Abdulla, Giorgio Delzanno and Ahmed Rezine. ''Automatic Verification of Directory-based Consistency Protocols.''

* Anil Vullikanti, Henning Mortveit and Matt Macauley. ''Limit Set Reachability in Asynchronous Graph Dynamical Systems.''

* Amaldev Manuel and R. Ramanujam. ''Counting multiplicity over infinite alphabets.''

* Christoph Minnameier and Mila Majster-Cederbaum. ''Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-based Systems.''

* Roberto Barbuti, Francesca Levi, Paolo Milazzo and Guido Scatena. ''Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates.''

* Pieter Collins and Ivan Zapreev. ''Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems.''

* Kenneth McMillan and Lenore Zuck. ''Abstract Counterexamples for Non-Disjunctive Abstractions.''

* Bastien Maubert and Sophie Pinchinat. ''Games with Opacity Condition.'

* Mohamed Faouzi Atig and Peter Habermehl. ''On Yen's Path Logic for Petri Nets.''

* Mouna Chaouch-Saad, Bernadette Charron-Bost and Stephan Merz. ''A Reduction Theorem for the Verification of Round-Based Distributed Algorithms.''

* Anil Seth. ''Games on Higher Order Multi-Stack Pushdown Systems.''

June 16, 2009, at 10:42 PM
by

- Changed lines 5-6 from:

* Maurice Margenstern. ''The periodic domino problem is undecidable in the hyperbolic plane''

* Eero Lehtonen. An Undecidable Permutation of the Natural Numbers

* Eero Lehtonen. An Undecidable Permutation of the Natural Numbers

to:

* Maurice Margenstern. ''The periodic domino problem is undecidable in the hyperbolic plane.''

* Eero Lehtonen. ''An Undecidable Permutation of the Natural Numbers.''

* Eero Lehtonen. ''An Undecidable Permutation of the Natural Numbers.''

June 16, 2009, at 10:42 PM
by

- Changed line 5 from:

* Maurice Margenstern. The periodic domino problem is undecidable in the hyperbolic plane

to:

* Maurice Margenstern. ''The periodic domino problem is undecidable in the hyperbolic plane''

June 16, 2009, at 10:40 PM
by

- Changed lines 1-3 from:

!! Accepted Papers

to:

!!! Accepted Papers

(by order of submission)

(by order of submission)

June 16, 2009, at 10:39 PM
by

- Deleted line 0:

Changed line 13 from:

Kenneth McMillan and Lenore Zuck. Abstract Counterexamples for Non-Disjunctive Abstractions

to:

* Kenneth McMillan and Lenore Zuck. Abstract Counterexamples for Non-Disjunctive Abstractions

June 16, 2009, at 10:39 PM
by

- Changed lines 1-18 from:

This page will exist soon.

to:

!! Accepted Papers

* Maurice Margenstern. The periodic domino problem is undecidable in the hyperbolic plane

* Eero Lehtonen. An Undecidable Permutation of the Natural Numbers

* Yohan Boichut, Pierre-Cyrille Heam and Olga Kouchnarenko. How to Tackle Integer Weighted Automata Positivity

* Denis Lugiez. Forward Analysis of Dynamic Networks of Pushdown Systems is Easier without Order

* Parosh Aziz Abdulla, Giorgio Delzanno and Ahmed Rezine. Automatic Verification of Directory-based Consistency Protocols

* Anil Vullikanti, Henning Mortveit and Matt Macauley. Limit Set Reachability in Asynchronous Graph Dynamical Systems

* Amaldev Manuel and R. Ramanujam. Counting multiplicity over infinite alphabets

* Christoph Minnameier and Mila Majster-Cederbaum. Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-based Systems

* Roberto Barbuti, Francesca Levi, Paolo Milazzo and Guido Scatena. Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates

* Pieter Collins and Ivan Zapreev. Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems

Kenneth McMillan and Lenore Zuck. Abstract Counterexamples for Non-Disjunctive Abstractions

* Bastien Maubert and Sophie Pinchinat. Games with Opacity Condition

* Mohamed Faouzi Atig and Peter Habermehl. On Yen's Path Logic for Petri Nets

* Mouna Chaouch-Saad, Bernadette Charron-Bost and Stephan Merz. A Reduction Theorem for the Verification of Round-Based Distributed Algorithms

* Anil Seth. Games on Higher Order Multi-Stack Pushdown Systems

November 12, 2008, at 09:45 PM
by

- Added line 1:

This page will exist soon.