( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Some Complexity Results for Stateful Network Verification.

, , , , , , и . TACAS, том 9636 из Lecture Notes in Computer Science, стр. 811-830. Springer, (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.

Ithamar Sharon

Sharon Waichman

Sharon Aviran

Sharon Ratke

Sharon Moyse

 

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

RATCOP: Relational Analysis Tool for Concurrent Programs., , , , и . Haifa Verification Conference, том 10629 из Lecture Notes in Computer Science, стр. 229-233. Springer, (2017)Symbolic Automata for Static Specification Mining., , , и . SAS, том 7935 из Lecture Notes in Computer Science, стр. 63-83. Springer, (2013)Compositional Verification and 3-Valued Abstractions Join Forces., и . SAS, том 4634 из Lecture Notes in Computer Science, стр. 69-86. Springer, (2007)A Framework for Compositional Verification of Multi-valued Systems via Abstraction-Refinement., , и . ATVA, том 5799 из Lecture Notes in Computer Science, стр. 271-288. Springer, (2009)Multi-valued model checking games., и . J. Comput. Syst. Sci., 78 (2): 414-429 (2012)Complexity and information in invariant inference., , , и . Proc. ACM Program. Lang., 4 (POPL): 5:1-5:29 (2020)Modularity for decidability of deductive verification with applications to distributed systems., , , , , , , и . PLDI, стр. 662-677. ACM, (2018)Inferring Inductive Invariants from Phase Structures., , , и . CAV (2), том 11562 из Lecture Notes in Computer Science, стр. 405-425. Springer, (2019)Logical Characterization of Coherent Uninterpreted Programs., , и . FMCAD, стр. 77-85. IEEE, (2021)Lazy abstraction and SAT-based reachability in hardware model checking., , и . FMCAD, стр. 173-181. IEEE, (2012)