Author of the publication

Constructing Semantic Models of Programs with the Software Analysis Workbench.

, , , , , and . VSTTE, volume 9971 of Lecture Notes in Computer Science, page 56-72. (2016)

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

SAW: the software analysis workbench., , , , and . HILT, page 15-18. ACM, (2013)Constructing Semantic Models of Programs with the Software Analysis Workbench., , , , , and . VSTTE, volume 9971 of Lecture Notes in Computer Science, page 56-72. (2016)Dependently typed Haskell in industry (experience report)., , , , and . Proc. ACM Program. Lang., 3 (ICFP): 100:1-100:16 (2019)A Sufficient Completeness Reasoning Tool for Partial Specifications., , and . RTA, volume 3467 of Lecture Notes in Computer Science, page 165-174. Springer, (2005)The Maude Formal Tool Environment., , , , , and . CALCO, volume 4624 of Lecture Notes in Computer Science, page 173-178. Springer, (2007)Propositional Tree Automata., , and . RTA, volume 4098 of Lecture Notes in Computer Science, page 50-65. Springer, (2006)Coverset Induction with Partiality and Subsorts: A Powerlist Case Study., , and . ITP, volume 6172 of Lecture Notes in Computer Science, page 275-290. Springer, (2010)On the Completeness of Context-Sensitive Order-Sorted Specifications., and . RTA, volume 4533 of Lecture Notes in Computer Science, page 229-245. Springer, (2007)Combining Equational Tree Automata over AC and ACI Theories., and . RTA, volume 5117 of Lecture Notes in Computer Science, page 142-156. Springer, (2008)A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms., , and . IJCAR, volume 4130 of Lecture Notes in Computer Science, page 151-155. Springer, (2006)