Automata-based representations for arithmetic constraints in automated verification

DOI10.1007/3-540-44977-9_30MaRDI QIDQ4418627zbMATH OpenFDO

Authors Constantinos Bartzis, Tevfik Bultan

Publication date 11 August 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2608/26080282.htm

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Efficient Symbolic Representations for Arithmetic Constraints in Verification
• scientific article; zbMATH DE number 2090515
• On the construction of automata from linear arithmetic constraints
• Efficient image computation in infinite state model checking.
• Convex Hull of Arithmetic Automata

Cited in

(6)

• Convex Hull of Arithmetic Automata
• On the construction of automata from linear arithmetic constraints
• scientific article; zbMATH DE number 2090515 (Why is no real title available?)
• Validity Checking for Finite Automata over Linear Arithmetic Constraints
• Efficient Symbolic Representations for Arithmetic Constraints in Verification
• Efficient image computation in infinite state model checking.

Describes a project that uses

Uses Software

• MONA
• HyTech

This page was built for publication: Automata-based representations for arithmetic constraints in automated verification

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