Paul Marinescu
Paul Marinescu
Bestätigte E-Mail-Adresse bei fb.com - Startseite
Titel
Zitiert von
Zitiert von
Jahr
KATCH: High-coverage testing of software patches
PD Marinescu, C Cadar
Proceedings of the 2013 9th Joint Meeting on Foundations of Software …, 2013
1392013
LFI: A practical and general library-level fault injector
PD Marinescu, G Candea
2009 IEEE/IFIP International Conference on Dependable Systems & Networks …, 2009
982009
make test-zesti: A symbolic execution solution for improving regression testing
PD Marinescu, C Cadar
2012 34th International Conference on Software Engineering (ICSE), 716-726, 2012
922012
Efficient testing of recovery code using fault injection
PD Marinescu, G Candea
ACM Transactions on Computer Systems (TOCS) 29 (4), 1-38, 2011
642011
Covrig: A framework for the analysis of code, test, and coverage evolution in real software
P Marinescu, P Hosek, C Cadar
Proceedings of the 2014 international symposium on software testing and …, 2014
512014
An extensible technique for high-precision testing of recovery code
P Marinescu, R Banabic, G Candea
Proceedings of the USENIX annual technical conference, 2010
402010
High-coverage symbolic patch testing
PD Marinescu, C Cadar
International SPIN Workshop on Model Checking of Software, 7-21, 2012
172012
IVD: Automatic learning and enforcement of authorization rules in online social networks
P Marinescu, C Parry, M Pomarole, Y Tian, P Tague, I Papagiannis
2017 IEEE Symposium on Security and Privacy (SP), 1094-1109, 2017
102017
Studying application-library interaction and behavior with LibTrac
E Bisolfati, P Marinescu, G Candea
2010 IEEE/IFIP International Conference on Dependable Systems & Networks …, 2010
42010
Transparently improving regression testing using symbolic execution
PD Marinescu
Imperial College London, 2014
12014
AFEX: An automated fault explorer for faster system testing
L Keller, PD Marinescu, G Candea
12008
LibSE: Inferring return values and path conditions for library functions
P Marinescu
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–12