Porous invariants for linear systems

Cites Work

Unnamed Item
Porous invariants
Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
Affine relationships among variables of a program
Analyzing program termination and complexity automatically with \textsf{AProVE}
On the decidability of the existence of polyhedral invariants in transition systems
Ein Verfahren zur Behandlung gewisser exponentialer Gleichungen und diophantischer Gleichungen.
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
Reachability in Register Machines with Polynomial Updates
Undecidability of infinite post correspondence problem for instances of size 8
On the Complexity of the Orbit Problem
Undecidability of infinite post correspondence problem for instances of Size 9
Polynomial-time algorithm for the orbit problem
Fast Acceleration of Ultimately Periodic Relations
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
About the decision of reachability for register machines
Zwei Sätze über Gleichungen mit ganzzahligen Coefficienten.
Decision Problems for Linear Recurrence Sequences
O-Minimal Invariants for Discrete-Time Dynamical Systems
Polynomial Invariants for Affine Programs
The Polyhedron-Hitting Problem
Automated Technology for Verification and Analysis
Vector addition system reachability problem
Bounded Algol-Like Languages
Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
On the Monniaux problem in abstract interpretation

This page was built for publication: Porous invariants for linear systems