The accumulation of noise in quantum computers is the dominant issue stymieing push algorithms beyond their classical counterparts. We do not expect to be able afford overhead required for error correction next decade, so meantime we must rely on low-cost, unscalable mitigation techniques bring computing its full potential. This paper presents a new technique based phase estimation that can als...

We present an executable formally verified SAT encoding of ground classical AI planning problems. use the theorem prover Isabelle/HOL to perform verification. experimentally test and show that it can be used for reasonably sized standard benchmarks. also as a reference state-of-the-art SAT-based planner, showing sometimes falsely claims problems have no solutions certain lengths.

Abstract Modern SAT solvers can emit independently-checkable proof certificates to validate their results. The state-of-the-art system that allows for compact is propagation redundancy ( $$\textsf{PR}$$ PR ). However, the only existing method proofs in this with a formally verified tool requires transformatio...

We present an approach for implementing a formally certified loop-invariant code motion optimization by composing unrolling pass and yet efficient global subexpression elimination. This is lightweight: each comes with simple independent proof of correctness. Experiments show the significantly narrows performance gap between CompCert compiler state-of-the-art optimizing compilers. Our static ana...

Abstract Most methods of data transmission and storage are prone to errors, leading loss. Forward erasure correction (FEC) is a method allow be recovered in the presence errors by encoding with redundant parity information determined an error-correcting code. There dozens classes such codes, many based on sophisticated mathematics, making them difficult verify using automated tools. In this pap...

We have proved, with machine-checked proofs in Coq, that an OpenSSL implementation of HMAC with SHA256 correctly implements its FIPS functional specification and that its functional specification guarantees the expected cryptographic properties. This is the first machine-checked cryptographic proof that combines a source-program implementation proof, a compilercorrectness proof, and a cryptogra...

Formal verification of the security of software systems is gradually moving from the traditional focus on idealized models, to the more ambitious goal of producing verified implementations. This trend is also present in recent work targeting the verification of cryptographic software, but the reach of existing tools has so far been limited to cryptographic primitives, such as RSA-OAEP encryptio...