Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mihai Balint

dblp:02/2826 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 4 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 91% Software maintenance and evolution · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › type systems › subtyping
behavioral subtyping
0.112010
Automatic inference of abstract type behavior · ASE 2010
Programming languages and type systems › type systems
type hierarchy
0.112010
Automatic inference of abstract type behavior · ASE 2010
Programming languages and type systems
type systems
0.112010
Automatic inference of abstract type behavior · ASE 2010
Software maintenance and evolution
software reuse
0.012010
Automatic inference of abstract type behavior · ASE 2010

Methods — techniques the papers use, named apart from their topics

liskov substitution principle · 0.1
YearPublicationVenuePosition
2011 Automatic inference of model fields and their representation
abstract
Automatic mining or inference of formal specifications from program source code is a desirable goal for documentation and verification purposes. However, current approaches that generate invariants, pre- and post-conditions, procedure summaries and sometimes also class invariants have mostly focused on extracting specifications from concrete method bodies. Consequently, almost all results have a low level of abstraction that is very close to the analyzed source code.
Mihai Balint, Marius Minea
FTfJP@ECOOP1
2010 Automatic inference of abstract type behavior
abstract
Type hierarchies are an integral part of the object oriented software reuse machinery. Software flexibility can be increased through type inheritance which, if used in accordance with Liskov Substitution Principle (LSP) enables safe object substitution.
Mihai Balint
ASE1
2007 NOREX: A Distributed Reengineering Environment
abstract
Several reengineering environments have been created to provide for a unified infrastructure in which various approaches can be employed together. While the collaboration between tools is very strong within such environments, currently the inter-environmental collaboration is very weak and happens mainly at the level of data-files exchange. Consequently, the different groups of researchers are only collaborating shallowly via data, rather than at the level of analysis. In this demo, we present NOREX, a distributed reengineering environment that allows different groups of researchers to transparently use and combine existing techniques, and share their own, transcending any parochial barriers (e.g., implementation language or environment).
Mihai Balint, Petru Florin Mihancea, Tudor Gîrba, Radu Marinescu 0001
ICSM1
2006 How Developers Copy
abstract
Copy-paste programming is dangerous as it may lead to hidden dependencies between different parts of the system. Modifying clones is not always straight forward, because we might not know all the places that need modification. This is even more of a problem when several developers need to know about how to change the clones. In this paper, we correlate the code clones with the time of the modification and with the developer that performed the modification to detect patterns of how developers copy from one another. We develop visualization, named clone evolution view, to represent the evolution of the duplicated code. We show the relevance of our approach on several large case studies and we distill our experience in forms of interesting copy patterns
Mihai Balint, Radu Marinescu 0001, Tudor Gîrba
ICPC1