Newtonian program analysis via tensor product

DOI10.1145/2837614.2837659zbMath1347.68094OpenAlexW2289508293MaRDI QIDQ2828307

Prathmesh Prabhu, Emma Turetsky, Thomas W. 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

Newton's methodtensor productsemiringregular expressioninterprocedural program analysispolynomial fixed-point equation

Mathematics Subject Classification ID

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

Related Items (3)

Algebraic program analysis ⋮ Introduction to the special issue on computational logic for verification ⋮ Tree dimension in verification of constrained Horn clauses

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