Finite-Tree Analysis for Constraint Logic-Based Languages: 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 15:5315:53, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,905 bytes +5‎ No edit summary undo
  • curprev 15:5315:53, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,900 bytes +1,900‎ Created page with "Title: Finite-Tree Analysis for Constraint Logic-Based Languages Research Question: How can we develop a data-flow analysis technique that accurately determines the finiteness of variables in logic-based programming languages that use rational trees? Methodology: The researchers proposed a new data-flow analysis technique based on abstract interpretation. They introduced a parametric domain with two components: a simple component for recording finite variables and a ge..."
Retrieved from "https://simplesci.org/wiki/Finite-Tree_Analysis_for_Constraint_Logic-Based_Languages"