Validity Checking for Finite Automata over Linear Arithmetic Constraints

DOI10.1007/11944836_37MaRDI QIDQ5386003zbMATH OpenOpenAlexFDO

Authors Gary Wassermann, Zhendong Su

Publication date 17 April 2008

Published in FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11944836_37

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1538036
• scientific article; zbMATH DE number 2090515
• An effective decision procedure for linear arithmetic over the integers and reals
• Symbolic automata constraint solving
• scientific article; zbMATH DE number 1962792

Cited in

(1)

• Affine automata verifiers

This page was built for publication: Validity Checking for Finite Automata over Linear Arithmetic Constraints

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