6. FroCos 2007: Liverpool, UK

Boris Konev, Frank Wolter (Eds.): Frontiers of Combining Systems, 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007, Proceedings. Lecture Notes in Computer Science 4720 Springer 2007, ISBN 978-3-540-74620-1

Invited Contributions

Sava Krstic, Amit Goel:
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL. 1-27
Roberto Sebastiani:
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain. 28-46
Viorica Sofronie-Stokkermans:
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions. 47-71
Michael Zakharyaschev:
Temporalising Logics: Fifteen Years After. 72

Technical Papers

Beatriz Alarcón, Salvador Lucas:
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs. 73-87
Hasan Amjad:
A Compressing Translation from Propositional Resolution to Natural Deduction. 88-102
Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune:
Combining Algorithms for Deciding Knowledge in Security Protocols. 103-117
Carlos Caleiro, Jaime Ramos:
Combining Classical and Intuitionistic Implications. 118-132
Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch:
Towards an Automatic Analysis of Web Service Security. 133-147
Evelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, Xavier Urbain:
Certification of Automated Termination Proofs. 148-162
Clare Dixon, Michael Fisher, Boris Konev:
Temporal Logic with Capacity Constraints. 163-177
Tim French:
Idempotent Transductions for Modal Logics. 178-192
Tim French, John Christopher McCabe-Dansted, Mark Reynolds:
A Temporal Logic of Robustness. 193-205
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli:
Noetherianity and Combination Problems. 206-220
Hitoshi Ohsaki, Hiroyuki Seki:
Languages Modulo Normalization. 221-236
Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran:
Combining Proof-Producing Decision Procedures. 237-251
Jacques Chabin, Pierre Réty:
Visibly Pushdown Languages and Term Rewriting. 252-266
Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl:
Proving Termination Using Recursive Path Orders and SAT Solving. 267-282

Last update Sun May 26 01:53:31 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page