Mathematical programming: Turing completeness and applications to software analysis (Q405669): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-014-9715-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975283720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow diagrams, turing machines and languages with only two formation rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systematic design of program transformation frameworks by abstract interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: L’algebre de Boole et ses applications en recherche operationnelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Analysis by Policy Iteration on Relational Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precise Fixpoint Computation Through Strategy Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Analysis by Abstract Interpretation: A Mathematical Programming Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal diophantine equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: There Cannot be any Algorithm for Integer Programming with Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimalistic look at widening operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank

Latest revision as of 00:58, 9 July 2024

scientific article
Language Label Description Also known as
English
Mathematical programming: Turing completeness and applications to software analysis
scientific article

    Statements

    Mathematical programming: Turing completeness and applications to software analysis (English)
    0 references
    0 references
    0 references
    5 September 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    static analysis
    0 references
    abstract interpretation
    0 references
    code verification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references