5. FroCos 2005: Vienna, Austria

Bernhard Gramlich (Ed.): Frontiers of Combining Systems, 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings. Lecture Notes in Computer Science 3717 Springer 2005, ISBN 3-540-29051-6

Logics, Theories, and Decision Procedures I

Silvio Ghilardi, Enrica Nicolini, Daniele Zucchelli:
A Comprehensive Framework for Combined Decision Procedures. 1-30
Franz Baader, Silvio Ghilardi:
Connecting Many-Sorted Structures and Theories Through Adjoint Functions. 31-47
Silvio Ranise, Christophe Ringeissen, Calogero G. Zarba:
Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic. 48-64
Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz:
On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal. 65-80

Interface Formalisms

Luca de Alfaro, Leandro Dias da Silva, Marco Faella, Axel Legay, Pritam Roy, Maria Sorea:
Sociable Interfaces. 81-105

Logics, Theories, and Decision Procedures II

Khalil Djelloul:
About the Combination of Trees and Rational Numbers in a Complete First-Order Theory. 106-121
Dirk Pattinson, Bernhard Reus:
A Complete Temporal and Spatial Logic for Distributed Systems. 122-137

Constraint Solving and Programming

Eric Monfroy, Frédéric Saubion, Tony Lambert:
Hybrid CSP Solving. 138-167
Shuvendu K. Lahiri, Madanlal Musuvathi:
An Efficient Decision Procedure for UTVPI Constraints. 168-183
Rafael del Vado Vírseda:
Declarative Constraint Programming with Definitional Trees. 184-199

Logical Problem Analysis and Encoding I

Dejan Jovanovic, Predrag Janicic:
Logical Analysis of Hash Functions. 200-215

Combination Issues in Rewriting and Programming

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp:
Proving and Disproving Termination of Higher-Order Functions. 216-231
Adam Koprowski, Hans Zantema:
Proving Liveness with Fairness Using Rewriting. 232-247
Joachim Niehren, Jan Schwinghammer, Gert Smolka:
A Concurrent Lambda Calculus with Futures. 248-263

Compositional System Design and Refinement

Egon Börger:
The ASM Method for System Design and Analysis. A Tutorial Introduction. 264-283

Logical Problem Analysis and Encoding II

Fausto Giunchiglia:
Matching Classifications via a Bidirectional Integration of SAT and Linguistic Resources. 284-284

Theorem Proving Frameworks and Systems

Andreas Abel, Thierry Coquand, Ulf Norell:
Connecting a Logical Framework to a First-Order Logic Prover. 285-301
Sergey Tverdyshev:
Combination of Isabelle/HOL with Automatic Tools. 302-309
Sa Cui, Kevin Donnelly, Hongwei Xi:
ATS: A Language That Combines Programming with Theorem Proving. 310-320