Frontiers of Combining Systems
Editat de Bernhard Gramlichen Limba Engleză Paperback – 12 sep 2005
Preț: 323.02 lei
Preț vechi: 403.77 lei
-20% Nou
Puncte Express: 485
Preț estimativ în valută:
57.15€ • 66.58$ • 49.91£
57.15€ • 66.58$ • 49.91£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540290513
ISBN-10: 3540290516
Pagini: 336
Ilustrații: X, 321 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540290516
Pagini: 336
Ilustrații: X, 321 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Logics, Theories, and Decision Procedures I.- A Comprehensive Framework for Combined Decision Procedures.- Connecting Many-Sorted Structures and Theories Through Adjoint Functions.- Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic.- On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal.- Interface Formalisms.- Sociable Interfaces.- Logics, Theories, and Decision Procedures II.- About the Combination of Trees and Rational Numbers in a Complete First-Order Theory.- A Complete Temporal and Spatial Logic for Distributed Systems.- Constraint Solving and Programming.- Hybrid CSP Solving.- An Efficient Decision Procedure for UTVPI Constraints.- Declarative Constraint Programming with Definitional Trees.- Logical Problem Analysis and Encoding I.- Logical Analysis of Hash Functions.- Combination Issues in Rewriting and Programming.- Proving and Disproving Termination of Higher-Order Functions.- Proving Liveness with Fairness Using Rewriting.- A Concurrent Lambda Calculus with Futures.- Compositional System Design and Refinement.- The ASM Method for System Design and Analysis. A Tutorial Introduction.- Logical Problem Analysis and Encoding II.- Matching Classifications via a Bidirectional Integration of SAT and Linguistic Resources.- Theorem Proving Frameworks and Systems.- Connecting a Logical Framework to a First-Order Logic Prover.- Combination of Isabelle/HOL with Automatic Tools.- ATS: A Language That Combines Programming with Theorem Proving.