From post

Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures.

, , , , , и . CADE, том 3632 из Lecture Notes in Computer Science, стр. 99-115. Springer, (2005)

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.

 

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

Model-assisted machine-code synthesis., , и . Proc. ACM Program. Lang., 1 (OOPSLA): 61:1-61:26 (2017)Tuning Models of Code with Compiler-Generated Reinforcement Learning Feedback., , , , и . CoRR, (2023)The Synthesizer Generator., и . Software Development Environments (SDE), стр. 42-48. ACM, (1984)SIGPLAN Notices 19 (5), May 1984.A program integration algorithm that accommodates semantics-preserving transformations., , и . SDE, стр. 133-143. ACM, (1990)Revamping TVLA: Making Parametric Shape Analysis Competitive., , , и . CAV, том 4590 из Lecture Notes in Computer Science, стр. 221-225. Springer, (2007)Synthesis with Asymptotic Resource Bounds., , , и . CAV (1), том 12759 из Lecture Notes in Computer Science, стр. 783-807. Springer, (2021)Programmable Program Synthesis., , , и . CAV (1), том 12759 из Lecture Notes in Computer Science, стр. 84-109. Springer, (2021)Component-based synthesis for complex APIs., , , , и . POPL, стр. 599-612. ACM, (2017)Speeding up Slicing., , , и . SIGSOFT FSE, стр. 11-20. ACM, (1994)Automatic discovery of API-level exploits., , , , и . ICSE, стр. 312-321. ACM, (2005)