Newtonian program analysis

DOI10.1145/1857914.1857917zbMath1327.68079OpenAlexW2139929430MaRDI QIDQ2999782

Stefan Kiefer, Javier Esparza, Michael Luttenberger

Publication date: 16 May 2011

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1857914.1857917

zbMATH Keywords

Newton's methodsemiringspolynomial fixed-point equationsinterprocedural program analysis

Mathematics Subject Classification ID

Semirings (16Y60) Continuous lattices and posets, applications (06B35) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (13)

Fuzzy set abstraction ⋮ Algebraic program analysis ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Convergence of Newton's method over commutative semirings ⋮ Parikh's theorem: a simple and direct automaton construction ⋮ Computing least and greatest fixed points in absorptive semirings ⋮ Introduction to the special issue on computational logic for verification ⋮ Tree dimension in verification of constrained Horn clauses ⋮ FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings ⋮ A type checking algorithm for concurrent object protocols ⋮ The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems ⋮ Approximate minimization of weighted tree automata ⋮ Equational theories for automata

This page was built for publication: Newtonian program analysis