{"paper":{"title":"Interacting via the Heap in the Presence of Recursion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Dorel Lucanu (Alexandru Ioan Cuza University, Frank de Boer (Centrum Wiskunde en Informatica (CWI), Irina M\\u{a}riuca As\\u{a}voae (Alexandru Ioan Cuza University, Jurriaan Rot (LIACS - Leiden University, Marcello M. Bonsangue (LIACS - Leiden University, Romania), the Netherlands)","submitted_at":"2012-12-17T03:42:47Z","abstract_excerpt":"Almost all modern imperative programming languages include operations for  dynamically manipulating the heap, for example by allocating and deallocating  objects, and by updating reference fields.  In the presence of recursive  procedures and local variables the interactions of a program with the heap can become rather complex, as an unbounded number of objects can be  allocated either on the call stack using local variables, or, anonymously,  on the heap using reference fields. As such a static analysis is, in general,  undecidable.\n  In this paper we study the verification of recursive progr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3879","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}