Generating invariants for non-linear loops by linear algebraic methods
From MaRDI portal
Publication:903492
DOI10.1007/s00165-015-0333-3zbMath1347.68093OpenAlexW1994657885MaRDI QIDQ903492
Rachid Rebiha, Nadir Matringe, Arnaldo Vieira Moura
Publication date: 6 January 2016
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-015-0333-3
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Automatic generation of polynomial invariants of bounded degree using abstract interpretation
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Generating all polynomial invariants in simple loops
- Non-linear loop invariant generation using Gröbner bases
- Computing Differential Invariants of Hybrid Systems as Fixedpoints
- Constraint-Based Approach for Analysis of Hybrid Systems
- Generating Box Invariants
- Generating Polynomial Invariants with DISCOVERER and QEPCAD
- Temporal Verification of Reactive Systems: Response
- Abstract interpretation and application to logic programs
- Generating Invariants for Non-linear Hybrid Systems by Linear Algebraic Methods
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Reasoning Algebraically About P-Solvable Loops
- Endomorphisms for Non-trivial Non-linear Loop Invariant Generation
- An axiomatic basis for computer programming
- Verification, Model Checking, and Abstract Interpretation
- SAGE
- Programming Languages and Systems
- Lagrange resolvents
This page was built for publication: Generating invariants for non-linear loops by linear algebraic methods
