Static analysis of string encoders and decoders

DOI10.1007/978-3-642-35873-9_14MaRDI QIDQ2926645zbMATH OpenOpenAlexFDO

Authors Loris D'Antoni, Margus Veanes

Publication date 3 November 2014

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

Full work available at URL https://doi.org/10.1007/978-3-642-35873-9_14

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Formal languages and automata (68Q45)

Recommendations

• Symbolic string transformations with regular lookahead and rollback
• String Analysis via Automata Manipulation with Logic Circuit Representation
• Automata-based symbolic string analysis for vulnerability detection
• Symbolic finite state transducers: algorithms and applications
• Completeness in approximate transduction

Cited in

(6)

• Completeness of string analysis for dynamic languages
• A decision procedure for string to code point conversion
• Forward bisimulations for nondeterministic symbolic finite automata
• Symbolic string transformations with regular lookahead and rollback
• scientific article; zbMATH DE number 1832225 (Why is no real title available?)
• Extended symbolic finite automata and transducers

Describes a project that uses

Uses Software

• z3

This page was built for publication: Static analysis of string encoders and decoders

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