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

Greg Brunet

dblp:43/3757 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

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

Software engineering, systems software and programming languages · 4 · 1 first-authorTheory of computation · 1 · 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
4 papers
Requirements engineering and software design · 94% Program verification · 6%
Theoretical computer science
2 papers
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Requirements engineering and software design › model-driven engineering › model synthesis
behavior model synthesis
0.222009
Synthesis of Partial Behavior Models from Properties and Scenarios · IEEE Trans. Software Eng. 2009
Behaviour Model Synthesis from Properties and Scenarios · ICSE 2007
Requirements engineering and software design › specification
scenario-based specification
0.222009
Synthesis of Partial Behavior Models from Properties and Scenarios · IEEE Trans. Software Eng. 2009
Behaviour Model Synthesis from Properties and Scenarios · ICSE 2007
Logic in computer science › concurrency theory
modal transition systems
0.112012
Weak Alphabet Merging of Partial Behavior Models · ACM Trans. Softw. Eng. Methodol. 2012
Requirements engineering and software design
requirements specification
0.112009
Synthesis of Partial Behavior Models from Properties and Scenarios · IEEE Trans. Software Eng. 2009
Requirements engineering and software design
scenario-based synthesis
0.112009
Synthesis of Partial Behavior Models from Properties and Scenarios · IEEE Trans. Software Eng. 2009
Requirements engineering and software design
software architecture
0.112009
Synthesis of Partial Behavior Models from Properties and Scenarios · IEEE Trans. Software Eng. 2009
Requirements engineering and software design
model-driven engineering
0.112006
Properties of Behavioural Model Merging · FM 2006
Logic in computer science
formal semantics
0.012006
Properties of Behavioural Model Merging · FM 2006

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

weak alphabet refinement · 0.3parallel composition · 0.3modal transition systems · 0.2model merging · 0.1SAT-based synthesis · 0.1safety properties · 0.1
YearPublicationVenuePosition
2012 Weak Alphabet Merging of Partial Behavior Models
abstract
Constructing comprehensive operational models of intended system behavior is a complex and costly task, which can be mitigated by the construction of partial behavior models, providing early feedback and subsequently elaborating them iteratively. However, how should partial behavior models with different viewpoints covering different aspects of behavior be composed? How should partial models of component instances of the same type be put together? In this article, we propose model merging of modal transition systems (MTSs) as a solution to these questions. MTS models are a natural extension of labelled transition systems that support explicit modeling of what is currently unknown about system behavior. We formally define model merging based on weak alphabet refinement, which guarantees property preservation, and show that merging consistent models is a process that should result in a minimal common weak alphabet refinement (MCR). In this article, we provide theoretical results and algorithms that support such a process. Finally, because in practice MTS merging is likely to be combined with other operations over MTSs such as parallel composition, we also study the algebraic properties of merging and apply these, together with the algorithms that support MTS merging, in a case study.
Dario Fischbein, Nicolás D'Ippolito, Greg Brunet, Marsha Chechik, Sebastián Uchitel
ACM Trans. Softw. Eng. Methodol.3
2009 Synthesis of Partial Behavior Models from Properties and Scenarios
abstract
Synthesis of behavior models from software development artifacts such as scenario-based descriptions or requirements specifications helps reduce the effort of model construction. However, the models favored by existing synthesis approaches are not sufficiently expressive to describe both universal constraints provided by requirements and existential statements provided by scenarios. In this paper, we propose a novel synthesis technique that constructs behavior models in the form of modal transition systems (MTS) from a combination of safety properties and scenarios. MTSs distinguish required, possible, and proscribed behavior, and their elaboration not only guarantees the preservation of the properties and scenarios used for synthesis but also supports further elicitation of new requirements.
Sebastián Uchitel, Greg Brunet, Marsha Chechik
IEEE Trans. Software Eng.2
2007 Behaviour Model Synthesis from Properties and Scenarios
abstract
Synthesis of behaviour models from software development artifacts such as scenario-based descriptions or requirements specifications not only helps significantly reduce the effort of model construction, but also provides a bridge between approaches geared toward requirements analysis and those geared towards reasoning about system design at the architectural level. However, the models favoured by existing synthesis approaches are not sufficiently expressive to describe both universal constraints provided by requirements and existential statements provided by scenarios. In this paper, we propose a novel synthesis technique that constructs behaviour models in the form of modal transition systems (MTS) from a combination of safety properties and scenarios. MTSs distinguish required, possible and proscribed behaviour, and their elaboration not only guarantees the preservation of the properties and scenarios used for synthesis but also supports further elicitation of new requirements.
Sebastián Uchitel, Greg Brunet, Marsha Chechik
ICSE2
2006 Properties of Behavioural Model Merging
Greg Brunet, Marsha Chechik, Sebastián Uchitel
FM1