Travelled to:1 × Austria
1 × Canada
1 × Estonia
1 × Poland
2 × Spain
2 × United Kingdom
4 × USA
Collaborated with:E.Yahav M.T.Vechev T.W.Reps S.Sagiv M.Sagiv T.Ball A.M.Rabinovich N.Immerman M.Musuvathi Abhinav Jangda S.Chandra O.Kupferman A.Raman O.Tripp J.Field A.Meyer A.Bouajjani T.Lev-Ami S.Srivastava
Talks about:abstract (4) structur (3) logic (3) data (3) synchron (2) reachabl (2) parallel (2) generat (2) symbol (2) precis (2)
Person: Greta Yorsh
DBLP: Yorsh:Greta
Contributed to:
2011
2010
2010
20092008
2006
2006
2005
20052004
20042004
2004
2017Wrote 16 papers:
- OOPSLA-2011-RamanYVY #named
- Sprint: speculative prefetching of remote data (AR, GY, MTV, EY), pp. 259–274.
- OOPSLA-2011-TrippYFS #data flow #effectiveness #named #parallel
- HAWKEYE: effective discovery of dataflow impediments to parallelization (OT, GY, JF, MS), pp. 207–224.
- ISMM-2010-VechevYY #named #parallel
- PHALANX: parallel checking of expressive heap assertions (MTV, EY, GY), pp. 41–50.
- POPL-2010-VechevYY #synthesis
- Abstraction-guided synthesis of synchronization (MTV, EY, GY), pp. 327–338.
- TACAS-2009-VechevYY
- Inferring Synchronization under Limited Observability (MTV, EY, GY), pp. 139–154.
- POPL-2008-YorshYC #generative #precise #summary
- Generating precise and concise procedure summaries (GY, EY, SC), pp. 221–234.
- FoSSaCS-2006-YorshRSMB #linked data #logic #open data
- A Logic of Reachable Patterns in Linked Data-Structures (GY, AMR, MS, AM, AB), pp. 94–110.
- ISSTA-2006-YorshBS #abstraction #exclamation #proving #testing #theorem proving
- Testing, abstraction, theorem proving: better together! (GY, TB, MS), pp. 145–156.
- CADE-2005-Lev-AmiIRSSY #data type #first-order #linked data #logic #open data #reachability #simulation #using #verification
- Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures (TLA, NI, TWR, SS, SS, GY), pp. 99–115.
- CADE-2005-YorshM #generative
- A Combination Method for Generating Interpolants (GY, MM), pp. 353–368.
- CAV-2005-BallKY #abstraction
- Abstraction for Falsification (TB, OK, GY), pp. 67–81.
- CAV-2004-ImmermanRRSY #simulation #verification
- Verification via Structure Simulation (NI, AMR, TWR, SS, GY), pp. 281–294.
- CSL-2004-ImmermanRRSY #bound #decidability #logic #transitive
- The Boundary Between Decidability and Undecidability for Transitive-Closure Logics (NI, AMR, TWR, SS, GY), pp. 160–174.
- TACAS-2004-YorshRS #analysis
- Symbolically Computing Most-Precise Abstract Operations for Shape Analysis (GY, TWR, SS), pp. 530–545.
- VMCAI-2004-RepsSY #implementation
- Symbolic Implementation of the Best Transformer (TWR, SS, GY), pp. 252–266.
- Onward-2017-JangdaY #bound
- Unbounded superoptimization (AJ, GY), pp. 78–88.