Iterating Octagons (Q3617767): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 05:45, 29 June 2024

scientific article

Language	Label	Description	Also known as
English	Iterating Octagons	scientific article

Statements

scholarly article

0 references

Iterating Octagons (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-00768-2_29

0 references

0 references

Codruţa Gîrlea

0 references

0 references

Tools and Algorithms for the Construction and Analysis of Systems

0 references

publication date

31 March 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-00768-2_29

0 references

0 references

A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages

0 references

An Improved Tight Closure Algorithm for Integer Octagonal Constraints

0 references

On iterating linear transformations over recognizable sets of integers

0 references

Iterating Octagons

0 references

A Logic of Singly Indexed Arrays

0 references

Flat Parametric Counter Automata

0 references

0 references

What Else Is Decidable about Integer Arrays?

0 references

Reversal-Bounded Multicounter Machines and Their Decision Problems

0 references

Automated Technology for Verification and Analysis

0 references

The octagon abstract domain

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3617767

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3617767&oldid=35100977"