Mathematical programming: Turing completeness and applications to software analysis

DOI10.1007/s10878-014-9715-3zbMath1358.68073OpenAlexW1975283720MaRDI QIDQ405669

Leo Liberti, Fabrizio Marinelli

Publication date: 5 September 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9715-3

zbMATH Keywords

static analysisabstract interpretationcode verification

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Maximum feasible subsystems of distance geometry constraints, Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections, Distance geometry and data science, Constraint qualification failure in action, Alternative regularizations for outer-approximation algorithms for convex MINLP

Uses Software

• AMPL
• CPLEX
• GLPK
• GAMS
• ROSE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A minimalistic look at widening operators
• A lattice-theoretical fixpoint theorem and its applications
• Static Analysis by Abstract Interpretation: A Mathematical Programming Approach
• Branching and bounds tighteningtechniques for non-convex MINLP
• Principles of Constraint Programming
• L’algebre de Boole et ses applications en recherche operationnelle
• Universal diophantine equation
• Systematic design of program transformation frameworks by abstract interpretation
• Flow diagrams, turing machines and languages with only two formation rules
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
• Computer Aided Verification
• Static Analysis by Policy Iteration on Relational Domains
• Precise Fixpoint Computation Through Strategy Iteration
• On Computable Numbers, with an Application to the Entscheidungsproblem