Symbolic finite state transducers
From MaRDI portal
Publication:2942866
DOI10.1145/2103656.2103674zbMath1321.68341OpenAlexW4242157899MaRDI QIDQ2942866
Nikolaj Bjørner, David Molnar, Margus Veanes, Pieter Hooimeijer, Benjamin Livshits
Publication date: 11 September 2015
Published in: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2103656.2103674
Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (19)
Using finite transducers for describing and synthesising structural time-series constraints ⋮ Invariants for time-series constraints ⋮ Foundations of Boolean stream runtime verification ⋮ Semantic Foundations for Deterministic Dataflow and Stream Processing ⋮ Equivalence of Finite-Valued Symbolic Finite Transducers ⋮ Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ On the Model Checking Problem for Some Extension of CTL* ⋮ Equivalence Checking Problem for Finite State Transducers over Semigroups ⋮ Forward and backward application of symbolic tree transducers ⋮ Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation ⋮ Static Analysis of Communicating Processes Using Symbolic Transducers ⋮ Word equations in synergy with regular constraints ⋮ Formalising and implementing Boost POSIX regular expression matching ⋮ Symbolic tree automata ⋮ Automata-based symbolic string analysis for vulnerability detection ⋮ Generating models of infinite-state communication protocols using regular inference with abstraction ⋮ Regular Programming for Quantitative Properties of Data Streams ⋮ Extended symbolic finite automata and transducers ⋮ Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels
This page was built for publication: Symbolic finite state transducers
