Path Feasibility Analysis for String-Manipulating Programs (Q3617764): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/978-3-642-00768-2_27 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117402063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Else Is Decidable about Integer Arrays? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Structures: Richness and Limitations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic execution and program testing / rank
 
Normal rank

Latest revision as of 04:45, 29 June 2024

scientific article
Language Label Description Also known as
English
Path Feasibility Analysis for String-Manipulating Programs
scientific article

    Statements

    Identifiers

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