{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1362825896256190592.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1145/514188.514190"}},{"identifier":{"@type":"URI","@value":"https://dl.acm.org/doi/10.1145/514188.514190"}},{"identifier":{"@type":"URI","@value":"https://dl.acm.org/doi/pdf/10.1145/514188.514190"}}],"dc:title":[{"@value":"Parametric shape analysis via 3-valued logic"}],"description":[{"type":"abstract","notation":[{"@value":"<jats:p>Shape analysis concerns the problem of determining \"shape invariants\" for programs that perform destructive updating on dynamically allocated storage. This article presents a parametric framework for shape analysis that can be instantiated in different ways to create different shape-analysis algorithms that provide varying degrees of efficiency and precision. A key innovation of the work is that the stores that can possibly arise during execution are represented (conservatively) using 3-valued logical structures. The framework is instantiated in different ways by varying the predicates used in the 3-valued logic. The class of programs to which a given instantiation of the framework can be applied is not limited a priori (i.e., as in some work on shape analysis, to programs that manipulate only lists, trees, DAGS, etc.); each instantiation of the framework can be applied to any program, but may produce imprecise results (albeit conservative ones) due to the set of predicates employed.</jats:p>"}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1382825896256190592","@type":"Researcher","foaf:name":[{"@value":"Mooly Sagiv"}]},{"@id":"https://cir.nii.ac.jp/crid/1382825896256190593","@type":"Researcher","foaf:name":[{"@value":"Thomas Reps"}]},{"@id":"https://cir.nii.ac.jp/crid/1382825896256190594","@type":"Researcher","foaf:name":[{"@value":"Reinhard Wilhelm"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"01640925"},{"@type":"EISSN","@value":"15584593"}],"prism:publicationName":[{"@value":"ACM Transactions on Programming Languages and Systems"}],"dc:publisher":[{"@value":"Association for Computing Machinery (ACM)"}],"prism:publicationDate":"2002-05","prism:volume":"24","prism:number":"3","prism:startingPage":"217","prism:endingPage":"298"},"reviewed":"false","dc:rights":["https://www.acm.org/publications/policies/copyright_policy#Background"],"url":[{"@id":"https://dl.acm.org/doi/10.1145/514188.514190"},{"@id":"https://dl.acm.org/doi/pdf/10.1145/514188.514190"}],"createdAt":"2002-10-07","modifiedAt":"2025-06-18","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360848661210782848","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Model checking copy phases of concurrent copying garbage collection with various memory models"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204377974272","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Pre- and Post-Conditions Expressed in Variants of the Modal .MU.-Calculus"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1145/514188.514190"},{"@type":"CROSSREF","@value":"10.1587/transinf.e92.d.995_references_DOI_L0LaeIQqhIl0ZzfZpyl244R2SDZ"},{"@type":"CROSSREF","@value":"10.1145/3133877_references_DOI_L0LaeIQqhIl0ZzfZpyl244R2SDZ"}]}