( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
AutoQ: An Automata-Based Quantum Circuit Verifier.

, , , , и . CAV (3), том 13966 из Lecture Notes in Computer Science, стр. 139-153. Springer, (2023)

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.

Fang Yu

Fang Chen

Fang Yu

Fang Chen

Yu Chen

 

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

A decision procedure for string constraints with string/integer conversion and flat regular constraints., , , , и . Acta Informatica, 61 (1): 23-52 (марта 2024)Word Equations in Synergy with Regular Constraints., , , , , , и . FM, том 14000 из Lecture Notes in Computer Science, стр. 403-423. Springer, (2023)Solving Not-Substring Constraint withFlat Abstraction., , , , , , , , и . APLAS, том 13008 из Lecture Notes in Computer Science, стр. 305-320. Springer, (2021)Synthesize Models for Quantitative Analysis Using Automata Learning., , , , , и . NETYS, том 11704 из Lecture Notes in Computer Science, стр. 75-92. Springer, (2019)GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic., , , , и . TACAS, том 4963 из Lecture Notes in Computer Science, стр. 346-350. Springer, (2008)Trau: SMT solver for string constraints., , , , , , и . FMCAD, стр. 1-5. IEEE, (2018)Efficient handling of string-number conversion., , , , , , , , и . PLDI, стр. 943-957. ACM, (2020)A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving., , , и . APLAS, том 12470 из Lecture Notes in Computer Science, стр. 343-363. Springer, (2020)Learning Minimal Separating DFA's for Compositional Verification., , , , и . TACAS, том 5505 из Lecture Notes in Computer Science, стр. 31-45. Springer, (2009)Register automata with linear arithmetic., , , и . LICS, стр. 1-12. IEEE Computer Society, (2017)