On the public citation graph

Validating SMT Solvers for Correctness and Performance via Grammar-Based Enumeration

https://doi.org/10.1145/3689795
0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11513988_4openalex-snapshot
SMT-COMP: Satisfiability Modulo Theories Competition
inferredcites →https://doi.org/10.1007/978-3-030-63618-0_5openalex-snapshot
BanditFuzz: A Reinforcement-Learning Based Performance Fuzzer for SMT Solvers
inferredcites →https://doi.org/10.1007/978-3-031-13185-1_1openalex-snapshot
A Billion SMT Queries a Day (Invited Paper)
inferredcites →https://doi.org/10.1007/978-3-031-13188-2_5openalex-snapshot
Murxla: A Modular and Highly Extensible API Fuzzer for SMT Solvers
inferredcites →https://doi.org/10.1007/978-3-319-10575-8_11openalex-snapshot
Satisfiability Modulo Theories
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-00768-2_16openalex-snapshot
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
inferredcites →https://doi.org/10.1007/978-3-642-10672-9_3openalex-snapshot
The Sketching Approach to Program Synthesis
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_14openalex-snapshot
CVC4
inferredcites →https://doi.org/10.1007/bf02235512openalex-snapshot
Generating test programs from syntax
inferredcites →https://doi.org/10.1007/s12532-020-00194-3openalex-snapshot
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
inferredcites →https://doi.org/10.1016/j.jvlc.2018.10.004openalex-snapshot
On declarative rewriting for sound and complete union, intersection and negation types
inferredcites →https://doi.org/10.1109/32.538605openalex-snapshot
Elements of style: analyzing a software design feature with a counterexample detector
inferredcites →https://doi.org/10.1145/1013886.1007531openalex-snapshot
Software assurance by bounded exhaustive testing
inferredcites →https://doi.org/10.1145/1064978.1065036openalex-snapshot
DART
inferredcites →https://doi.org/10.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferredcites →https://doi.org/10.1145/1167473.1167488openalex-snapshot
The DaCapo benchmarks
inferredcites →https://doi.org/10.1145/1411286.1411292openalex-snapshot
Smallcheck and lazy smallcheck
inferredcites →https://doi.org/10.1145/1670412.1670413openalex-snapshot
Fuzzing and delta-debugging SMT solvers
inferredcites →https://doi.org/10.1145/1993316.1993532openalex-snapshot
Finding and understanding bugs in C compilers
inferredcites →https://doi.org/10.1145/2430532.2364515openalex-snapshot
Feat
inferredcites →https://doi.org/10.1145/2594291.2594340openalex-snapshot
A lightweight symbolic virtual machine for solver-aided host languages
inferredcites →https://doi.org/10.1145/3140587.3062379openalex-snapshot
Skeletal program enumeration for rigorous compiler testing
inferredcites →https://doi.org/10.1145/3368089.3409763openalex-snapshot
Detecting critical bugs in SMT solvers using blackbox mutational fuzzing
inferredcites →https://doi.org/10.1145/3377811.3380398openalex-snapshot
Automatically testing string solvers
inferredcites →https://doi.org/10.1145/3385412.3385985openalex-snapshot
Validating SMT solvers via semantic fusion
inferredcites →https://doi.org/10.1145/3428261openalex-snapshot
On the unusual effectiveness of type-aware operator mutations for testing SMT solvers
inferredcites →https://doi.org/10.1145/3443420openalex-snapshot
A Lightweight Formalism for Reference Lifetimes and Borrowing in Rust
inferredcites →https://doi.org/10.1145/3460319.3464803openalex-snapshot
Fuzzing SMT solvers via two-dimensional input space exploration
inferredcites →https://doi.org/10.1145/3468264.3468540openalex-snapshot
Skeletal approximation enumeration for SMT solver testing
inferredcites →https://doi.org/10.1145/3485529openalex-snapshot
Generative type-aware mutation for testing SMT solvers
inferredcites →https://doi.org/10.1145/351240.351266openalex-snapshot
QuickCheck
inferredcites →https://doi.org/10.1145/505145.505149openalex-snapshot
Alloy
inferredcites →https://doi.org/10.1147/sj.94.0242openalex-snapshot
Automatic generation of test cases
inferredcites →https://doi.org/10.1609/aimag.v37i2.2620openalex-snapshot
The CADE ATP System Competition — CASC

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-94578-6_2openalex-snapshot
Language-Based Testing for Knowledge Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-07106-4_8openalex-snapshot
Bounded-Exhaustive Subspace Diversification for SMT Solver Testing
inferred← citeshttps://doi.org/10.1007/978-3-032-10794-7_20openalex-snapshot
Model-Based Testing of an Intermediate Verifier Using Executable Operational Semantics
inferred← citeshttps://doi.org/10.1103/v8f8-s11vopenalex-snapshot
Can large language models correctly interpret equations with errors?
inferred← citeshttps://doi.org/10.1109/swc65939.2025.00133openalex-snapshot
Embedded C Code Safety Analysis with Automated Fault Tree Synthesis for Automotive Virtualization Systems
inferred← citeshttps://doi.org/10.1145/3763093openalex-snapshot
Validating SMT Rewriters via Rewrite Space Exploration Supported by Generative Equality Saturation
inferred← citeshttps://doi.org/10.1145/3763171openalex-snapshot
Validating Soundness and Completeness in Pattern-Match Coverage Analyzers
inferred← citeshttps://doi.org/10.1145/3779212.3790195openalex-snapshot
Once4All: Skeleton-Guided SMT Solver Fuzzing with LLM-Synthesized Generators
inferred← citeshttps://doi.org/10.1145/3788862openalex-snapshot
Oracle-Guided SMT Solver Validation via Synthesizing Diverse Formulas with Multiple Assignments
inferred← citeshttps://doi.org/10.1145/3798262openalex-snapshot
Prunario: Testing Autonomous Driving Systems by Pruning Likely Redundant Scenarios
inferred← citeshttps://doi.org/10.1145/3832211openalex-snapshot
IterTestQ: Assembly-Level, Cross-Platform Testing of Quantum Computing Platforms
inferred← citeshttps://doi.org/10.1145/3839537openalex-snapshot
Validating Optimizing SMT Solvers via Cross-Theory Approximation
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.