Greta Yorsh

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