Higher Order Logic Theorem Proving and Its Applications: 7th International Workshop, Valletta, Malta, September 19-22, 1994. Proceedings: Lecture Notes in Computer Science, cartea 859
Editat de Thomas F. Melham, Juanito Camillerien Limba Engleză Paperback – 7 sep 1994
Besides 3 invited papers, the proceedings contains 27 refereed papers selected from 42 submissions. In total the book presents many new results by leading researchers working on the design and applications of theorem provers for higher order logic. In particular, this book gives a thorough state-of-the-art report on applications of the HOL system, one of the most widely used theorem provers for higher order logic.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 341.95 lei
Preț vechi: 427.44 lei
-20% Nou
Puncte Express: 513
Preț estimativ în valută:
65.45€ • 68.06$ • 54.77£
65.45€ • 68.06$ • 54.77£
Carte tipărită la comandă
Livrare economică 15-29 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540584506
ISBN-10: 3540584501
Pagini: 488
Ilustrații: XI, 477 p.
Dimensiuni: 155 x 233 x 26 mm
Greutate: 0.68 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540584501
Pagini: 488
Ilustrații: XI, 477 p.
Dimensiuni: 155 x 233 x 26 mm
Greutate: 0.68 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
LCF examples in HOL.- A graphical tool for proving UNITY progress.- Reasoning about a class of linear systems of equations in HOL.- Towards a HOL theory of memory.- Providing tractable security analyses in HOL.- Highlighting the lambda-free fragment of Automath.- First-order automation for higher-order-logic theorem proving.- Symbolic animation as a proof tool.- Datatypes in L2.- A formal theory of undirected graphs in higher-order logc.- Mechanical verification of distributed algorithms in higher-order logic.- Tracking design changes with formal verification.- Weak systems of set theory related to HOL.- Interval-semantic component models and the efficient verification of transaction-level circuit behavior.- An interpretation of Noden in HOL.- Reasoning about real circuits.- Binary decision diagrams as a HOL derived rule.- Trustworthy tools for trustworthy programs: A verified verification condition generator.- S: A machine readable specification notation based on higher order logic.-An engineering approach to formal digital system design.- Generating designs using an Algorithmic Register Transfer Language with formal semantics.- A HOL formalisation of the Temporal Logic of Actions.- Studying the ML module system in HOL.- Towards a mechanically supported and compositional calculus to design distributed algorithms.- Simplifying deep embedding: A formalised code generator.- Automating verification by functional abstraction at the system level.- A parameterized proof manager.- Implementational issues for verifying RISC-pipeline conflicts in HOL.- Specifying instruction-set architectures in HOL: A primer.- Representing higher-order logic proofs in HOL.