Author of the publication

Expressiveness of the Operation Set of a Data Abstraction.

, and . POPL, page 139-153. ACM Press, (1980)

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

Automatic Generation of Polynomial Loop Invariants: Algebraic Foundations, and . Proc. Intl. Symp on Symbolic and Algebraic Computation (ISSAC-2004), Spain, (2004)Modeling generic polyhedral objects with constraints., , and . CVPR, page 479-485. IEEE, (1991)Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm.. J. Systems Science & Complexity, 30 (1): 196-233 (2017)On the relationship between the Dixon-based resultant construction and the supports of polynomial systems., and . SIGSAM Bull., 37 (3): 66-67 (2003)A Transformational Methodology for Proving Termination of Logic Programs., , and . CSL, volume 626 of Lecture Notes in Computer Science, page 213-226. Springer, (1991)Announcement.. J. Autom. Reason., 31 (2): 105-105 (2003)Preface., and . J. Autom. Reason., 34 (4): 323 (2005)Sufficient-Completeness, Ground-Reducibility and their Complexity., , , and . Acta Informatica, 28 (4): 311-350 (1991)Semi-Unification., , , and . Theor. Comput. Sci., 81 (2): 169-187 (1991)When Is a Formula a Loop Invariant?, and . Logic, Rewriting, and Concurrency, volume 9200 of Lecture Notes in Computer Science, page 264-286. Springer, (2015)