From post

Automatic Constrained Rewriting Induction towards Verifying Procedural Programs.

, и . APLAS, том 8858 из Lecture Notes in Computer Science, стр. 334-353. Springer, (2014)

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.

 

Другие публикации лиц с тем же именем

Confluence Competition 2018., , , , , , , и . FSCD, том 108 из LIPIcs, стр. 32:1-32:5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Conversion to tail recursion in term rewriting., и . J. Log. Algebraic Methods Program., 83 (1): 53-63 (2014)Determinization of inverted grammar programs via context-free expressions., и . J. Log. Algebraic Methods Program., (2021)Constrained Term Rewriting tooL., и . LPAR, том 9450 из Lecture Notes in Computer Science, стр. 549-557. Springer, (2015)Inverse Unfold Problem and Its Heuristic Solving., , , и . WPTE@RTA/TLCA, том 40 из OASIcs, стр. 27-38. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)A Reversible Semantics for Erlang., , и . LOPSTR, том 10184 из Lecture Notes in Computer Science, стр. 259-274. Springer, (2016)On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs., , и . WFLP, том 6816 из Lecture Notes in Computer Science, стр. 138-155. Springer, (2011)Loop Detection by Logically Constrained Term Rewriting., и . VSTTE, том 11294 из Lecture Notes in Computer Science, стр. 309-321. Springer, (2018)Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity., , и . RTA, том 10 из LIPIcs, стр. 267-282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems., , , , и . Inf. Media Technol., 6 (4): 1185-1208 (2011)