Practical probability: applying pGCL to lattice scheduling

DOI10.1007/978-3-642-39634-2_23zbMATH Open1317.68206OpenAlexW1867430516MaRDI QIDQ5327352FDOQ5327352

Authors: David Cock 

Publication date: 7 August 2013

Published in: Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39634-2_23

Recommendations

• Probabilistic guarded commands mechanized in HOL
• Probabilistic guarded commands mechanized in HOL
• Formalizing probabilistic noninterference
• Making Random Choices Invisible to the Scheduler
• Making random choices invisible to the scheduler

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (1)

• Formalizing probabilistic noninterference

Uses Software

• Isabelle
• pGCL

This page was built for publication: Practical probability: applying pGCL to lattice scheduling

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