Lecture Notes in Computer Science - Theorem Proving in Higher Order Logics
Latest Publications

TOTAL DOCUMENTS

26

(FIVE YEARS 0)

H-INDEX

11

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540283720, 9783540318200

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Design Structure for Higher Order Quotients

Lecture Notes in Computer Science - Theorem Proving in Higher Order Logics ◽

10.1007/11541868_9 ◽

2005 ◽

pp. 130-146 ◽

Author(s):

Peter V. Homeier

Keyword(s):

Higher Order ◽

Design Structure

Download Full-text

A Structured Set of Higher-Order Problems

Lecture Notes in Computer Science - Theorem Proving in Higher Order Logics ◽

10.1007/11541868_5 ◽

2005 ◽

pp. 66-81 ◽

Author(s):

Christoph E. Benzmüller ◽

Chad E. Brown

Keyword(s):

Download Full-text

From PSL to LTL: A Formal Validation in HOL

Lecture Notes in Computer Science - Theorem Proving in Higher Order Logics ◽

10.1007/11541868_22 ◽

2005 ◽

pp. 342-357 ◽

Author(s):

Thomas Tuerk ◽

Klaus Schneider

Keyword(s):

Formal Validation

Download Full-text

Verifying a Secure Information Flow Analyzer

Lecture Notes in Computer Science - Theorem Proving in Higher Order Logics ◽

10.1007/11541868_14 ◽

2005 ◽

pp. 211-226 ◽

Author(s):

David A. Naumann

Keyword(s):

Information Flow ◽

Secure Information

Download Full-text

Extensionality in the Calculus of Constructions

Lecture Notes in Computer Science - Theorem Proving in Higher Order Logics ◽

10.1007/11541868_18 ◽

2005 ◽

pp. 278-293 ◽

Author(s):

Nicolas Oury

Keyword(s):

Calculus Of Constructions

Download Full-text

Mechanized Metatheory for the Masses: The PoplMark Challenge

Lecture Notes in Computer Science - Theorem Proving in Higher Order Logics ◽

10.1007/11541868_4 ◽

2005 ◽

pp. 50-65 ◽

Author(s):

Brian E. Aydemir ◽

Aaron Bohannon ◽

Matthew Fairbairn ◽

J. Nathan Foster ◽

Benjamin C. Pierce ◽

...

Keyword(s):

Download Full-text

Proof Pearl: Dijkstra’s Shortest Path Algorithm Verified with ACL2

Lecture Notes in Computer Science - Theorem Proving in Higher Order Logics ◽

10.1007/11541868_24 ◽

2005 ◽

pp. 373-384 ◽

Author(s):

J. Strother Moore ◽

Qiang Zhang

Keyword(s):

Shortest Path ◽

Shortest Path Algorithm

Download Full-text

Formal Verification of a SHA-1 Circuit Core Using ACL2

Lecture Notes in Computer Science - Theorem Proving in Higher Order Logics ◽

10.1007/11541868_21 ◽

2005 ◽

pp. 326-341 ◽

Author(s):

Diana Toma ◽

Dominique Borrione

Keyword(s):

Formal Verification

Download Full-text

A Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic

Lecture Notes in Computer Science - Theorem Proving in Higher Order Logics ◽

10.1007/11541868_19 ◽

2005 ◽

pp. 294-309 ◽

Author(s):

Tom Ridge ◽

James Margetson

Keyword(s):

Order Logic ◽

Theorem Prover ◽

First Order Logic ◽

Download Full-text

Proof Pearl: Defining Functions over Finite Sets

Lecture Notes in Computer Science - Theorem Proving in Higher Order Logics ◽

10.1007/11541868_25 ◽

2005 ◽

pp. 385-396 ◽

Author(s):

Tobias Nipkow ◽

Lawrence C. Paulson

Keyword(s):

Download Full-text