( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Generating finite state machines from abstract state machines.

, , , и . ISSTA, стр. 112-122. ACM, (2002)

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.

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

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

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