Underapproximation for Model-Checking Based on Random Cryptographic Constructions
Abstract elided by the publisher.
Related papers
- SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq TOPLAS 2023
- Proof-guided underapproximation-widening for multi-process systems POPL 2005
- Proof-Guided Underapproximation Widening for Bounded Model Checking CAV 2022
- A probabilistic separation logic POPL 2020
- Integrating Proof-Based and Model-Checking Techniques for the Formal Verification of Cryptographic Protocols CAV 1998
- Splittable pseudorandom number generators using cryptographic hashing Haskell 2013
- CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives PLDI 2023
- Accelerated Bounded Model Checking Using Interpolation Based Summaries TACAS 2024