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

Naif Alasmari

dblp:233/3226 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2022
0000-0001-5534-8627ORCID · corroborated

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

Software engineering, systems software and programming languages · 3 · 2 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 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 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Requirements engineering and software design › design process
design synthesis
0.512021
Evolutionary-Guided Synthesis of Verified Pareto-Optimal MDP Policies · ASE 2021
Requirements engineering and software design › non-functional requirements
quality-of-service requirements
0.512021
Evolutionary-Guided Synthesis of Verified Pareto-Optimal MDP Policies · ASE 2021
Automated reasoning and model checking › model checking
probabilistic model checking
0.112021
Evolutionary-Guided Synthesis of Verified Pareto-Optimal MDP Policies · ASE 2021

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

multi-objective genetic algorithm · 1.0parametric markov chains · 0.5parametric markov chain · 0.5
YearPublicationVenuePosition
2022 Synthesis of Pareto-optimal Policies for Continuous-Time Markov Decision Processes
abstract
We present a work-in-progress method for the synthesis of continuous-time Markov decision process (CTMDP) policies–an important problem not handled by current probabilistic model checkers. The policies synthesised by this method correspond to configurations of software systems or software controllers of cyber-physical systems (CPS) that satisfy predefined nonfunctional constraints and are Pareto-optimal with respect to a set of optimisation objectives. We illustrate the effectiveness of our method by using it to synthesise optimal configurations for a client-server system, and optimal controllers for a driver-attention management CPS.
Naif Alasmari, Radu Calinescu
SEAA1
2022 Quantitative verification with adaptive uncertainty reduction
Naif Alasmari, Radu Calinescu, Colin Paterson, Raffaela Mirandola
J. Syst. Softw.1
2021 Evolutionary-Guided Synthesis of Verified Pareto-Optimal MDP Policies
abstract
We present a new approach for synthesising Paretooptimal Markov decision process (MDP) policies that satisfy complex combinations of quality-of-service (QoS) software requirements. These policies correspond to optimal designs or configurations of software systems, and are obtained by translating MDP models of these systems into parametric Markov chains, and using multi-objective genetic algorithms to synthesise Pareto-optimal parameter values that define the required MDP policies. We use case studies from the service-based systems and robotic control software domains to show that our MDP policy synthesis approach can handle a wide range of QoS requirement combinations unsupported by current probabilistic model checkers. Moreover, for requirement combinations supported by these model checkers, our approach generates better Pareto-optimal policy sets according to established quality metrics.
Simos Gerasimou, Javier Cámara 0001, Radu Calinescu, Naif Alasmari, Faisal Alhwikem, Xinwei Fang
ASE4