Greta Yorsh

Publication Activity (10 Years)

Years Active: 2003-2017
Publications (10 Years): 1

Top Topics

Texture Synthesis

Top Venues

Int. J. Softw. Tools Technol. Transf.

Publications

Abhinav Jangda, Greta Yorsh
Unbounded superoptimization. Onward! (2017)
Martin T. Vechev, Eran Yahav, Greta Yorsh
Abstraction-guided synthesis of synchronization. Int. J. Softw. Tools Technol. Transf. 15 (5-6) (2013)
Omer Tripp, Greta Yorsh, John Field, Mooly Sagiv
HAWKEYE: effective discovery of dataflow impediments to parallelization. OOPSLA (2011)
Arun Raman, Greta Yorsh, Martin T. Vechev, Eran Yahav
Sprint: speculative prefetching of remote data. OOPSLA (2011)
Martin T. Vechev, Eran Yahav, Greta Yorsh
PHALANX: parallel checking of expressive heap assertions. ISMM (2010)
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev, Eran Yahav, Greta Yorsh
Verifying linearizability with hindsight. PODC (2010)
Martin T. Vechev, Eran Yahav, Greta Yorsh
Abstraction-guided synthesis of synchronization. POPL (2010)
Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh
Simulating reachability using first-order logic with applications to verification of linked data structures Log. Methods Comput. Sci. 5 (2) (2009)
Martin T. Vechev, Eran Yahav, Greta Yorsh
Experience with Model Checking Linearizability. SPIN (2009)
Martin T. Vechev, Eran Yahav, Greta Yorsh
Inferring Synchronization under Limited Observability. TACAS (2009)
Greta Yorsh, Eran Yahav, Satish Chandra
Generating precise and concise procedure summaries. POPL (2008)
Greta Yorsh, Thomas W. Reps, Mooly Sagiv, Reinhard Wilhelm
Logical characterizations of heap abstractions. ACM Trans. Comput. Log. 8 (1) (2007)
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
A logic of reachable patterns in linked data-structures. J. Log. Algebraic Methods Program. 73 (1-2) (2007)
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
A Logic of Reachable Patterns in Linked Data-Structures CoRR (2007)
Greta Yorsh, Thomas Ball, Mooly Sagiv
Testing, abstraction, theorem proving: better together! ISSTA (2006)
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
A Logic of Reachable Patterns in Linked Data-Structures. FoSSaCS (2006)
Thomas Ball, Orna Kupferman, Greta Yorsh
Abstraction for Falsification. CAV (2005)
Greta Yorsh, Madanlal Musuvathi
A Combination Method for Generating Interpolants. CADE (2005)
Greta Yorsh, Alexey Skidanov, Thomas W. Reps, Shmuel Sagiv
Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work. Electron. Notes Theor. Comput. Sci. 131 (2005)
Nurit Dor, John Field, Denis Gopan, Tal Lev-Ami, Alexey Loginov, Roman Manevich, G. Ramalingam, Thomas W. Reps, Noam Rinetzky, Mooly Sagiv, Reinhard Wilhelm, Eran Yahav, Greta Yorsh
Automatic Verification of Strongly Dynamic Software Systems. VSTTE (2005)
Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, Siddharth Srivastava, Greta Yorsh
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures. CADE (2005)
Greta Yorsh, Thomas W. Reps, Shmuel Sagiv
Symbolically Computing Most-Precise Abstract Operations for Shape Analysis. TACAS (2004)
Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
Symbolic Implementation of the Best Transformer. VMCAI (2004)
Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. CSL (2004)
Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
Verification via Structure Simulation. CAV (2004)
Greta Yorsh, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm
Logical Characterizations of Heap Abstractions CoRR (2003)