Logical Characterizations of Heap Abstractions: Difference between revisions
Created page with "Title: Logical Characterizations of Heap Abstractions Research Question: How can we characterize the expressive power of 3-valued logical structures used in heap abstractions? Methodology: The researchers used 3-valued first-order logic to characterize the expressive power of the logical structures. They also introduced a non-standard (super-valuation) semantics for 3-valued first-order logic, which was more precise and could be effectively implemented using existing t..." |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
Title: Logical Characterizations of Heap Abstractions | Title: Logical Characterizations of Heap Abstractions | ||
Research Question: | Research Question: Can 3-valued logical structures, used in heap abstractions, be characterized using first-order logic with transitive closure? | ||
Methodology: The researchers used 3-valued | Methodology: The researchers used logical characterizations to examine the expressiveness of 3-valued structures in heap abstractions. They proposed a no-standard ("supervaluational") semantics for 3-valued first-order logic, which was more precise than a conventional 3-valued semantics. | ||
Results: The researchers | Results: The researchers were able to characterize 3-valued structures using formulas in first-order logic with transitive closure. They also demonstrated that the supervaluational semantics could be effectively implemented using existing theorem provers. | ||
Implications: This | Implications: This research has implications for the field of abstract interpretation, particularly in the areas of shape analysis and concurrency. The results provide a better understanding of the expressiveness of 3-valued structures and offer a more precise semantics for interpreting abstract values. This can lead to improved verification tools, program optimizers, and program-understanding tools. | ||
Link to Article: https://arxiv.org/abs/ | Link to Article: https://arxiv.org/abs/0312014v3 | ||
Authors: | Authors: | ||
arXiv ID: | arXiv ID: 0312014v3 | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
[[Category: | [[Category:3]] | ||
[[Category:Valued]] | [[Category:Valued]] | ||
[[Category:Structures]] | [[Category:Structures]] | ||
[[Category: | [[Category:Semantics]] | ||
[[Category:Logical]] | |||
Latest revision as of 15:01, 24 December 2023
Title: Logical Characterizations of Heap Abstractions
Research Question: Can 3-valued logical structures, used in heap abstractions, be characterized using first-order logic with transitive closure?
Methodology: The researchers used logical characterizations to examine the expressiveness of 3-valued structures in heap abstractions. They proposed a no-standard ("supervaluational") semantics for 3-valued first-order logic, which was more precise than a conventional 3-valued semantics.
Results: The researchers were able to characterize 3-valued structures using formulas in first-order logic with transitive closure. They also demonstrated that the supervaluational semantics could be effectively implemented using existing theorem provers.
Implications: This research has implications for the field of abstract interpretation, particularly in the areas of shape analysis and concurrency. The results provide a better understanding of the expressiveness of 3-valued structures and offer a more precise semantics for interpreting abstract values. This can lead to improved verification tools, program optimizers, and program-understanding tools.
Link to Article: https://arxiv.org/abs/0312014v3 Authors: arXiv ID: 0312014v3