Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Daniel P. Kennedy
Dan Graur
Barbara Aquilani
Mathieu Petit
R. M. Rodriguez-Dagnino
Hankun Lv
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Home
/
Author
/
ANDREI ŞTEFĂNESCU
Author Info
Open Visualization
Name
Affiliation
Papers
ANDREI ŞTEFĂNESCU
University of Illinois at Urbana-Champaign, Urbana, IL, USA
15
Collaborators
Citations
PageRank
24
216
9.89
Referers
Referees
References
297
305
277
Search Limit
100
305
Publications (15 rows)
Collaborators (24 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
A Constructor-Based Reachability Logic for Rewrite Theories.
0
0.34
2020
KEVM: A Complete Formal Semantics of the Ethereum Virtual Machine
13
0.78
2018
A Constructor-Based Reachability Logic for Rewrite Theories.
5
0.39
2017
Language definitions as rewrite theories.
1
0.35
2016
Semantics-based program verifiers for all languages.
16
0.72
2016
KJS: a complete formal semantics of JavaScript
20
0.72
2015
All-Path Reachability Logic.
17
0.70
2014
MatchC: A Matching Logic Reachability Verifier Using the K Framework.
0
0.34
2014
Natural proofs for structure, data, and separation
39
0.94
2013
One-Path Reachability Logic
15
0.93
2013
Towards a unified theory of operational and axiomatic semantics
14
0.62
2012
From Hoare Logic to Matching Logic Reachability.
15
0.64
2012
Checking reachability using matching logic
18
0.77
2012
Recursive proofs for inductive tree data-structures
25
0.82
2012
Matching logic: a new program verification approach.
18
0.83
2011
1