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 |
||
| Line 1: | Line 1: | ||
Title: Logical Characterizations of Heap Abstractions | Title: Logical Characterizations of Heap Abstractions | ||
Research Question: How can we characterize the | Research Question: How can we characterize and express the 3-valued structures that arise in heap abstractions using logical formulas? | ||
Methodology: The researchers used 3-valued first-order logic to characterize the | Methodology: The researchers used 3-valued first-order logic with transitive closure to characterize the 3-valued structures that arise in heap abstractions. They also introduced a non-standard (super-valuation) semantics for 3-valued first-order logic, which is more precise than a conventional 3-valued semantics. | ||
Results: The researchers showed that | Results: The researchers showed that 3-valued structures can be characterized using formulas in first-order logic with transitive closure. They also demonstrated that their non-standard semantics can be effectively implemented using existing theorem provers. | ||
Implications: | Implications: These results provide insights into the expressiveness of 3-valued structures in heap abstractions and have broader applications to any abstraction where concrete states of a system are represented by finite 2-valued logical structures and abstraction is performed using the mechanisms described in Sections 2 and 3.1 of the paper. | ||
Link to Article: https://arxiv.org/abs/ | Link to Article: https://arxiv.org/abs/0312014v2 | ||
Authors: | Authors: | ||
arXiv ID: | arXiv ID: 0312014v2 | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
[[Category: | [[Category:3]] | ||
[[Category:Valued]] | [[Category:Valued]] | ||
[[Category:Structures]] | [[Category:Structures]] | ||
[[Category:Heap]] | [[Category:Heap]] | ||
[[Category:Abstractions]] | |||
Revision as of 15:01, 24 December 2023
Title: Logical Characterizations of Heap Abstractions
Research Question: How can we characterize and express the 3-valued structures that arise in heap abstractions using logical formulas?
Methodology: The researchers used 3-valued first-order logic with transitive closure to characterize the 3-valued structures that arise in heap abstractions. They also introduced a non-standard (super-valuation) semantics for 3-valued first-order logic, which is more precise than a conventional 3-valued semantics.
Results: The researchers showed that 3-valued structures can be characterized using formulas in first-order logic with transitive closure. They also demonstrated that their non-standard semantics can be effectively implemented using existing theorem provers.
Implications: These results provide insights into the expressiveness of 3-valued structures in heap abstractions and have broader applications to any abstraction where concrete states of a system are represented by finite 2-valued logical structures and abstraction is performed using the mechanisms described in Sections 2 and 3.1 of the paper.
Link to Article: https://arxiv.org/abs/0312014v2 Authors: arXiv ID: 0312014v2