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

Hervé Albin-Amiot

dblp:93/769 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 1 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
3 papers
Software maintenance and evolution · 54% Requirements engineering and software design · 42% Programming languages and type systems · 4%

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

TopicWeightPapersLastEvidence papers
Software maintenance and evolution › reverse engineering
design recovery
0.012004
Recovering binary class relationships: putting icing on the UML cake · OOPSLA 2004
Requirements engineering and software design › model-driven engineering
UML modeling
0.012004
Recovering binary class relationships: putting icing on the UML cake · OOPSLA 2004
Requirements engineering and software design › object-oriented analysis and design
object-oriented design
0.012003
A Pragmatic Study of Binary Class Relationships · ASE 2003
Software maintenance and evolution
software evolution
0.012003
A Pragmatic Study of Binary Class Relationships · ASE 2003
Requirements engineering and software design
design patterns
0.012001
Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together · ASE 2001
Software maintenance and evolution › reverse engineering
design pattern detection
0.012001
Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together · ASE 2001
Software maintenance and evolution
software reengineering
0.012001
Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together · ASE 2001
Programming languages and type systems
object-oriented programming
0.012003
A Pragmatic Study of Binary Class Relationships · ASE 2003
Requirements engineering and software design
software architecture
0.012001
Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together · ASE 2001

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

source code analysis · 0.1property-based detection · 0.0
YearPublicationVenuePosition
2004 Recovering binary class relationships: putting icing on the UML cake
abstract
A discontinuity exists between object-oriented modeling and programming languages. This discontinuity arises from ambiguous concepts in modeling languages and a lack of corresponding concepts in programming languages. It is particularly acute for binary class relationships---association, aggregation, and composition. It hinders the traceability between software implementation and design, thus hampering software analysis. We propose consensual definitions of the binary class relationships with four minimal properties---exclusivity, invocation site, lifetime, and multiplicity. We describe algorithms to detect automatically these properties in source code and apply these on several frameworks. Thus, we bridge the gap between implementation and design for the binary class relationships, easing software analysis.
Yann-Gaël Guéhéneuc, Hervé Albin-Amiot
OOPSLA2
2003 A Pragmatic Study of Binary Class Relationships
abstract
A discontinuity exists between modeling and object-oriented programming languages. This discontinuity is a consequence of ambiguous notions in modeling languages and lack of corresponding notions in object-oriented programming languages. It hinders the transition between software implementation and design and hampers software maintenance. This discontinuity is particularly acute for binary class relationships, such as the association, aggregation, and composition relationships. We present a solution to bridge the discontinuity between implementation and design for the binary class relationships: we propose consensual definitions of the binary class relationships in terms of four properties (exclusivity, invocation site, lifetime, multiplicity). We describe algorithms to detect these properties in Java source code.
Yann-Gaël Guéhéneuc, Hervé Albin-Amiot
ASE2
2001 Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together
abstract
Design patterns ease the designing, understanding, and re-engineering of software. Achieving a well-designed piece of software requires a deep understanding and a good practice of design patterns. Understanding existing software relies on the ability to identify architectural forms resulting from the implementation of design patterns. Maintaining software involves spotting places that can be improved by using better design decisions, like those advocated by design patterns. Nevertheless, there is a lack of tools automatizing the use of design patterns to achieve well-designed pieces of software, to identify recurrent architectural forms, and to maintain software. We present a set of tools and techniques to help OO software practitioners design, understand, and re-engineer a piece of software using design-patterns. A first prototype tool, PATTERNS-BOX, provides assistance in designing the architecture of a new piece of software, while a second prototype tool, PTIDEJ, identifies design patterns used in an existing one. These tools, in combination, support maintenance by highlighting defects in an existing design, and by suggesting and applying corrections based on widely-accepted design pattern solutions.
Hervé Albin-Amiot, Pierre Cointe, Yann-Gaël Guéhéneuc, Narendra Jussien
ASE1