Conferences in DBLP

Frontiers of Combining Systems (FroCoS) (frocos)
2005 (conf/frocos/2005)

1. Silvio Ghilardi, Enrica Nicolini, Daniele Zucchelli
   A Comprehensive Framework for Combined Decision Procedures. [Citation Graph (0, 0)][DBLP]
   FroCos, 2005, pp:1-30 [Conf]
   
2. Franz Baader, Silvio Ghilardi
   Connecting Many-Sorted Structures and Theories Through Adjoint Functions. [Citation Graph (0, 0)][DBLP]
   FroCos, 2005, pp:31-47 [Conf]
   
3. Silvio Ranise, Christophe Ringeissen, Calogero G. Zarba
   Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic. [Citation Graph (0, 0)][DBLP]
   FroCos, 2005, pp:48-64 [Conf]
   
4. Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz
   On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal. [Citation Graph (0, 0)][DBLP]
   FroCos, 2005, pp:65-80 [Conf]
   
5. Luca de Alfaro, Leandro Dias da Silva, Marco Faella, Axel Legay, Pritam Roy, Maria Sorea
   Sociable Interfaces. [Citation Graph (0, 0)][DBLP]
   FroCos, 2005, pp:81-105 [Conf]
   
6. Khalil Djelloul
   About the Combination of Trees and Rational Numbers in a Complete First-Order Theory. [Citation Graph (0, 0)][DBLP]
   FroCos, 2005, pp:106-121 [Conf]
   
7. Dirk Pattinson, Bernhard Reus
   A Complete Temporal and Spatial Logic for Distributed Systems. [Citation Graph (0, 0)][DBLP]
   FroCos, 2005, pp:122-137 [Conf]
   
8. Eric Monfroy, Frédéric Saubion, Tony Lambert
   Hybrid CSP Solving. [Citation Graph (0, 0)][DBLP]
   FroCos, 2005, pp:138-167 [Conf]
   
9. Shuvendu K. Lahiri, Madanlal Musuvathi
   An Efficient Decision Procedure for UTVPI Constraints. [Citation Graph (0, 0)][DBLP]
   FroCos, 2005, pp:168-183 [Conf]
   
10. Rafael del Vado Vírseda
    Declarative Constraint Programming with Definitional Trees. [Citation Graph (0, 0)][DBLP]
    FroCos, 2005, pp:184-199 [Conf]
    
11. Dejan Jovanovic, Predrag Janicic
    Logical Analysis of Hash Functions. [Citation Graph (0, 0)][DBLP]
    FroCos, 2005, pp:200-215 [Conf]
    
12. Jürgen Giesl, René Thiemann, Peter Schneider-Kamp
    Proving and Disproving Termination of Higher-Order Functions. [Citation Graph (0, 0)][DBLP]
    FroCos, 2005, pp:216-231 [Conf]
    
13. Adam Koprowski, Hans Zantema
    Proving Liveness with Fairness Using Rewriting. [Citation Graph (0, 0)][DBLP]
    FroCos, 2005, pp:232-247 [Conf]
    
14. Joachim Niehren, Jan Schwinghammer, Gert Smolka
    A Concurrent Lambda Calculus with Futures. [Citation Graph (0, 0)][DBLP]
    FroCos, 2005, pp:248-263 [Conf]
    
15. Egon Börger
    The ASM Method for System Design and Analysis. A Tutorial Introduction. [Citation Graph (0, 0)][DBLP]
    FroCos, 2005, pp:264-283 [Conf]
    
16. Fausto Giunchiglia
    Matching Classifications via a Bidirectional Integration of SAT and Linguistic Resources. [Citation Graph (0, 0)][DBLP]
    FroCos, 2005, pp:284-284 [Conf]
    
17. Andreas Abel, Thierry Coquand, Ulf Norell
    Connecting a Logical Framework to a First-Order Logic Prover. [Citation Graph (0, 0)][DBLP]
    FroCos, 2005, pp:285-301 [Conf]
    
18. Sergey Tverdyshev
    Combination of Isabelle/HOL with Automatic Tools. [Citation Graph (0, 0)][DBLP]
    FroCos, 2005, pp:302-309 [Conf]
    
19. Sa Cui, Kevin Donnelly, Hongwei Xi
    ATS: A Language That Combines Programming with Theorem Proving. [Citation Graph (0, 0)][DBLP]
    FroCos, 2005, pp:310-320 [Conf]