Decomposing Non-Redundant Sharing: 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 01:5701:57, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,985 bytes +1,985‎ Created page with "Title: Decomposing Non-Redundant Sharing Research Question: How can we decompose the sharing domain more effectively to better understand and verify program behavior? Methodology: The authors proposed a new method for decomposing the sharing domain (SH) into three subdomains: ground-dependency, variable independence, and set-sharing information. They used complementation, an inverse of the reduced product operation, to systematically find minimal decompositions of abst..."
Retrieved from "https://simplesci.org/wiki/Decomposing_Non-Redundant_Sharing"