Selected Scientific Publications

Export 8 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is sharing analysis  [Clear All Filters]
2002
Zaffanella E, Hill PM, Bagnara R.  2002.  Decomposing Non-Redundant Sharing by Complementation. Theory and Practice of Logic Programming. 2:233–261.PDF icon ZaffanellaHB02TPLP.pdf (237.44 KB)
Bagnara R, Hill PM, Zaffanella E.  2002.  Set-Sharing is Redundant for Pair-Sharing. Theoretical Computer Science. 277:3–46.PDF icon BagnaraHZ02TCS.pdf (413.66 KB)
Hill PM, Bagnara R, Zaffanella E.  2002.  Soundness, Idempotence and Commutativity of Set-Sharing. Theory and Practice of Logic Programming. 2:155–201.PDF icon HillBZ02TPLP.pdf (406.08 KB)
1999
King A, Smaus J-G, Hill PM.  1999.  Quotienting Share for Dependency Analysis. Proceedings of the European Symposium on Programming. 1576:59–73.
Zaffanella E, Bagnara R, Hill PM.  1999.  Widening Sharing. Principles and Practice of Declarative Programming. 1702:414–431.
1998
Hill PM, Bagnara R, Zaffanella E.  1998.  The Correctness of Set-Sharing. Static Analysis: Proceedings of the 5th International Symposium. 1503:99–114.
1997
Bagnara R, Hill PM, Zaffanella E.  1997.  Set-Sharing is Redundant for Pair-Sharing. Static Analysis: Proceedings of the 4th International Symposium. 1302:53–67.