Menu
 
Research menu
Jump to menu

Publications:  Dr Greta Yorsh

Jangda A, YORSH G (2017). Unbounded Superoptimization. Conference: Onward! 2017 Proceedings of the 2017 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software
10.1145/3133850.3133856
https://qmro.qmul.ac.uk/xmlui/handle/123456789/29154
Vechev MT, Yahav E, Yorsh G(2013). Abstraction-guided synthesis of synchronization. STTT vol. 15, Article 5-6, 413-431.
10.1007/s10009-012-0232-3
Tripp O, Yorsh G, Field J, Sagiv M(2011). HAWKEYE: Effective Discovery of Dataflow Impediments to Parallelization. ACM SIGPLAN NOTICES vol. 46, (10) 207-223.
10.1145/2076021.2048085
Raman A, Yorsh G, Vechev M, Yahav E(2011). Sprint: Speculative Prefetching of Remote Data. ACM SIGPLAN NOTICES vol. 46, (10) 259-273.
10.1145/2076021.2048088
Tripp O, Yorsh G, Field J, Sagiv M (2011). HAWKEYE: effective discovery of dataflow impediments to parallelization. OOPSLA. Editors: Lopes, CV, Fisher, K, 207-224.
10.1145/2048066.2048085
Raman A, Yorsh G, Vechev MT, Yahav E (2011). Sprint: speculative prefetching of remote data. OOPSLA. Editors: Lopes, CV, Fisher, K, 259-274.
Vechev M, Yahav E, Yorsh G (2010). Abstraction-Guided Synthesis of Synchronization. ACM SIGPLAN NOTICES. vol. 45, 327-338.
10.1145/1707801.1706338
Vechev MT, Yahav E, Yorsh G (2010). Abstraction-guided synthesis of synchronization. Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. Editors: Hermenegildo, MV, Palsberg, J, Conference: Principles of Programming Languages The 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Madrid, Spain) from: 17/01/2010 to: 23/01/2010, 327-338.
10.1145/1706299.1706338
Vechev MT, Yahav E, Yorsh G (2010). PHALANX: parallel checking of expressive heap assertions. ISMM. Editors: Vitek, J, Lea, D, 41-50.
O'Hearn PW, Rinetzky N, Vechev MT, Yahav E, Yorsh G (2010). Verifying Linearizability with Hindsight. PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING. 85-94.
10.1145/1835698.1835722
Vechev MT, Yahav E, Yorsh G (2009). Experience with Model Checking Linearizability. SPIN. Editors: Pasareanu, CS, vol. 5578, 261-278.
Vechev MT, Yahav E, Yorsh G (2009). Inferring Synchronization under Limited Observability. TACAS. Editors: Kowalewski, S, Philippou, A, vol. 5505, 139-154.
Lev-Ami T, Immerman N, Reps TW, Sagiv M, Srivastava S, Yorsh G(2009). SIMULATING REACHABILITY USING FIRST-ORDER LOGIC WITH APPLICATIONS TO VERIFICATION OF LINKED DATA STRUCTURES. LOGICAL METHODS IN COMPUTER SCIENCE vol. 5, (2) Article ARTN 12,
10.2168/LMCS-5(2:12)2009
Dor N, Field J, Gopan D, Lev-Ami T, Loginov A, Manevich R, Ramalingam G, Reps T et al. (2008). Automatic verification of strongly dynamic software systems. VERIFIED SOFTWARE: THEORIES, TOOLS, EXPERIMENTS. Editors: Meyer, B, Woodcock, J, vol. 4171, 82-92.
Yorsh G, Yahav E, Chandra S (2008). Generating precise and concise procedure summaries. POPL. Editors: Necula, GC, Wadler, P, 221-234.
10.1145/1328438.1328467
Yorsh G, Rabinovich AM, Sagiv M, Meyer A, Bouajjani A(2007). A logic of reachable patterns in linked data-structures. J. Log. Algebr. Program. vol. 73, Article 1-2, 111-142.
10.1016/j.jlap.2006.12.001
Yorsh G, Reps T, Sagiv M, Wilhelm R(2007). Logical characterizations of heap abstractions. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC vol. 8, (1) Article ARTN 5,
10.1145/1182613.1182618
Yorsh G, Reps TW, Sagiv M, Wilhelm R(2007). Logical characterizations of heap abstractions. ACM Trans. Comput. Log. vol. 8, Article 1, 5-5.
10.1145/1182613.1182618
Yorsh G, Rabinovich AM, Sagiv M, Meyer A, Bouajjani A (2006). A Logic of Reachable Patterns in Linked Data-Structures. FoSSaCS. Editors: Aceto, L, Ingólfsdóttir, A, vol. 3921, 94-110.
Yorsh G, Rabinovich A, Sagiv M, Meyer A, Bouajjani A(2006). A logic of reachable patterns in linked data-structures. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS vol. 3921, 94-110.
10.1007/11690634_7
Yorsh G, Ball T, Sagiv M (2006). Testing, abstraction, theorem proving: better together!. ISSTA. Editors: Pollock, LL, Pezzè, M, 145-156.
Yorsh G, Musuvathi M (2005). A Combination Method for Generating Interpolants. CADE. Editors: Nieuwenhuis, R, vol. 3632, 353-368.
Ball T, Kupferman O, Yorsh G (2005). Abstraction for Falsification. CAV. Editors: Etessami, K, Rajamani, SK, vol. 3576, 67-81.
Yorsh G, Skidanov A, Reps TW, Sagiv S(2005). Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work. Electr. Notes Theor. Comput. Sci. vol. 131, 125-138.
10.1016/j.entcs.2005.01.028
Lev-Ami T, Immerman N, Reps TW, Sagiv S, Srivastava S, Yorsh G (2005). Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures. CADE. Editors: Nieuwenhuis, R, vol. 3632, 99-115.
Reps TW, Sagiv S, Yorsh G (2004). Symbolic Implementation of the Best Transformer. VMCAI. Editors: Steffen, B, Levi, G, vol. 2937, 252-266.
Yorsh G, Reps TW, Sagiv S (2004). Symbolically Computing Most-Precise Abstract Operations for Shape Analysis. TACAS. Editors: Jensen, K, Podelski, A, vol. 2988, 530-545.
Immerman N, Rabinovich AM, Reps TW, Sagiv S, Yorsh G (2004). The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. CSL. Editors: Marcinkowski, J, Tarlecki, A, vol. 3210, 160-174.
Immerman N, Rabinovich AM, Reps TW, Sagiv S, Yorsh G (2004). Verification via Structure Simulation. CAV. Editors: Alur, R, Peled, DA, vol. 3114, 281-294.
Return to top