Demo Data from EDBT 2026 / reviewers in the wild / expert
Ali Y. Duale
dblp:10/3109
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2Software engineering, systems software and programming languages · 2Systems, architecture and hardware · 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.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Electronic design automation · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Software testing · 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 |
|---|---|---|---|---|
Electronic design automation
hardware verification and test |
0.0 | 1 | 2004 | A Method Enabling Feasible Conformance Test Sequence Generation for EFSM Models · IEEE Trans. Computers 2004 |
Software testing
protocol testing |
0.0 | 1 | 2003 | A technique to generate feasible tests for communications systems with multiple timers · IEEE/ACM Trans. Netw. 2003 |
Automata and formal languages › finite automata
extended finite state machines |
0.0 | 1 | 2003 | A technique to generate feasible tests for communications systems with multiple timers · IEEE/ACM Trans. Netw. 2003 |
Methods — techniques the papers use, named apart from their topics
reachability analysis · 0.1extended finite state machine · 0.1finite-state machine testing · 0.0conflict detection and elimination · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | A Method Enabling Feasible Conformance Test Sequence Generation for EFSM ModelsabstractA formal description of an implementation under test (IUT), such as its VHDL behavior description, is required to automatically generate feasible test sequences for the IUT. Although finite-state machines (FSMs) can be used to describe the control structures of communication protocols, the data portion can only be modeled by extended finite-state machines (EFSMs). However, infeasible paths due to the conflicts among the condition and action variables of EFSMs complicate the test generation process. We introduce a method enabling the automatic generation of realizable test sequences from a class of EFSMs. Algorithms to detect and eliminate conflicts caused by the interdependences among the variables of a class of EFSM models are presented. After all conflicts are eliminated from the EFSM graph, the existing FSM-based automated test generation methods can be used to generate feasible test sequences. Recently, these algorithms have been implemented as a software package called INDEEL. This methodology is applied to generate feasible tests for protocols such as ACA and MIL-STD 188-220. Current applications include IETF protocols and ASAP. Ali Y. Duale, M. Ümit Uyar |
IEEE Trans. Computers | 1 |
| 2003 | Towards Testing SDL Specifications: Models and Fault Coverage for Concurrent Timers
Mariusz A. Fecko, M. Ümit Uyar, Ali Y. Duale |
FORTE | 3 |
| 2003 | Experience in developing and testing network protocol software using FDTs
M. Ümit Uyar, Mariusz A. Fecko, Ali Y. Duale, Paul D. Amer, Adarshpal S. Sethi |
Inf. Softw. Technol. | 3 |
| 2003 | A technique to generate feasible tests for communications systems with multiple timersabstractWe present a new model for testing real-time protocols with multiple timers, which captures complex timing dependencies by using simple linear expressions involving timer-related variables. This new modeling technique, combined with the algorithms to eliminate inconsistencies, allows generation of feasible test sequences without compromising their fault coverage. The model is specifically designed for testing to avoid performing full reachability analysis, and to control the growth of the number of test scenarios. Based on extended finite state machines, it is applicable to languages such as SDL, VHDL, and Estelle. The technique models a realistic testing framework in which each I/O exchange takes a certain time to realize and timers can be arbitrarily started or stopped. A software tool implementing this technique is used to generate test cases for the US Army wireless standard MIL-STD 188-220. Mariusz A. Fecko, M. Ümit Uyar, Ali Y. Duale, Paul D. Amer |
IEEE/ACM Trans. Netw. | 3 |