Theorem Proving in Higher Order Logics

DOI10.1007/11541868zbMATH Open1152.68423OpenAlexW2484880499MaRDI QIDQ5477643FDOQ5477643

Wolfgang J. Paul, Mark A. Hillebrand, Mauro Gargano, Dirk C. Leinenbach

Publication date: 6 July 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11541868

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Cited In (7)

• Balancing the load. Leveraging a semantics stack for systems verification
• SOME RESULTS ON (PRE)KERNEL CATCHERS AND THE COINCIDENCE OF THE KERNEL WITH PREKERNEL
• Certifying low-level programs with hardware interrupts and preemptive threads
• Operating system verification---an overview
• Title not available (Why is that?)
• On the correctness of upper layers of automotive systems
• Secure Microkernels, State Monads and Scalable Refinement

   Recommendations

• Title not available (Why is that?) 👍 👎
• Operating system verification---an overview 👍 👎
• Title not available (Why is that?) 👍 👎
• From a Proven Correct Microkernel to Trustworthy Large Systems 👍 👎
• Toward compositional verification of interruptible OS kernels and device drivers 👍 👎

This page was built for publication: Theorem Proving in Higher Order Logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477643)