Newtonian program analysis

DOI10.1145/1857914.1857917MaRDI QIDQ2999782zbMATH OpenOpenAlexFDO

Authors Javier Esparza, Stefan Kiefer, 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

interprocedural program analysisNewton's methodpolynomial fixed-point equationssemirings

Mathematics Subject Classification ID

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

Recommendations

• Newtonian program analysis -- an introduction
• Newton’s Method for ω-Continuous Semirings
• Newtonian program analysis via tensor product
• An Extension of Newton’s Method to ω-Continuous Semirings
• Putting Newton into practice: a solver for polynomial equations over semirings

Cited in

(25)

• An efficient general iterative algorithm for dataflow analysis
• Conditions for incremental iteration: Examples and counterexamples
• A type checking algorithm for concurrent object protocols
• Parikh's theorem: a simple and direct automaton construction
• Approximate minimization of weighted tree automata
• Equational theories for automata
• Fuzzy set abstraction
• Computing least and greatest fixed points in absorptive semirings
• The finite index restriction meets hybrid modes in cooperating distributed grammar systems
• Newtonian program analysis via tensor product
• Putting Newton into practice: a solver for polynomial equations over semirings
• Newtonian program analysis -- an introduction
• Newton’s Method for ω-Continuous Semirings
• On Fixed Point Equations over Commutative Semirings
• Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
• scientific article; zbMATH DE number 3942992 (Why is no real title available?)
• Introduction to the special issue on computational logic for verification
• Tree dimension in verification of constrained Horn clauses
• An Extension of Newton’s Method to ω-Continuous Semirings
• \textsc{FPsolve}: a generic solver for fixpoint equations over semirings
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• Combining fixpoint and differentiation theory
• Convergence of datalog over (pre-) semirings
• Algebraic program analysis
• Convergence of Newton's method over commutative semirings

This page was built for publication: Newtonian program analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999782)