Author of the publication

From Eventual to Atomic Locally Atomic CC Programs: A Concurrent Semantics.

, , , and . ALP, volume 850 of Lecture Notes in Computer Science, page 114-132. Springer, (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Towards an Abstract Domain for Resource Analysis of Logic Programs Using Sized Types., , and . CoRR, (2013)Precise Set Sharing Analysis for Java-Style Programs., and . VMCAI, volume 4905 of Lecture Notes in Computer Science, page 172-187. Springer, (2008)Abstract Interpretation with Specialized Definitions., , and . SAS, volume 4134 of Lecture Notes in Computer Science, page 107-126. Springer, (2006)Global Analysis of Standard Prolog Programs., , , and . ESOP, volume 1058 of Lecture Notes in Computer Science, page 108-124. Springer, (1996)Abstract Interpretation-Based Mobile Code Certification., , and . ICLP, volume 3132 of Lecture Notes in Computer Science, page 446-447. Springer, (2004)Efficient Top-Down Set-Sharing Analysis Using Cliques., , and . PADL, volume 3819 of Lecture Notes in Computer Science, page 183-198. Springer, (2006)On the Role of Semantic Approximations on Validation and Diagnosis of Contraint Logic Programs., , , , , , and . AADEBUG, volume 2 of Linköping Electronic Articles in Computer and Information Science, page 155-169. Linköping University Electronic Press, (1997)An Improved Continuation Call-Based Implementation of Tabling., , , , and . PADL, volume 4902 of Lecture Notes in Computer Science, page 197-213. Springer, (2008)Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs., , and . LOPSTR, volume 4915 of Lecture Notes in Computer Science, page 138-153. Springer, (2007)Efficient local unfolding with ancestor stacks., , and . Theory Pract. Log. Program., 11 (1): 1-32 (2011)