Theorem Proving in Higher Order Logics
Editat de Mark Aagaard, John Harrisonen Limba Engleză Paperback – 27 iul 2000
Preț: 334.04 lei
Preț vechi: 417.55 lei
-20% Nou
Puncte Express: 501
Preț estimativ în valută:
59.10€ • 68.85$ • 51.61£
59.10€ • 68.85$ • 51.61£
Carte tipărită la comandă
Livrare economică 19 ianuarie-02 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540678632
ISBN-10: 3540678638
Pagini: 552
Ilustrații: IX, 539 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.83 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540678638
Pagini: 552
Ilustrații: IX, 539 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.83 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Fix-Point Equations for Well-Founded Recursion in Type Theory.- Programming and Computing in HOL.- Proof Terms for Simply Typed Higher Order Logic.- Routing Information Protocol in HOL/SPIN.- Recursive Families of Inductive Types.- Aircraft Trajectory Modeling and Alerting Algorithm Verification.- Intel’s Formal Verification Experience on the Willamette Development.- A Prototype Proof Translator from HOL to Coq.- Proving ML Type Soundness Within Coq.- On the Mechanization of Real Analysis in Isabelle/HOL.- Equational Reasoning via Partial Reflection.- Reachability Programming in HOL98 Using BDDs.- Transcendental Functions and Continuity Checking in PVS.- Verified Optimizations for the Intel IA-64 Architecture.- Formal Verification of IA-64 Division Algorithms.- Fast Tactic-Based Theorem Proving.- Implementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover.- A Strong and Mechanizable Grand Logic.- Inheritance in Higher Order Logic: Modeling and Reasoning.- Total-Correctness Refinement for Sequential Reactive Systems.- Divider Circuit Verification with Model Checking and Theorem Proving.- Specification and Verification of a Steam-Boiler with Signal-Coq.- Functional Procedures in Higher-Order Logic.- Formalizing Stålmarck’s Algorithm in Coq.- TAS — A Generic Window Inference System.- Weak Alternating Automata in Isabelle/HOL.- Graphical Theories of Interactive Systems: Can a Proof Assistant Help?.- Formal Verification of the Alpha 21364 Network Protocol.- Dependently Typed Records for Representing Mathematical Structure.- Towards a Machine-Checked Java Specification Book.- Another Look at Nested Recursion.- Automating the Search for Answers to Open Questions.- Appendix: Conjectures Concerning Proof, Design, and Verification.
Caracteristici
Includes supplementary material: sn.pub/extras