You have Guest access.
Log In
Joe Hurd and Tom Melham
Front matter
1-16
On the Correctness of Operating System Kernels
17-34
Alpha-Structural Recursion and Induction (Extended Abstract)
35-49
Shallow Lazy Proofs
50-65
Mechanized Metatheory for the Masses: The PoplMark Challenge
66-81
A Structured Set of Higher-Order Problems
82-97
Formal Modeling of a Slicing Algorithm for Java Event Spaces in PVS
98-113
Proving Equalities in a Commutative Ring Done Right in Coq
114-129
A HOL Theory of Euclidean Space
130-146
A Design Structure for Higher Order Quotients
147-162
Axiomatic Constructor Classes in Isabelle/HOLCF
163-178
Meta Reasoning in ACL2
179-194
Reasoning About Java Programs with Aliasing and Frame Conditions
195-210
Real Number Calculations and Theorem Proving
211-226
Verifying a Secure Information Flow Analyzer
227-244
Proving Bounds for Real Linear Programs in Isabelle/HOL
245-260
Essential Incompleteness of Arithmetic Verified by Coq
261-277
Verification of BDD Normalization
278-293
Extensionality in the Calculus of Constructions
294-309
A Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic
310-325
A Generic Network on Chip Model
326-341
Formal Verification of a SHA-1 Circuit Core Using ACL2
342-357
From PSL to LTL: A Formal Validation in HOL
358-372
Proof Pearl: A Formal Proof of Higman’s Lemma in ACL2
373-384
Proof Pearl: Dijkstra’s Shortest Path Algorithm Verified with ACL2
385-396
Proof Pearl: Defining Functions over Finite Sets
397-408
Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info