Demo Data from EDBT 2026 / reviewers in the wild / expert
Alejandra Alfonso
dblp:265/9505
· DBLP profile ↗
1ranked-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 · 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
1 paper |
Requirements engineering and software design · 100% | |
| Theoretical computer science
1 paper |
Automata and formal languages · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Requirements engineering and software design › non-functional requirements
real-time requirements |
0.0 | 1 | 2004 | Visual Timed Event Scenarios · ICSE 2004 |
Requirements engineering and software design
requirements specification |
0.0 | 1 | 2004 | Visual Timed Event Scenarios · ICSE 2004 |
Automata and formal languages
timed automata |
0.0 | 1 | 2004 | Visual Timed Event Scenarios · ICSE 2004 |
Methods — techniques the papers use, named apart from their topics
timed automata · 0.1partial orders · 0.1model checking · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | Visual Timed Event ScenariosabstractFormal description of real-time requirements is a difficult and error prone task. Conceptual and tool support for this activity plays a central role in the agenda of technology transference from the formal verification engineering community to the real-time systems development practice. In this article we present VTS, a visual language to define complex event-based requirements such as freshness, bounded response, event correlation, etc. The underlying formalism is based on partial orders and supports real-time constraints. The problem of checking whether a timed automaton model of a system satisfies these sort of scenarios is shown to be decidable. Moreover, we have also developed a tool that translates visually specified scenarios into observer timed automata. The resulting automata can be composed with a model under analysis in order to check satisfaction of the stated scenarios. We show the benefits of applying these ideas to some case studies. Alejandra Alfonso, Víctor A. Braberman, Nicolas Kicillof, Alfredo Olivero |
ICSE | 1 |