Liverpool port
   FroCoS 2007 - 6th International Symposium on Frontiers of Combining Systems
Liverpool, UK, September 10-12 2007

Main page

Photos

Registration

(Preliminary) programme

Call for papers

Invited speakers

Accepted papers

Important dates

Venue

Travel and accommodation

Committees

Related events

Contact us


FroCoS-2007 Programme (preliminary)

Location: Department of Computer Science, University of Liverpool, Ashton Building (first floor)

Monday, September 10, 2007
From 8:30 Registration
Session 1
9:30 - 10:30 Invited Talk
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
Roberto Sebastiani
10:30 - 11:00 Coffee Break
Session 2
11:00 - 11:35 Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Beatriz Alarcon and Salvador Lucas
11:35 - 12:10 Visibly Pushdown Languages and Term Rewriting
Piere Rety and Jacques Chabin
12:10 - 13:45 Lunch
Session 3
13:45 - 14:20 A Compressing Translation from Propositional Resolution to Natural Deduction
Hasan Amjad
14:20 - 14:55 Combining Algorithms for Deciding Knowledge in Security Protocols
Mathilde Arnaud, Veronique Cortier, Stephane Delaune
14:55 - 15:30 Temporal Logic of Robustness
Tim French, John McCabe-Dansted, Mark Reynolds
15:30 - 16:00 Coffee Break
Session 4
16:00 - 17:00 Invited Talk
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
Sava Krstic
18:30 - 20:00 Reception


Tuesday, September 11, 2007
Session 5
9:30 - 10:30 Invited talk
Temporalising logics: fifteen years after
Michael Zakhayaschev
10:30 - 11:00 Coffee Break
Session 6
11:00 - 11:35 Idempotent Transduction Logics
Tim French
11:35 - 12:10 Temporal Logics with Capacity Constraints
Clare Dixon, Michael Fisher, Boris Konev
12:10 - 13:45 Lunch
Session 7
13:45 - 14:20 Languages Modulo Normalisation
Hitoshi Ohsaki and Hiroyuki Seki
14:20 - 14:55 Combining Classical and Intuitionistic Implications
Carlos Caleiro and Jaime Ramos
14:55 - 15:30 Coffee Break
Session 8
15:30 - 16:05 Proving Termination using Recursive Path Orders and SAT Solving
Peter Schneider-Kamp, Rene Thiemann, Elena Annov, Michael Codish, Juergen Giesl
16:05 - 16:40 Noetherianity and Combination Problems
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli
19:00 Conference Dinner

Wednesday, September 12, 2007
Session 9
9:30 - 10:30 Invited talk Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extension
Viorica Sofronie-Stokkermans
10:30 - 11:00 Coffee Break
Session 10
11:00 - 11:35 Combining Proof-Producing Decision Procedures
Silvio Ranise, Christophe Ringeissen, Duk Khanh Tran
11:35 - 12:10 Towards an Automatic Analysis of Web Service Security
Yannick Chevalier, Denis Lugiez, Michael Rusinowitch
12:10 - 12:45 Certification of Automated Termination Proofs
Evelyne Contejean, Piere Courtieu, Julien Forest, Olivier Pons, Xavier Urbain
12:45 - 13:00 Closing session
13:00 - 14:00 Lunch

Maintained by Boris Konev, B.Konev@csc.liv.ac.ukLast updated July 2007.