default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrei Stefanescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Ryan G. Scott, Brett Boston, Benjamin Davis, Iavor S. Diatchki, Mike Dodds, Joe Hendrix, Daniel Matichuk, Kevin Quick, Tristan Ravitch, Valentin Robert, Benjamin Selfridge, Andrei Stefanescu, Daniel Wagner, Simon Winwood:
Macaw: A Machine Code Toolbox for the Busy Binary Analyst. CoRR abs/2407.06375 (2024)- 2021
- [j4]Paul He
, Eddy Westbrook, Brent Carmer, Chris Phifer, Valentin Robert, Karl Smeltzer, Andrei Stefanescu, Aaron Tomb, Adam Wick, Matthew Yacavone, Steve Zdancewic:
A type system for extracting functional specifications from memory-safe imperative programs. Proc. ACM Program. Lang. 5(OOPSLA): 1-29 (2021) - [c15]Brett Boston, Samuel Breese, Joey Dodds, Mike Dodds, Brian Huffman, Adam Petcher, Andrei Stefanescu:
Verified Cryptographic Code for Everybody. CAV (1) 2021: 645-668 - 2020
- [j3]Stephen Skeirik, Andrei Stefanescu, José Meseguer:
A Constructor-Based Reachability Logic for Rewrite Theories. Fundam. Informaticae 173(4): 315-382 (2020)
2010 – 2019
- 2019
- [j2]Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon M. Moore, Traian-Florin Serbanuta, Grigore Rosu:
All-Path Reachability Logic. Log. Methods Comput. Sci. 15(2) (2019) - 2018
- [c14]Everett Hildenbrandt, Manasvi Saxena, Nishant Rodrigues, Xiaoran Zhu, Philip Daian, Dwight Guth, Brandon M. Moore, Daejun Park, Yi Zhang, Andrei Stefanescu, Grigore Rosu:
KEVM: A Complete Formal Semantics of the Ethereum Virtual Machine. CSF 2018: 204-217 - [i2]Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon M. Moore, Traian-Florin Serbanuta, Grigore Rosu:
All-Path Reachability Logic. CoRR abs/1810.10826 (2018) - 2017
- [c13]Stephen Skeirik, Andrei Stefanescu, José Meseguer:
A Constructor-Based Reachability Logic for Rewrite Theories. LOPSTR 2017: 201-217 - [i1]Stephen Skeirik, Andrei Stefanescu, José Meseguer:
A Constructor-Based Reachability Logic for Rewrite Theories. CoRR abs/1709.05045 (2017) - 2016
- [b1]Andrei Stefanescu:
Toward language-independent program verification. University of Illinois Urbana-Champaign, USA, 2016 - [j1]Vlad Rusu, Dorel Lucanu, Traian-Florin Serbanuta, Andrei Arusoaie, Andrei Stefanescu, Grigore Rosu:
Language definitions as rewrite theories. J. Log. Algebraic Methods Program. 85(1): 98-120 (2016) - [c12]Andrei Stefanescu, Daejun Park, Shijiao Yuwen, Yilong Li, Grigore Rosu:
Semantics-based program verifiers for all languages. OOPSLA 2016: 74-91 - 2015
- [c11]Daejun Park, Andrei Stefanescu, Grigore Rosu:
KJS: a complete formal semantics of JavaScript. PLDI 2015: 346-356 - 2014
- [c10]Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon M. Moore, Traian-Florin Serbanuta, Grigore Rosu:
All-Path Reachability Logic. RTA-TLCA 2014: 425-440 - [c9]Andrei Arusoaie, Dorel Lucanu, Vlad Rusu, Traian-Florin Serbanuta, Andrei Stefanescu, Grigore Rosu:
Language Definitions as Rewrite Theories. WRLA 2014: 97-112 - 2013
- [c8]Grigore Rosu, Andrei Stefanescu, Stefan Ciobaca, Brandon M. Moore:
One-Path Reachability Logic. LICS 2013: 358-367 - [c7]Xiaokang Qiu, Pranav Garg, Andrei Stefanescu, Parthasarathy Madhusudan:
Natural proofs for structure, data, and separation. PLDI 2013: 231-242 - 2012
- [c6]Grigore Rosu, Andrei Stefanescu:
From Hoare Logic to Matching Logic Reachability. FM 2012: 387-402 - [c5]Grigore Rosu, Andrei Stefanescu:
Towards a Unified Theory of Operational and Axiomatic Semantics. ICALP (2) 2012: 351-363 - [c4]Grigore Rosu, Andrei Stefanescu:
Checking reachability using matching logic. OOPSLA 2012: 555-574 - [c3]Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Stefanescu:
Recursive proofs for inductive tree data-structures. POPL 2012: 123-136 - 2011
- [c2]Grigore Rosu, Andrei Stefanescu:
Matching logic: a new program verification approach. ICSE 2011: 868-871 - [c1]Andrei Stefanescu:
MatchC: A Matching Logic Reachability Verifier Using the K Framework. K 2011: 183-198
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
