Mathematical programming: Turing completeness and applications to software analysis
DOI10.1007/S10878-014-9715-3zbMATH Open1358.68073OpenAlexW1975283720MaRDI QIDQ405669FDOQ405669
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
Recommendations
Theory of programming languages (68N15) Applications of mathematical programming (90C90) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- A lattice-theoretical fixpoint theorem and its applications
- Principles of Constraint Programming
- Title not available (Why is that?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Branching and bounds tighteningtechniques for non-convex MINLP
- L’algebre de Boole et ses applications en recherche operationnelle
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Systematic design of program transformation frameworks by abstract interpretation
- Static analysis by abstract interpretation: a mathematical programming approach
- Mathematical programming based debugging
- Title not available (Why is that?)
- Universal diophantine equation
- Flow diagrams, turing machines and languages with only two formation rules
- Computer Aided Verification
- Static Analysis by Policy Iteration on Relational Domains
- Precise Fixpoint Computation Through Strategy Iteration
- A minimalistic look at widening operators
Cited In (11)
- Modern view on Kantorovich's work in software
- Algorithmic completeness of imperative programming languages
- 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
- Distance geometry and data science
- Analyzing mathematical programs using MProbe
- Constraint qualification failure in action
- Title not available (Why is that?)
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Program correctness and matricial iteration theories
Uses Software
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)
