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

9783540745907, 9783540745914

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Building Formal Method Tools in the Isabelle/Isar Framework

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

10.1007/978-3-540-74591-4_26 ◽

2007 ◽

pp. 352-367 ◽

Cited By ~ 11

Author(s):

Makarius Wenzel ◽

Burkhart Wolff

Keyword(s):

Formal Method

Download Full-text

A Monad-Based Modeling and Verification Toolbox with Application to Security Protocols

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

10.1007/978-3-540-74591-4_23 ◽

2007 ◽

pp. 302-318 ◽

Cited By ~ 6

Author(s):

Christoph Sprenger ◽

David Basin

Keyword(s):

Security Protocols

Download Full-text

Primality Proving with Elliptic Curves

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

10.1007/978-3-540-74591-4_24 ◽

2007 ◽

pp. 319-333 ◽

Cited By ~ 9

Author(s):

Laurent Théry ◽

Guillaume Hanrot

Keyword(s):

Elliptic Curves

Download Full-text

Formal Techniques in Software Engineering: Correct Software and Safe Systems

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

10.1007/978-3-540-74591-4_2 ◽

2007 ◽

pp. 3-4

Author(s):

Peter Liggesmeyer

Keyword(s):

Software Engineering ◽

Formal Techniques

Download Full-text

Improving the Usability of HOL Through Controlled Automation Tactics

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

10.1007/978-3-540-74591-4_13 ◽

2007 ◽

pp. 157-172

Author(s):

Eunsuk Kang ◽

Mark D. Aagaard

Download Full-text

Mizar’s Soft Type System

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

10.1007/978-3-540-74591-4_28 ◽

2007 ◽

pp. 383-399 ◽

Cited By ~ 7

Author(s):

Freek Wiedijk

Keyword(s):

Type System

Download Full-text

HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism

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

10.1007/978-3-540-74591-4_25 ◽

2007 ◽

pp. 334-351 ◽

Cited By ~ 5

Author(s):

Norbert Völker

Keyword(s):

Higher Order ◽

Second Order ◽

Order Logic ◽

Higher Order Logic

Download Full-text

Proof Pearl: The Termination Analysis of Terminator

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

10.1007/978-3-540-74591-4_12 ◽

2007 ◽

pp. 151-156

Author(s):

Joe Hurd

Keyword(s):

Termination Analysis

Download Full-text

A Modular Formalisation of Finite Group Theory

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

10.1007/978-3-540-74591-4_8 ◽

2007 ◽

pp. 86-101 ◽

Cited By ~ 27

Author(s):

Georges Gonthier ◽

Assia Mahboubi ◽

Laurence Rideau ◽

Enrico Tassi ◽

Laurent Théry

Keyword(s):

Finite Group ◽

Group Theory ◽

Finite Group Theory

Download Full-text

Extracting Purely Functional Contents from Logical Inductive Types

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

10.1007/978-3-540-74591-4_7 ◽

2007 ◽

pp. 70-85 ◽

Cited By ~ 5

Author(s):

David Delahaye ◽

Catherine Dubois ◽

Jean-Frédéric Étienne

Keyword(s):

Inductive Types

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Building Formal Method Tools in the Isabelle/Isar Framework

A Monad-Based Modeling and Verification Toolbox with Application to Security Protocols

Primality Proving with Elliptic Curves

Formal Techniques in Software Engineering: Correct Software and Safe Systems

Improving the Usability of HOL Through Controlled Automation Tactics

Mizar’s Soft Type System

HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism

Proof Pearl: The Termination Analysis of Terminator

A Modular Formalisation of Finite Group Theory

Extracting Purely Functional Contents from Logical Inductive Types

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