We propose a fully-automated technique for inverting functional programs that operate over lists such as string encoders and decoders.
Abstract. We propose a fully-automated technique for inverting func- tional programs that operate over lists such as string encoders and decoders.
We propose a fully-automated technique for inverting functional programs that operate over lists such as string encoders and decoders.
We propose a fully-automated technique for inverting functional programs that operate over lists such as string encoders and decoders.
Jun 23, 2021 · Bibliographic details on Automatic program inversion using symbolic transducers.
We propose a fully-automated technique for inverting functional programs that operate over lists such as string encoders and decoders.
People also ask
What are transducers and inverse transducers?
What is the power of symbolic automata and transducers?
Abstract. Symbolic automata extend classic finite state automata by allowing transitions to carry predicates over rich alphabet theories.
Abstract. Symbolic automata and transducers extend finite automata and transducers by allowing transitions to carry predicates and functions.