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

Francisco Cirelli

dblp:409/0401 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

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

Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021

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
Requirements engineering and software design · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

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

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
requirements specification
0.912025
Unavoidable Boundary Conditions: a Control Perspective on Goal Conflicts · ICSE 2025
Automated reasoning and model checking
reactive synthesis
0.312025
Unavoidable Boundary Conditions: a Control Perspective on Goal Conflicts · ICSE 2025
Automated reasoning and model checking › reactive synthesis
unrealizable specifications
0.312025
Unavoidable Boundary Conditions: a Control Perspective on Goal Conflicts · ICSE 2025

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

realizability analysis · 1.7reactive synthesis · 1.7
YearPublicationVenuePosition
2025 Unavoidable Boundary Conditions: a Control Perspective on Goal Conflicts
abstract
Boundary conditions express situations under which requirements specifications conflict. They are used within a broader conflict management process to produce less idealized specifications. Several approaches have been proposed to identify boundary conditions automatically. Some introduce a prioritization criteria to reduce the number of boundary conditions presented to an engineer. However, identifying the few, relevant boundary conditions remains an open challenge. In this paper, we argue that one of the problems of the state of the art is with the definition of boundary condition itselfit is too weak. We propose a stronger definition which we refer to as Unavoidable Boundary Conditions (UBCs), which utilizes the notion of realizability in reactive synthesis. We show experimentally that UBCs non-trivially reduce the number of conditions produced by existing boundary condition identification techniques. We also relate UBCs to existing concepts in reactive synthesis used to provide feedback for unrealizable specifications (including counter-strategies and unrealizable cores). We then show that UBCs provide a targeted form of feedback for repairing unrealizable specifications.
Francisco Cirelli, Dalal Alrajeh, Sebastián Uchitel
ICSE1