Prelimnary Programme for the
ACM Sigplan
Workshop on
Verification and Computational Logic
Firenze, Italy, September 4, 2001
Tuesday, 4th of September
- 8:00 - 9:00 Registration
- 9:00 - 10:00 Invited Talk 1
"Finite Approximations for Model Checking Non-finite State Processes"
Stefania Gniesi
- 10:00 - 10:30 Morning Coffee
- 10:30 - 11:00 Talk 1
"On model checking data-independent systems with arrays without reset"
Ranko Lazic, Tom Newcomb, Bill Roscoe
- 11:00 - 11:30 Talk 2
"`What can you decide about resetable arrays?"
Bill Roscoe
- 11:30 - 12:00 Talk 3
"A Regular-Language Model for Hoare-Style Correctness Statements"
Dan Ghica
- 12:20 - 12:30 Talk 4
"Ackermann Encoding, Bisimulations, and OBDD's"
Carla Piazza and Alberto Policriti
- 12:30 - 14:00 Lunch
- 14:00 - 15:00 Invited Talk 2
"Constraint-based Verification: Techniques and Applications"
Giorgio Delzanno
- 15:00 - 15:30 Talk 5
"Towards an automata-theoretic counterpart of combined temporal logics"
Massimo Franceschet and Angelo Montanari
- 15:30 - 16:00 Coffee Break
- 16:00 - 16:30 Talk 6
"A Domain for the Abstract Interpretation of Logic Programs with Dynamic Scheduling"
Baudouin Le Charlier, Sabina Rossi, Agostino Cortesi
- 16:30 - 17:00 Talk 7
"Verifying CTL Properties of Infinite-State Systems by Specializing Constraint Logic Programs"
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
- 17:00 - 17:30 Talk 8
"Animation and Model Checking of CSP and B using Prolog Technology"
Michael Leuschel, Laksono Adhianto, Michael Butler, Carla Ferreira,
Leonind Mikhailov
- 17:30 CLOSING