{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:28Z","timestamp":1763468128466},"reference-count":1,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,2]]},"abstract":"<jats:p> We investigate the use of monotonic abstraction and backward reachability analysis as means of performing shape analysis on programs with multiply pointed structures. By encoding the heap as a vertex- and edge-labeled graph, we can model the low level behaviour exhibited by programs written in the C programming language. Using the notion of signatures, which are predicates that define sets of heaps, we can check properties such as absence of null pointer dereference and shape invariants. We report on the results from running a prototype based on the method on several programs such as insertion into and merging of doubly-linked lists. <\/jats:p>","DOI":"10.1142\/s0129054113400078","type":"journal-article","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T03:23:44Z","timestamp":1370229824000},"page":"187-210","source":"Crossref","is-referenced-by-count":4,"title":["MONOTONIC ABSTRACTION FOR PROGRAMS WITH MULTIPLY-LINKED STRUCTURES"],"prefix":"10.1142","volume":"24","author":[{"given":"PAROSH AZIZ","family":"ABDULLA","sequence":"first","affiliation":[{"name":"Department of Information Technology, Uppsala University, P. O. Box 337, S-751 05 Uppsala, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JONATHAN","family":"CEDERBERG","sequence":"additional","affiliation":[{"name":"Department of Information Technology, Uppsala University, P. O. Box 337, S-751 05 Uppsala, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TOM\u00c1\u0160","family":"VOJNAR","sequence":"additional","affiliation":[{"name":"IT4Innovations Centre of Excellence, FIT, Brno University of Technology, Bo\u017eet\u011bchova 2, CZ-612 66 Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,6,3]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1294171129"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113400078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T08:57:38Z","timestamp":1565168258000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113400078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":1,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2013,6,3]]},"published-print":{"date-parts":[[2013,2]]}},"alternative-id":["10.1142\/S0129054113400078"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113400078","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2]]}}}