Follow
George Balatsouras
George Balatsouras
Google
Verified email at di.uoa.gr - Homepage
Title
Cited by
Cited by
Year
Pointer analysis
Y Smaragdakis, G Balatsouras
Foundations and Trends® in Programming Languages 2 (1), 1-69, 2015
2212015
Introspective analysis: context-sensitivity, across the board
Y Smaragdakis, G Kastrinis, G Balatsouras
Proceedings of the 35th ACM SIGPLAN Conference on Programming Language …, 2014
1332014
More sound static handling of Java reflection
Y Smaragdakis, G Balatsouras, G Kastrinis, M Bravenboer
Programming Languages and Systems: 13th Asian Symposium, APLAS 2015, Pohang …, 2015
762015
Structure-sensitive points-to analysis for C and C++
G Balatsouras, Y Smaragdakis
Static Analysis: 23rd International Symposium, SAS 2016, Edinburgh, UK …, 2016
702016
Set-based pre-processing for points-to analysis
Y Smaragdakis, G Balatsouras, G Kastrinis
Proceedings of the 2013 ACM SIGPLAN international conference on Object …, 2013
332013
An efficient data structure for must-alias analysis
G Kastrinis, G Balatsouras, K Ferles, N Prokopaki-Kostopoulou, ...
Proceedings of the 27th International Conference on Compiler Construction, 48-58, 2018
112018
A datalog model of must-alias analysis
G Balatsouras, K Ferles, G Kastrinis, Y Smaragdakis
Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the …, 2017
112017
Doop: Framework for Java pointer analysis
Y Smaragdakis, M Bravenboer, G Kastrinis, G Balatsouras, TT Bartolomei, ...
62018
Pointer Analysis. Foundations and Trends® in Programming Languages 2, 1 (2015), 1–69
Y Smaragdakis, G Balatsouras
52015
Class hierarchy complementation: soundly completing a partial type graph
G Balatsouras, Y Smaragdakis
ACM SIGPLAN Notices 48 (10), 515-532, 2013
52013
Recovering Structural Information for Better Static Analysis
G Balatsouras
University of Athens, 2017
12017
Graph-based data structure for representation of sets of must-alias analysis inferences
N Prokopaki–Kostopoulou, G Kastrinis, G Balatsouras
2016
The system can't perform the operation now. Try again later.
Articles 1–12