Monotonic Abstraction for Programs with Dynamic Memory Heaps (Q3512503): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-70545-1_33 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1606654639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic Abstraction for Programs with Dynamic Memory Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of programs with well quasi-ordered domains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Verification of Infinite-State Processes with Global Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of systems with many identical timed processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2004 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shape Analysis of Single-Parent Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shape Analysis for Composite Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programs with Lists Are Counter Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Regular Tree Model Checking of Complex Dynamic Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Termination Proofs for Programs with Shape-Shifting Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking with rich assertional languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying properties of well-founded linked lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A closed-form evaluation for Datalog queries with integer (gap)-order constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank

Latest revision as of 13:29, 28 June 2024

scientific article
Language Label Description Also known as
English
Monotonic Abstraction for Programs with Dynamic Memory Heaps
scientific article

    Statements

    Monotonic Abstraction for Programs with Dynamic Memory Heaps (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 July 2008
    0 references
    0 references
    0 references
    0 references
    0 references