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

Phoenix: A Formally Verified Regenerating Vault., , , , , and . CoRR, (2021)Effectively-Propositional Reasoning about Reachability in Linked Data Structures., , , , and . CAV, volume 8044 of Lecture Notes in Computer Science, page 756-772. Springer, (2013)Understanding the behavior of database operations under program control., , , and . OOPSLA, page 983-996. ACM, (2012)A simple inductive synthesis methodology and its applications., , , and . OOPSLA, page 36-46. ACM, (2010)Automatic scalable atomicity via semantic locking., , , and . PPoPP, page 31-41. ACM, (2015)Automatic Scalable Atomicity via Semantic Locking., , , and . ACM Trans. Parallel Comput., 3 (4): 21:1-21:29 (2017)Core-Guided Minimal Correction Set and Core Enumeration., , , and . IJCAI, page 1353-1361. ijcai.org, (2018)Bounded Quantifier Instantiation for Checking Inductive Invariants., , , , and . TACAS (1), volume 10205 of Lecture Notes in Computer Science, page 76-95. (2017)Concurrent data representation synthesis., , , , and . PLDI, page 417-428. ACM, (2012)Checking Cleanness in Linked Lists, , and . Static Analysis Symposium, page 115--134. (2000)