Author of the publication

Finite differencing of logical formulas for static analysis.

, , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Refinement-Based Verification for Possibly-Cyclic Lists., , and . Program Analysis and Compilation, volume 4444 of Lecture Notes in Computer Science, page 247-272. Springer, (2006)Verifying dereference safety via expanding-scope analysis., , , , , and . ISSTA, page 213-224. ACM, (2008)A relational approach to interprocedural shape analysis., , , and . ACM Trans. Program. Lang. Syst., 32 (2): 5:1-5:52 (2010)Data-Delineation in Software Binaries and its Application to Buffer-Overrun Discovery., , , , , and . ICSE (1), page 145-155. IEEE Computer Society, (2015)Abstraction Refinement via Inductive Learning., , and . CAV, volume 3576 of Lecture Notes in Computer Science, page 519-533. Springer, (2005)Efficient and Precise Datarace Detection for Multithreaded Object-Oriented Programs., , , , , and . PLDI, page 258-269. ACM, (2002)Polymorphic type inference for machine code., , and . PLDI, page 27-41. ACM, (2016)Finite differencing of logical formulas for static analysis., , and . ACM Trans. Program. Lang. Syst., 32 (6): 24:1-24:55 (2010)Debugging via Run-Time Type Checking., , , and . FASE, volume 2029 of Lecture Notes in Computer Science, page 217-232. Springer, (2001)Finite Differencing of Logical Formulas for Static Analysis., , and . ESOP, volume 2618 of Lecture Notes in Computer Science, page 380-398. Springer, (2003)