Mathematical programming: Turing completeness and applications to software analysis

DOI10.1007/S10878-014-9715-3MaRDI QIDQ405669zbMATH OpenOpenAlexFDO

Authors 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

abstract interpretationstatic analysiscode verification

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3938596
• Algorithmic completeness of imperative programming languages
• scientific article; zbMATH DE number 622677
• Proof pearl: proving a simple von Neumann machine Turing complete
• Metamathematical fundamental concepts of computer programming

Cites work

• scientific article; zbMATH DE number 4045703 (Why is no real title available?)
• scientific article; zbMATH DE number 54095 (Why is no real title available?)
• A lattice-theoretical fixpoint theorem and its applications
• A minimalistic look at widening operators
• Branching and bounds tighteningtechniques for non-convex MINLP
• Computer Aided Verification
• Flow diagrams, turing machines and languages with only two formation rules
• L’algebre de Boole et ses applications en recherche operationnelle
• Mathematical programming based debugging
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Precise Fixpoint Computation Through Strategy Iteration
• Principles of Constraint Programming
• Static Analysis by Policy Iteration on Relational Domains
• Static analysis by abstract interpretation: a mathematical programming approach
• Systematic design of program transformation frameworks by abstract interpretation
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
• Universal diophantine equation

Cited in

(11)

• Program correctness and matricial iteration theories
• Algorithmic completeness of imperative programming languages
• Alternative regularizations for outer-approximation algorithms for convex MINLP
• Modern view on Kantorovich's work in software
• Analyzing mathematical programs using MProbe
• Distance geometry and data science
• Constraint qualification failure in action
• Maximum feasible subsystems of distance geometry constraints
• Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
• Programming and automating mathematics in the Tarski-Kleene hierarchy
• scientific article; zbMATH DE number 3938596 (Why is no real title available?)

Describes a project that uses

Uses Software

• AMPL
• CPLEX
• GLPK
• GAMS
• ROSE

This page was built for publication: Mathematical programming: Turing completeness and applications to software analysis

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