Matches in SemOpenAlex for { <https://semopenalex.org/work/W4298093245> ?p ?o ?g. }
Showing items 1 to 72 of
72
with 100 items per page.
- W4298093245 abstract "In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data structure to which x points is greater than the depth of the structure pointed to by x.fld, and allows bounding the number of iterations of a loop which traverses the data structure on fld. In general, proving termination needs acyclicity, unless program-specific or non-automated reasoning is performed. However, recent work could prove that certain loops terminate even without inferring acyclicity, because they traverse data structures acyclically. Consider a double-linked list: if it is possible to demonstrate that every cycle involves both the next and the prev field, then a traversal on next terminates since no cycle will be traversed completely. This paper develops a static analysis inferring field-sensitive reachability and cyclicity information, which is more general than existing approaches. Propositional formulae are computed, which describe which fields may or may not be traversed by paths in the heap. Consider a tree with edges left and right to the left and right sub-trees, and parent to the parent node: termination of a loop traversing leaf-up cannot be guaranteed by state-of-the-art analyses. Instead, propositional formulae computed by this analysis indicate that cycles must traverse parent and at least one between left and right: termination is guaranteed as no cycle is traversed completely. This paper defines the necessary abstract domains and builds an abstract semantics on them. A prototypical implementation provides the expected result on relevant examples." @default.
- W4298093245 created "2022-10-01" @default.
- W4298093245 creator A5014510097 @default.
- W4298093245 creator A5067489706 @default.
- W4298093245 date "2013-06-27" @default.
- W4298093245 modified "2023-09-29" @default.
- W4298093245 title "Inference of Field-Sensitive Reachability and Cyclicity" @default.
- W4298093245 doi "https://doi.org/10.48550/arxiv.1306.6526" @default.
- W4298093245 hasPublicationYear "2013" @default.
- W4298093245 type Work @default.
- W4298093245 citedByCount "0" @default.
- W4298093245 crossrefType "posted-content" @default.
- W4298093245 hasAuthorship W4298093245A5014510097 @default.
- W4298093245 hasAuthorship W4298093245A5067489706 @default.
- W4298093245 hasBestOaLocation W42980932451 @default.
- W4298093245 hasConcept C113174947 @default.
- W4298093245 hasConcept C11413529 @default.
- W4298093245 hasConcept C114614502 @default.
- W4298093245 hasConcept C118615104 @default.
- W4298093245 hasConcept C13280743 @default.
- W4298093245 hasConcept C134757568 @default.
- W4298093245 hasConcept C136643341 @default.
- W4298093245 hasConcept C140745168 @default.
- W4298093245 hasConcept C154945302 @default.
- W4298093245 hasConcept C162319229 @default.
- W4298093245 hasConcept C176809094 @default.
- W4298093245 hasConcept C199360897 @default.
- W4298093245 hasConcept C202444582 @default.
- W4298093245 hasConcept C205649164 @default.
- W4298093245 hasConcept C2776214188 @default.
- W4298093245 hasConcept C33923547 @default.
- W4298093245 hasConcept C41008148 @default.
- W4298093245 hasConcept C63584917 @default.
- W4298093245 hasConcept C80444323 @default.
- W4298093245 hasConcept C9652623 @default.
- W4298093245 hasConceptScore W4298093245C113174947 @default.
- W4298093245 hasConceptScore W4298093245C11413529 @default.
- W4298093245 hasConceptScore W4298093245C114614502 @default.
- W4298093245 hasConceptScore W4298093245C118615104 @default.
- W4298093245 hasConceptScore W4298093245C13280743 @default.
- W4298093245 hasConceptScore W4298093245C134757568 @default.
- W4298093245 hasConceptScore W4298093245C136643341 @default.
- W4298093245 hasConceptScore W4298093245C140745168 @default.
- W4298093245 hasConceptScore W4298093245C154945302 @default.
- W4298093245 hasConceptScore W4298093245C162319229 @default.
- W4298093245 hasConceptScore W4298093245C176809094 @default.
- W4298093245 hasConceptScore W4298093245C199360897 @default.
- W4298093245 hasConceptScore W4298093245C202444582 @default.
- W4298093245 hasConceptScore W4298093245C205649164 @default.
- W4298093245 hasConceptScore W4298093245C2776214188 @default.
- W4298093245 hasConceptScore W4298093245C33923547 @default.
- W4298093245 hasConceptScore W4298093245C41008148 @default.
- W4298093245 hasConceptScore W4298093245C63584917 @default.
- W4298093245 hasConceptScore W4298093245C80444323 @default.
- W4298093245 hasConceptScore W4298093245C9652623 @default.
- W4298093245 hasLocation W42980932451 @default.
- W4298093245 hasLocation W42980932452 @default.
- W4298093245 hasOpenAccess W4298093245 @default.
- W4298093245 hasPrimaryLocation W42980932451 @default.
- W4298093245 hasRelatedWork W1979520342 @default.
- W4298093245 hasRelatedWork W1987635382 @default.
- W4298093245 hasRelatedWork W2354594976 @default.
- W4298093245 hasRelatedWork W2361165494 @default.
- W4298093245 hasRelatedWork W2368134538 @default.
- W4298093245 hasRelatedWork W2951775680 @default.
- W4298093245 hasRelatedWork W3090291499 @default.
- W4298093245 hasRelatedWork W3107784446 @default.
- W4298093245 hasRelatedWork W3110101717 @default.
- W4298093245 hasRelatedWork W4287647396 @default.
- W4298093245 isParatext "false" @default.
- W4298093245 isRetracted "false" @default.
- W4298093245 workType "article" @default.