( en | de | ru )

 

Disambiguation of "Veanes, Margus"

Author of the publication

copydeleteadd this publication to your clipboard
Fusing effectful comprehensions.

, , , and . PLDI, page 17-32. ACM, (2017)

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.

No persons found for author name Veanes, Margus
add a person with the name Veanes, Margus
 

Other publications of authors with the same name

Farmer's Theorem revisited.. Inf. Process. Lett., 74 (1-2): 47-53 (2000)On Bounded Reachability of Programs with Set Comprehensions., and . LPAR, volume 5330 of Lecture Notes in Computer Science, page 305-317. Springer, (2008)Natural Cycletrees: Flexible Interconnection Graphs., and . J. Parallel Distributed Comput., 33 (1): 44-54 (1996)On the Undecidability of Second-Order Unification., and . Inf. Comput., 159 (1-2): 125-150 (2000)Generating finite state machines from abstract state machines, , , and . ISSTA '02: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis, page 112--122. New York, NY, USA, ACM Press, (2002)Translating C# to Branching Symbolic Transducers., and . LPAR (Short Presentations), volume 1 of Kalpa Publications in Computing, page 86-99. EasyChair, (2017)Equivalence of Extended Symbolic Finite Transducers., and . CAV, volume 8044 of Lecture Notes in Computer Science, page 624-639. Springer, (2013)Monadic second-order logic on finite sequences., and . POPL, page 232-245. ACM, (2017)Symbolic Boolean derivatives for efficiently solving extended regular expression constraints., , and . PLDI, page 620-635. ACM, (2021)Symbolic Tree Transducers., and . Ershov Memorial Conference, volume 7162 of Lecture Notes in Computer Science, page 377-393. Springer, (2011)