Efficient Minimization up to Location Equivalence
Abstract elided by the publisher.
Related papers
- Minimal-Time Synthesis for Parametric Timed Automata TACAS 2019
- Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis SAS 2007
- Advanced automata minimization POPL 2013
- Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time TACAS 2022
- Sharing code among instances of Ada generics PLDI 1984
- ddSMT 2.0: Better Delta Debugging for the SMT-LIBv2 Language and Friends CAV 2021
- Efficiently reclaiming memory in concurrent search data structures while bounding wasted memory PPoPP 2021
- Compositional Generator Equivalence ICFP 2026