Author of the publication

Certification of Compiler Optimizations Using Kleene Algebra with Tests

, and . Computational Logic — CL 2000, Springer Berlin Heidelberg, (2000)
DOI: 10.1007/3-540-44957-4_38

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

Automata and planar graphs.. FCT, page 243-254. Akademie-Verlag, Berlin, (1979)Automating Proofs in Category Theory., , and . IJCAR, volume 4130 of Lecture Notes in Computer Science, page 392-407. Springer, (2006)The Ackermann Award 2015., , and . CSL, volume 41 of LIPIcs, page xv-xviii. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Theory of Computation.. Texts in Computer Science Springer, (2006)Complexity of Boolean Algebras.. Theor. Comput. Sci., (1980)The Complexity of Elementary Algebra and Geometry (Preliminary Abstract), , and . STOC, page 457-464. ACM, (1984)A note on the complexity of propositional Hoare logic., and . ACM Trans. Comput. Log., 1 (1): 171-174 (2000)Scalable verification of probabilistic networks., , , , , , and . PLDI, page 190-203. ACM, (2019)The Complexity of Set Constraints., , , and . CSL, volume 832 of Lecture Notes in Computer Science, page 1-17. Springer, (1993)Coinductive Proof Principles for Stochastic Process. Proceedings of LICS 2006, (2006)