Symbolic string transformations with regular lookahead and rollback

DOI10.1007/978-3-662-46823-4_27MaRDI QIDQ3455084zbMATH OpenOpenAlexFDO

Authors Margus Veanes

Publication date 3 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46823-4_27

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45)

Recommendations

• Static analysis of string encoders and decoders
• DReX: a declarative language for efficiently evaluating regular string transformations
• Symbolic finite state transducers: algorithms and applications
• String Analysis via Automata Manipulation with Logic Circuit Representation
• Translating regular expression matching into transducers

Cited in

(5)

• DReX: a declarative language for efficiently evaluating regular string transformations
• Data-parallel string-manipulating programs
• Static analysis of string encoders and decoders
• Bex
• On strings in software model checking

Describes a project that uses

Uses Software

• z3
• JavaScript
• Sigma*
• Merlin
• Saner

This page was built for publication: Symbolic string transformations with regular lookahead and rollback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455084)