Condensing Abstract Domains for Logic Program Analysis: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 04:2704:27, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,462 bytes +2,462‎ Created page with "Title: Condensing Abstract Domains for Logic Program Analysis Abstract: This research article explores the concept of condensing abstract domains in the context of logic program analysis. The main idea is to create abstract domains that can accurately represent the semantics of logic languages without losing precision, even when the analysis is goal-independent. This is achieved by systematically refining abstract domains to make them condensing, which means that goal-d..."
Retrieved from "https://simplesci.org/wiki/Condensing_Abstract_Domains_for_Logic_Program_Analysis"