Demo Data from EDBT 2026 / reviewers in the wild / expert
Mehmet E. Bakir
dblp:155/6706 · also Mehmet Emin Bakir
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0002-3012-8713ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 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 |
Program verification · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
systems biology |
0.3 | 1 | 2018 | Automatic selection of verification tools for efficient analysis of biochemical models · Bioinform. 2018 |
Program verification
model checking |
0.3 | 1 | 2018 | Automatic selection of verification tools for efficient analysis of biochemical models · Bioinform. 2018 |
Program verification › model checking
statistical model checking |
0.3 | 1 | 2018 | Automatic selection of verification tools for efficient analysis of biochemical models · Bioinform. 2018 |
Methods — techniques the papers use, named apart from their topics
machine learning-based prediction · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Automatic selection of verification tools for efficient analysis of biochemical modelsabstractMotivation: Formal verification is a computational approach that checks system correctness (in relation to a desired functionality). It has been widely used in engineering applications to verify that systems work correctly. Model checking, an algorithmic approach to verification, looks at whether a system model satisfies its requirements specification. This approach has been applied to a large number of models in systems and synthetic biology as well as in systems medicine. Model checking is, however, computationally very expensive, and is not scalable to large models and systems. Consequently, statistical model checking (SMC), which relaxes some of the constraints of model checking, has been introduced to address this drawback. Several SMC tools have been developed; however, the performance of each tool significantly varies according to the system model in question and the type of requirements being verified. This makes it hard to know, a priori, which one to use for a given model and requirement, as choosing the most efficient tool for any biological application requires a significant degree of computational expertise, not usually available in biology labs. The objective of this article is to introduce a method and provide a tool leading to the automatic selection of the most appropriate model checker for the system of interest. Results: We provide a system that can automatically predict the fastest model checking tool for a given biological model. Our results show that one can make predictions of high confidence, with over 90% accuracy. This implies significant performance gain in verification time and substantially reduces the 'usability barrier' enabling biologists to have access to this powerful computational technology. Availability and implementation: SMC Predictor tool is available at http://www.smcpredictor.com. Supplementary information: Supplementary data are available at Bioinformatics online. Mehmet E. Bakir, Savas Konur, Marian Gheorghe 0001, Natalio Krasnogor, Mike Stannett |
Bioinform. | 1 |
| 2014 | Adaptive model learning for continual verification of non-functional propertiesabstractA growing number of business and safety-critical services are delivered by computer systems designed to reconfigure in response to changes in workloads, requirements and internal state. In recent work, we showed how a formal technique called continual verification can be used to ensure that such systems continue to satisfy their reliability and performance requirements as they evolve, and we presented the challenges associated with the new technique. In this paper, we address important instances of two of these challenges, namely the maintenance of up-to-date reliability models and the adoption of continual verification in engineering practice. To address the first challenge, we introduce a new method for learning the parameters of the reliability models from observations of the system behaviour. This method is capable of adapting to variations in the frequency of the available system observations, yielding faster and more accurate learning than existing solutions. To tackle the second challenge, we present a new software engineering tool that enables developers to use our adaptive learning and continual verification in the area of service-based systems, without a formal verification background and with minimal effort. Radu Calinescu, Yasmin Rafiq, Kenneth Johnson, Mehmet E. Bakir |
ICPE | 4 |