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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540678632, 9783540446590

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Functional Procedures in Higher-Order Logic

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

10.1007/3-540-44659-1_23 ◽

2000 ◽

pp. 372-387

Author(s):

Linas Laibinis ◽

Joakim von Wright

Keyword(s):

Higher Order ◽

Order Logic ◽

Higher Order Logic

Download Full-text

Formal Verification of the Alpha 21364 Network Protocol

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

10.1007/3-540-44659-1_28 ◽

2000 ◽

pp. 443-461 ◽

Cited By ~ 3

Author(s):

Abdel Mokkedem ◽

Tim Leonard

Keyword(s):

Formal Verification ◽

Network Protocol

Download Full-text

Graphical Theories of Interactive Systems: Can a Proof Assistant Help?

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

10.1007/3-540-44659-1_27 ◽

2000 ◽

pp. 442-442

Author(s):

Robin Milner

Keyword(s):

Interactive Systems ◽

Proof Assistant

Download Full-text

Proving ML Type Soundness Within Coq

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

10.1007/3-540-44659-1_9 ◽

2000 ◽

pp. 126-144 ◽

Cited By ~ 9

Author(s):

Catherine Dubois

Download Full-text

Routing Information Protocol in HOL/SPIN

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

10.1007/3-540-44659-1_4 ◽

2000 ◽

pp. 53-72 ◽

Cited By ~ 3

Author(s):

Karthikeyan Bhargavan ◽

Carl A. Gunter ◽

Davor Obradovic

Download Full-text

Intel’s Formal Verification Experience on the Willamette Development

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

10.1007/3-540-44659-1_7 ◽

2000 ◽

pp. 106-107 ◽

Cited By ~ 3

Author(s):

Bob Colwell ◽

Bob Brennan

Keyword(s):

Formal Verification

Download Full-text

Recursive Families of Inductive Types

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

10.1007/3-540-44659-1_5 ◽

2000 ◽

pp. 73-89 ◽

Cited By ~ 4

Author(s):

Venanzio Capretta

Keyword(s):

Inductive Types

Download Full-text

Weak Alternating Automata in Isabelle/HOL

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

10.1007/3-540-44659-1_26 ◽

2000 ◽

pp. 424-441 ◽

Cited By ~ 7

Author(s):

Stephan Merz

Keyword(s):

Alternating Automata

Download Full-text

Transcendental Functions and Continuity Checking in PVS

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

10.1007/3-540-44659-1_13 ◽

2000 ◽

pp. 197-214 ◽

Cited By ~ 11

Author(s):

Hanne Gottliebsen

Keyword(s):

Transcendental Functions

Download Full-text

Equational Reasoning via Partial Reflection

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

10.1007/3-540-44659-1_11 ◽

2000 ◽

pp. 162-178 ◽

Cited By ~ 6

Author(s):

H. Geuvers ◽

F. Wiedijk ◽

J. Zwanenburg

Keyword(s):

Partial Reflection ◽

Equational Reasoning

Download Full-text

Lecture Notes in Computer Science - Theorem Proving in Higher Order LogicsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Functional Procedures in Higher-Order Logic

Formal Verification of the Alpha 21364 Network Protocol

Graphical Theories of Interactive Systems: Can a Proof Assistant Help?

Proving ML Type Soundness Within Coq

Routing Information Protocol in HOL/SPIN

Intel’s Formal Verification Experience on the Willamette Development

Recursive Families of Inductive Types

Weak Alternating Automata in Isabelle/HOL

Transcendental Functions and Continuity Checking in PVS

Equational Reasoning via Partial Reflection

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