Newtonian program analysis via tensor product

DOI10.1145/2837614.2837659MaRDI QIDQ2828307zbMATH OpenOpenAlexFDO

Authors Emma Turetsky, Prathmesh Prabhu, Thomas Reps

Publication date 24 October 2016

Published in Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

zbMATH Keywords

tensor productNewton's methodsemiringregular expressioninterprocedural program analysispolynomial fixed-point equation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semirings (16Y60)

Recommendations

• Newtonian program analysis
• Newtonian program analysis -- an introduction
• On direct sums and tensor products of non-linear programs
• Unified complexity analysis for Newton LP methods
• A Newton-type algorithm for the tensor eigenvalue complementarity problem and some applications
• The Newton-type methods for problems of mathematical programming
• Newton: Constraint programming over nonlinear constraints
• NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING
• A Newton method for linear programming
• Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor

Cited in

(7)

• Algebraic program analysis
• On direct sums and tensor products of non-linear programs
• scientific article; zbMATH DE number 3942992 (Why is no real title available?)
• Introduction to the special issue on computational logic for verification
• Newtonian program analysis
• Newtonian program analysis -- an introduction
• Tree dimension in verification of constrained Horn clauses

This page was built for publication: Newtonian program analysis via tensor product

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