default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGreta Yorsh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c20]Abhinav Jangda, Greta Yorsh:
Unbounded superoptimization. Onward! 2017: 78-88- 2013
- [j4]Martin T. Vechev, Eran Yahav, Greta Yorsh:
Abstraction-guided synthesis of synchronization. Int. J. Softw. Tools Technol. Transf. 15(5-6): 413-431 (2013) - 2011
- [c19]Omer Tripp, Greta Yorsh, John Field, Mooly Sagiv:
HAWKEYE: effective discovery of dataflow impediments to parallelization. OOPSLA 2011: 207-224 - [c18]Arun Raman, Greta Yorsh, Martin T. Vechev, Eran Yahav:
Sprint: speculative prefetching of remote data. OOPSLA 2011: 259-274 - 2010
- [c17]Martin T. Vechev, Eran Yahav, Greta Yorsh:
PHALANX: parallel checking of expressive heap assertions. ISMM 2010: 41-50 - [c16]Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev, Eran Yahav, Greta Yorsh:
Verifying linearizability with hindsight. PODC 2010: 85-94 - [c15]Martin T. Vechev, Eran Yahav, Greta Yorsh:
Abstraction-guided synthesis of synchronization. POPL 2010: 327-338
2000 – 2009
- 2009
- [j3]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) - [c14]Martin T. Vechev, Eran Yahav, Greta Yorsh:
Experience with Model Checking Linearizability. SPIN 2009: 261-278 - [c13]Martin T. Vechev, Eran Yahav, Greta Yorsh:
Inferring Synchronization under Limited Observability. TACAS 2009: 139-154 - 2008
- [c12]Greta Yorsh, Eran Yahav, Satish Chandra:
Generating precise and concise procedure summaries. POPL 2008: 221-234 - 2007
- [b1]Greta Yorsh:
Employing decision procedures for verification of heap-manipulating programs. Tel Aviv University, Israel, 2007 - [j2]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): 111-142 (2007) - [j1]Greta Yorsh, Thomas W. Reps, Mooly Sagiv, Reinhard Wilhelm:
Logical characterizations of heap abstractions. ACM Trans. Comput. Log. 8(1): 5 (2007) - [i2]Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani:
A Logic of Reachable Patterns in Linked Data-Structures. CoRR abs/0705.3610 (2007) - 2006
- [c11]Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani:
A Logic of Reachable Patterns in Linked Data-Structures. FoSSaCS 2006: 94-110 - [c10]Greta Yorsh, Thomas Ball, Mooly Sagiv:
Testing, abstraction, theorem proving: better together! ISSTA 2006: 145-156 - 2005
- [c9]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: 99-115 - [c8]Greta Yorsh, Madanlal Musuvathi:
A Combination Method for Generating Interpolants. CADE 2005: 353-368 - [c7]Thomas Ball, Orna Kupferman, Greta Yorsh:
Abstraction for Falsification. CAV 2005: 67-81 - [c6]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: 82-92 - [c5]Greta Yorsh, Alexey Skidanov, Thomas W. Reps, Shmuel Sagiv:
Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work. AIOOL@VMCAI 2005: 125-138 - 2004
- [c4]Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh:
Verification via Structure Simulation. CAV 2004: 281-294 - [c3]Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh:
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. CSL 2004: 160-174 - [c2]Greta Yorsh, Thomas W. Reps, Shmuel Sagiv:
Symbolically Computing Most-Precise Abstract Operations for Shape Analysis. TACAS 2004: 530-545 - [c1]Thomas W. Reps, Shmuel Sagiv, Greta Yorsh:
Symbolic Implementation of the Best Transformer. VMCAI 2004: 252-266 - 2003
- [i1]Greta Yorsh, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm:
Logical Characterizations of Heap Abstractions. CoRR cs.LO/0312014 (2003)
Coauthor Index
aka: Mooly Sagiv
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-10 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
