Marianna Rapoport
Titel
Zitiert von
Zitiert von
Jahr
A simple soundness proof for dependent object types
M Rapoport, I Kabir, P He, O Lhoták
Proceedings of the ACM on Programming Languages 1 (OOPSLA), 1-27, 2017
172017
Constructing call graphs of Scala programs
K Ali, M Rapoport, O Lhoták, J Dolby, F Tip
European Conference on Object-Oriented Programming, 54-79, 2014
112014
The future is ours: prophecy variables in separation logic
R Jung, R Lepigre, G Parthasarathy, M Rapoport, A Timany, D Dreyer, ...
Proceedings of the ACM on Programming Languages 4 (POPL), 1-32, 2019
102019
A path to dot: formalizing fully path-dependent types
M Rapoport, O Lhoták
arXiv preprint arXiv:1904.07298, 2019
92019
Mutable WadlerFest DOT
M Rapoport, O Lhoták
Proceedings of the 19th Workshop on Formal Techniques for Java-like Programs …, 2017
92017
Precise data flow analysis in the presence of correlated method calls
M Rapoport, O Lhoták, F Tip
International Static Analysis Symposium, 54-71, 2015
92015
Type-based call graph construction algorithms for Scala
K Ali, M Rapoport, O Lhoták, J Dolby, F Tip
ACM Transactions on Software Engineering and Methodology (TOSEM) 25 (1), 1-43, 2015
82015
Who you gonna call? Analyzing web requests in Android applications
M Rapoport, P Suter, E Wittern, O Lhótak, J Dolby
2017 IEEE/ACM 14th International Conference on Mining Software Repositories …, 2017
72017
Automated security testing for a mobile application or a backend server
SA Baset, JT Dolby, M Rapoport, P Suter
US Patent 10,445,507, 2019
42019
Blame for Null
A Nieto, M Rapoport, G Richards, O Lhoták
34th European Conference on Object-Oriented Programming (ECOOP 2020), 2020
2020
A Path to DOT: Formalizing Scala with Dependent Object Types
M Rapoport
University of Waterloo, 2019
2019
Data flow analysis in the presence of correlated calls
M Rapoport
University of Waterloo, 2014
2014
An Evaluation of Call Graph Construction Algorithms for Scala
K Ali, M Rapoport, O Lhoták, J Dolby, F Tip
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–13