CSF is the first separation logic-based concolic testing engine for heap-manipulating programs that integrates specification-based testing to generate valid inputs with high coverage.
O’Hearn, and Hongseok Yang
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
representative citing papers
NullAway delivers practical compile-time null safety for Java with 1.15x build overhead and zero NPEs from its unsound assumptions in evaluated production Android crash data.
Presents a syntax-driven framework for incremental re-verification of KernelC programs with matching logic properties after changes, implemented in a prototype and evaluated for efficiency gains.
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
citing papers explorer
-
Concolic Testing Heap-Manipulating Programs
CSF is the first separation logic-based concolic testing engine for heap-manipulating programs that integrates specification-based testing to generate valid inputs with high coverage.
-
NullAway: Practical Type-Based Null Safety for Java
NullAway delivers practical compile-time null safety for Java with 1.15x build overhead and zero NPEs from its unsound assumptions in evaluated production Android crash data.
-
Syntax-driven Incremental Program Verification of Matching Logic Properties
Presents a syntax-driven framework for incremental re-verification of KernelC programs with matching logic properties after changes, implemented in a prototype and evaluated for efficiency gains.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
- The Lov\'{a}sz Local Lemma: Foundations and Applications