Convex Hull of Arithmetic Automata

DOI10.1007/978-3-540-69166-2_4MaRDI QIDQ3522060zbMATH OpenOpenAlexFDO

Authors Jérôme Leroux

Publication date 28 August 2008

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69166-2_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Computing Convex Hulls by Automata Iteration
• COMPUTING CONVEX HULLS BY AUTOMATA ITERATION
• On the expressiveness of real and integer arithmetic automata. (Extended abstract)
• On the use of weak automata for deciding linear arithmetic with integer and real variables
• Automata-based representations for arithmetic constraints in automated verification

Cites work

• Accelerated Data-Flow Analysis
• Acceleration in Convex Data-Flow Analysis
• Affine relationships among variables of a program
• An effective decision procedure for linear arithmetic over the integers and reals
• scientific article; zbMATH DE number 4083375 (Why is no real title available?)
• Implementation and Application of Automata
• On the expressiveness of real and integer arithmetic automata. (Extended abstract)
• TaPAS: The Talence Presburger Arithmetic Suite
• The affine hull of a binary automaton is computable in polynomial time
• The convex hull of a regular set of integer vectors is polyhedral and effectively computable
• The Power of Hybrid Acceleration

Cited in

(5)

• The affine hull of a binary automaton is computable in polynomial time
• COMPUTING CONVEX HULLS BY AUTOMATA ITERATION
• Computing Convex Hulls by Automata Iteration
• Automata-based representations for arithmetic constraints in automated verification
• On the use of weak automata for deciding linear arithmetic with integer and real variables

This page was built for publication: Convex Hull of Arithmetic Automata

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