Buch, Englisch, Band 3717, 321 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1040 g
5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings
Buch, Englisch, Band 3717, 321 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1040 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-29051-3
Verlag: Springer Berlin Heidelberg
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
Weitere Infos & Material
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.