An even faster solver for general systems of equations

DOI10.1007/3-540-61739-6_42zbMath1482.68088OpenAlexW1567014300MaRDI QIDQ5030194

Christian Fecht, Helmut Seidl

Publication date: 16 February 2022

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61739-6_42

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semantics in the theory of computing (68Q55) Logic programming (68N17) Approximation algorithms (68W25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Unnamed Item ⋮ Enforcing termination of interprocedural analysis ⋮ Local higher-order fixpoint iteration

Cites Work

• An efficient general iterative algorithm for dataflow analysis
• A linear-time model-checking algorithm for the alternation-free modal mu- calculus
• An algebraic and algorithmic method for analysing transition systems
• Evaluation of the domain prop
• Abstract interpretation and application to logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An even faster solver for general systems of equations