May 9, 2022, 1:20 a.m. | Dominic P. Mulligan, Nick Spinale

cs.CR updates on arXiv.org arxiv.org

Interactive theorem proving software is typically designed around a trusted
proof-checking kernel, the sole system component capable of authenticating
theorems. Untrusted automation procedures reside outside of the kernel, and
drive it to deduce new theorems via an API. Kernel and untrusted automation are
typically implemented in the same programming language -- the "meta-language"
-- usually some functional programming language in the ML family. This strategy
-- introduced by Milner in his LCF proof assistant -- is a reliability
mechanism, aiming …

code kernel progress work

SOC 2 Manager, Audit and Certification

@ Deloitte | US and CA Multiple Locations

Digital Trust Cyber Transformation Senior

@ KPMG India | Mumbai, Maharashtra, India

Security Consultant, Assessment Services - SOC 2 | Remote US

@ Coalfire | United States

Sr. Systems Security Engineer

@ Effectual | Washington, DC

Cyber Network Engineer

@ SonicWall | Woodbridge, Virginia, United States

Security Architect

@ Nokia | Belgium