Author of the publication

Precise Interprocedural Dataflow Analysis via Graph Reachability

, , and . Proceedings of the 22Nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, page 49--61. New York, NY, USA, ACM, (1995)
DOI: 10.1145/199448.199462

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.

No persons found for author name Sagiv, Mooly
add a person with the name Sagiv, Mooly
 

Other publications of authors with the same name

Checking Cleanness in Linked Lists, , and . Static Analysis Symposium, page 115--134. (2000)Introduction to special ESOP'05 issue.. ACM Trans. Program. Lang. Syst., 29 (5): 23 (2007)Constructing Specialized Shape Analyses for Uniform Change., , , and . VMCAI, volume 4349 of Lecture Notes in Computer Science, page 215-233. Springer, (2007)Eventually Consistent Transactions., , , and . ESOP, volume 7211 of Lecture Notes in Computer Science, page 67-86. Springer, (2012)Effectively-Propositional Reasoning about Reachability in Linked Data Structures., , , , and . CAV, volume 8044 of Lecture Notes in Computer Science, page 756-772. Springer, (2013)Automatic scalable atomicity via semantic locking., , , and . PPoPP, page 31-41. ACM, (2015)Bounded Quantifier Instantiation for Checking Inductive Invariants., , , , and . TACAS (1), volume 10205 of Lecture Notes in Computer Science, page 76-95. (2017)Core-Guided Minimal Correction Set and Core Enumeration., , , and . IJCAI, page 1353-1361. ijcai.org, (2018)Phoenix: A Formally Verified Regenerating Vault., , , , , and . CoRR, (2021)Automatic Scalable Atomicity via Semantic Locking., , , and . ACM Trans. Parallel Comput., 3 (4): 21:1-21:29 (2017)