2009 |
18 | EE | Martin T. Vechev,
Eran Yahav,
Greta Yorsh:
Inferring Synchronization under Limited Observability.
TACAS 2009: 139-154 |
17 | EE | 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
CoRR abs/0904.4902: (2009) |
2008 |
16 | EE | Greta Yorsh,
Eran Yahav,
Satish Chandra:
Generating precise and concise procedure summaries.
POPL 2008: 221-234 |
2007 |
15 | EE | Greta Yorsh,
Thomas W. Reps,
Mooly Sagiv,
Reinhard Wilhelm:
Logical characterizations of heap abstractions.
ACM Trans. Comput. Log. 8(1): (2007) |
14 | EE | 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) |
13 | EE | Greta Yorsh,
Alexander Moshe Rabinovich,
Mooly Sagiv,
Antoine Meyer,
Ahmed Bouajjani:
A logic of reachable patterns in linked data-structures.
J. Log. Algebr. Program. 73(1-2): 111-142 (2007) |
2006 |
12 | EE | Greta Yorsh,
Alexander Moshe Rabinovich,
Mooly Sagiv,
Antoine Meyer,
Ahmed Bouajjani:
A Logic of Reachable Patterns in Linked Data-Structures.
FoSSaCS 2006: 94-110 |
11 | EE | Greta Yorsh,
Thomas Ball,
Mooly Sagiv:
Testing, abstraction, theorem proving: better together!
ISSTA 2006: 145-156 |
2005 |
10 | EE | Greta Yorsh,
Madanlal Musuvathi:
A Combination Method for Generating Interpolants.
CADE 2005: 353-368 |
9 | EE | Tal Lev-Ami,
Neil Immerman,
Thomas W. Reps,
Shmuel Sagiv,
S. Srivastava,
Greta Yorsh:
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures.
CADE 2005: 99-115 |
8 | EE | Thomas Ball,
Orna Kupferman,
Greta Yorsh:
Abstraction for Falsification.
CAV 2005: 67-81 |
7 | EE | 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 |
6 | EE | Greta Yorsh,
Alexey Skidanov,
Thomas W. Reps,
Shmuel Sagiv:
Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work.
Electr. Notes Theor. Comput. Sci. 131: 125-138 (2005) |
2004 |
5 | EE | Neil Immerman,
Alexander Moshe Rabinovich,
Thomas W. Reps,
Shmuel Sagiv,
Greta Yorsh:
Verification via Structure Simulation.
CAV 2004: 281-294 |
4 | EE | 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 |
3 | EE | Greta Yorsh,
Thomas W. Reps,
Shmuel Sagiv:
Symbolically Computing Most-Precise Abstract Operations for Shape Analysis.
TACAS 2004: 530-545 |
2 | EE | Thomas W. Reps,
Shmuel Sagiv,
Greta Yorsh:
Symbolic Implementation of the Best Transformer.
VMCAI 2004: 252-266 |
2003 |
1 | EE | Greta Yorsh,
Thomas W. Reps,
Shmuel Sagiv,
Reinhard Wilhelm:
Logical Characterizations of Heap Abstractions
CoRR cs.LO/0312014: (2003) |