Logic List Mailing Archive

CfPart: Infinity 2007

8 September 2007
Lisbon, Portugal

Call for Participation: INFINITY 2007

Workshop on Verification of Infinite-state systems held along with
CONCUR'07, at Lisbon, Portugal, September 8, 2007.

http://www.cs.uiuc.edu/infinity07/

The aim of the INFINITY workshop is to provide a forum for researchers
interested in the development of formal methods and algorithmic techniques
for the analysis of systems with infinitely many states, and their
application in automated verification of complex hardware and software
systems.


Invited Talks:
-------------

 * Luke Ong, Oxford University (England)
   Verification of infinite structures: a semantic approach

 * Vineet Kahlon, NEC Labs (USA)
   Towards Tractability of Dataflow Analysis for Concurrent Programs


Accepted Papers:
---------------

 * Branching-Time Model-Checking of Probabilistic Pushdown Automata
   - Tomas Brazdil, Vaclav Brozek and Vojtech Forejt

 * On Decidability of LTL+Past Model Checking for Process Rewrite Systems
   - Mojmir Kretinsky, Vojtech Rehak and Jan Strejcek

 * Tree Automata for Detecting Attacks on Protocols with Algebraic
   Cryptographic Primitives
   - Yohan Boichut, Pierre-Cyrille Heam and Olga Kouchnarenko

 * Automatic verification of counter systems with ranking function
   - Emmanuelle Encrenaz and Alain Finkel

 * Efficient reachability graph representation of Petri nets with
   unbounded counters
   - Franck Pommereau, Raymond Devillers and Hanna Klaudel