Interprocedural Reachability for Flat Integer Programs (Q2947875): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1931752165 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1405.3069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Push-Down Automata with Gap-Order Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding nesting structure to words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Acceleration of Ultimately Periodic Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of gap-order constraint abstractions of counter systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taming Past LTL and Flat Counter Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of pattern-based verification for multithreaded programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Underapproximation of Procedure Summaries for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant Checking for Programs with Procedure Calls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonelementary Complexities for Branching VASS, MELL, and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of languages having only finite-index grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control sets on grammars using depth-first derivations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The octagon abstract domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A closed-form evaluation for Datalog queries with integer (gap)-order constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:41, 10 July 2024

scientific article
Language Label Description Also known as
English
Interprocedural Reachability for Flat Integer Programs
scientific article

    Statements

    Interprocedural Reachability for Flat Integer Programs (English)
    0 references
    0 references
    0 references
    29 September 2015
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references