( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finite differencing of logical formulas for static analysis.

, , и . ACM Trans. Program. Lang. Syst., 32 (6): 24:1-24:55 (2010)

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.

Maxim Loginov

Alexey Dashevsky

Alexey Mikaberidze

Alexey Shaytan

Alexey Lomonosov

 

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

Refinement-Based Verification for Possibly-Cyclic Lists., , и . Program Analysis and Compilation, том 4444 из Lecture Notes in Computer Science, стр. 247-272. Springer, (2006)Verifying dereference safety via expanding-scope analysis., , , , , и . ISSTA, стр. 213-224. ACM, (2008)A relational approach to interprocedural shape analysis., , , и . ACM Trans. Program. Lang. Syst., 32 (2): 5:1-5:52 (2010)Data-Delineation in Software Binaries and its Application to Buffer-Overrun Discovery., , , , , и . ICSE (1), стр. 145-155. IEEE Computer Society, (2015)Abstraction Refinement via Inductive Learning., , и . CAV, том 3576 из Lecture Notes in Computer Science, стр. 519-533. Springer, (2005)Efficient and Precise Datarace Detection for Multithreaded Object-Oriented Programs., , , , , и . PLDI, стр. 258-269. ACM, (2002)Polymorphic type inference for machine code., , и . PLDI, стр. 27-41. ACM, (2016)Finite differencing of logical formulas for static analysis., , и . ACM Trans. Program. Lang. Syst., 32 (6): 24:1-24:55 (2010)Debugging via Run-Time Type Checking., , , и . FASE, том 2029 из Lecture Notes in Computer Science, стр. 217-232. Springer, (2001)Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm., , и . SAS, том 4134 из Lecture Notes in Computer Science, стр. 261-279. Springer, (2006)