Răzvan Diaconescu

1.3k total citations
33 papers, 604 citations indexed

About

Răzvan Diaconescu is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Răzvan Diaconescu has authored 33 papers receiving a total of 604 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Artificial Intelligence, 19 papers in Computational Theory and Mathematics and 4 papers in Software. Recurrent topics in Răzvan Diaconescu's work include Logic, programming, and type systems (27 papers), Logic, Reasoning, and Knowledge (21 papers) and Formal Methods in Verification (12 papers). Răzvan Diaconescu is often cited by papers focused on Logic, programming, and type systems (27 papers), Logic, Reasoning, and Knowledge (21 papers) and Formal Methods in Verification (12 papers). Răzvan Diaconescu collaborates with scholars based in Romania, United Kingdom and Japan. Răzvan Diaconescu's co-authors include Kokichi Futatsugi, Joseph A. Goguen, Petros Stefaneas, R. M. Burstall, Andrzej Tarlecki, Till Mossakowski and Kazuhiro Ogata and has published in prestigious journals such as Theoretical Computer Science, Lecture notes in computer science and Journal of Symbolic Logic.

In The Last Decade

Răzvan Diaconescu

30 papers receiving 542 citations

Peers

Răzvan Diaconescu
R.J. vanGlabbeek United States
N. P. Mendler United Kingdom
Stuart F. Allen United States
Douglas J. Howe United States
W. R. Cleaveland United States
R.J. vanGlabbeek United States
Răzvan Diaconescu
Citations per year, relative to Răzvan Diaconescu Răzvan Diaconescu (= 1×) peers R.J. vanGlabbeek

Countries citing papers authored by Răzvan Diaconescu

Since Specialization
Citations

This map shows the geographic impact of Răzvan Diaconescu's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Răzvan Diaconescu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Răzvan Diaconescu more than expected).

Fields of papers citing papers by Răzvan Diaconescu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Răzvan Diaconescu. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Răzvan Diaconescu. The network helps show where Răzvan Diaconescu may publish in the future.

Co-authorship network of co-authors of Răzvan Diaconescu

This figure shows the co-authorship network connecting the top 25 collaborators of Răzvan Diaconescu. A scholar is included among the top collaborators of Răzvan Diaconescu based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Răzvan Diaconescu. Răzvan Diaconescu is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Diaconescu, Răzvan. (2022). Representing 3/2-Institutions as Stratified Institutions. Mathematics. 10(9). 1507–1507. 2 indexed citations
2.
Diaconescu, Răzvan. (2016). Functorial semantics of first-order views. Theoretical Computer Science. 656. 46–59.
3.
Diaconescu, Răzvan, et al.. (2015). Recent Trends in Algebraic Development Techniques. Lecture notes in computer science. 1 indexed citations
4.
Diaconescu, Răzvan, et al.. (2014). Foundations for structuring behavioural specifications. Journal of Logical and Algebraic Methods in Programming. 83(3-4). 319–338.
5.
Diaconescu, Răzvan, et al.. (2011). On the algebra of structured specifications. Theoretical Computer Science. 412(28). 3145–3174. 11 indexed citations
6.
Diaconescu, Răzvan. (2011). Interpolation for predefined types. Mathematical Structures in Computer Science. 22(1). 1–24. 5 indexed citations
7.
Mossakowski, Till, Răzvan Diaconescu, & Andrzej Tarlecki. (2009). What is a Logic Translation?. Logica Universalis. 3(1). 95–124. 24 indexed citations
8.
Diaconescu, Răzvan. (2005). Behavioural specification for hierarchical object composition. Theoretical Computer Science. 343(3). 305–331. 3 indexed citations
9.
Diaconescu, Răzvan. (2004). Elementary Diagrams in Institutions. Journal of Logic and Computation. 14(5). 651–674. 28 indexed citations
10.
Diaconescu, Răzvan, Kokichi Futatsugi, & Kazuhiro Ogata. (2003). CafeOBJ: Logical foundations and methodologies. Computing and Informatics / Computers and Artificial Intelligence. 22. 257–283. 12 indexed citations
11.
Diaconescu, Răzvan & Kokichi Futatsugi. (2002). Logical foundations of CafeOBJ. Theoretical Computer Science. 285(2). 289–318. 56 indexed citations
12.
Diaconescu, Răzvan & Kokichi Futatsugi. (1998). Cafeobj Report. 86 indexed citations
13.
Diaconescu, Răzvan, et al.. (1998). An Overview of CafeOBJ. Electronic Notes in Theoretical Computer Science. 15. 285–298. 11 indexed citations
14.
Diaconescu, Răzvan. (1998). Extra Theory Morphisms for Institutions: Logical Semantics for Multi-Paradigm Languages. Applied Categorical Structures. 6(4). 427–453. 14 indexed citations
15.
Diaconescu, Răzvan & Petros Stefaneas. (1997). Modality in open institutions with concrete syntax. JAIST Repository. 97. 1–12. 2 indexed citations
16.
Diaconescu, Răzvan. (1996). Foundations of Behavioural Specification in Rewriting Logic. Electronic Notes in Theoretical Computer Science. 4. 226–245. 12 indexed citations
17.
Diaconescu, Răzvan. (1995). Completeness of category-based equational deduction. Mathematical Structures in Computer Science. 5(1). 9–40. 10 indexed citations
18.
Burstall, R. M. & Răzvan Diaconescu. (1994). Hiding and behaviour: an institutional approach. OpenGrey (Institut de l'Information Scientifique et Technique). 75–92. 27 indexed citations
19.
Goguen, Joseph A. & Răzvan Diaconescu. (1994). Towards an algebraic semantics for the object paradigm. Lecture notes in computer science. 1–29. 21 indexed citations
20.
Diaconescu, Răzvan, et al.. (1987). Models of arithmetic and categories with finiteness conditions. Annals of Pure and Applied Logic. 35. 123–148. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026