Smten: Automatic Translation of High-Level Symbolic Computations into SMT Queries
No abstract available.
Related papers
- Smten with satisfiability-based search OOPSLA 2014
- Type Targeted Testing ESOP 2015
- Compiling Higher-Order Specifications to SMT Solvers: How to Deal with Rejection Constructively CPP 2023
- SPPL: probabilistic programming with fast exact symbolic inference PLDI 2021
- Formulog: Datalog for SMT-based static analysis OOPSLA 2020
- A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite Automata PLDI 2024
- Tabby: A Synthesis-Aided Compiler for High-Performance Zero-Knowledge Proof Circuits OOPSLA 2025
- SMT-Based Translation Validation for Machine Learning Compiler CAV 2022