Andrei Stefanescu
Andrei Stefanescu
Research Engineer, Galois Inc
Verified email at - Homepage
Cited by
Cited by
Kevm: A complete formal semantics of the ethereum virtual machine
E Hildenbrandt, M Saxena, N Rodrigues, X Zhu, P Daian, D Guth, ...
2018 IEEE 31st Computer Security Foundations Symposium (CSF), 204-217, 2018
KJS: a complete formal semantics of JavaScript
D Park, A Stefanescu, G Roşu
PLDI'15, 346-356, 2015
Semantics-based program verifiers for all languages
A Stefănescu, D Park, S Yuwen, Y Li, G Roşu
ACM SIGPLAN Notices 51 (10), 74-91, 2016
Natural proofs for structure, data, and separation
X Qiu, P Garg, A Ştefănescu, P Madhusudan
PLDI'13 48 (6), 231-242, 2013
One-path reachability logic
G Rosu, A Stefanescu, S Ciobāca, BM Moore
LICS'13, 358-367, 2013
Checking reachability using matching logic
G Rosu, A Stefanescu
OOPSLA'12, 555-574, 2012
All-path reachability logic
A Ştefănescu, Ş Ciobācă, R Mereuta, BM Moore, TF Şerbănută, G Roşu
RTA-TCLA'14, 425-440, 2014
Matching logic: a new program verification approach (NIER track)
G Roşu, A Ştefănescu
Proceedings of the 33rd International Conference on Software Engineering …, 2011
Recursive proofs for inductive tree data-structures
P Madhusudan, X Qiu, A Stefanescu
POPL'12 47 (1), 123-136, 2012
From hoare logic to matching logic reachability
G Roşu, A Ştefănescu
FM'12, 387-402, 2012
Towards a unified theory of operational and axiomatic semantics
G Roşu, A Ştefănescu
ICALP'12, 351-363, 2012
A constructor-based reachability logic for rewrite theories
S Skeirik, A Stefanescu, J Meseguer
Fundamenta Informaticae 173 (4), 315-382, 2020
Language definitions as rewrite theories
V Rusu, D Lucanu, TF Şerbănuţă, A Arusoaie, A Ştefănescu, G Roşu
Journal of Logical and Algebraic Methods in Programming 85 (1), 98-120, 2016
MatchC: A matching logic reachability verifier using the K framework
A Stefanescu
Electronic Notes in Theoretical Computer Science 304, 183-198, 2014
All-path reachability logic
A Stefanescu, S Ciobāca, R Mereuta, B Moore, TF Serbanuta, G Rosu
Logical Methods in Computer Science 15, 2019
Language definitions as rewrite theories
A Arusoaie, D Lucanu, V Rusu, TF Şerbănuţă, A Ştefănescu, G Roşu
WRLA'14, 97-112, 2014
Verified cryptographic code for everybody
B Boston, S Breese, J Dodds, M Dodds, B Huffman, A Petcher, ...
Computer Aided Verification: 33rd International Conference, CAV 2021 …, 2021
A type system for extracting functional specifications from memory-safe imperative programs
P He, E Westbrook, B Carmer, C Phifer, V Robert, K Smeltzer, ...
Proceedings of the ACM on Programming Languages 5 (OOPSLA), 1-29, 2021
Matching logic rewriting: Unifying operational and axiomatic semantics in a practical and generic framework
G Rosu, A Stefanescu
Technical Report http://hdl. handle. net/2142/28357, University of Illinois, 2011
From Hoare logic to matching logic
G Rosu, A Stefanescu
FM, To appear, 2012
The system can't perform the operation now. Try again later.
Articles 1–20