Automata and program analysis

DOI10.1007/978-3-662-55751-8_1MaRDI QIDQ1679950zbMATH OpenOpenAlexFDO

Authors Thomas Colcombet, Laure Daviaud, Florian Zuleger

Publication date 22 November 2017

Full work available at URL https://doi.org/10.1007/978-3-662-55751-8_1

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Recommendations

• Size-Change Abstraction and Max-Plus Automata
• Automata-based termination proofs
• The size-change principle for program termination
• scientific article; zbMATH DE number 176242
• Analyzing program termination and complexity automatically with \textsf{AProVE}

Cited in

(2)

• An analysis using dP automata
• Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning

This page was built for publication: Automata and program analysis

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