23 citations · 43 across the 10 of their papers we have counts for
10 papers
A Decision Tree Lifted Domain for Analyzing Program Families with Numerical Features (Extended Version)
Aleksandar S. Dimovski, Sven Apel, Axel Legay
Lifted (family-based) static analysis by abstract interpretation is capable of analyzing all variants of a program family simultaneously, in a single run without generating any of…
Prediction of Horizontal Data Partitioning Through Query Execution Cost Estimation
Nino Arsov, Goran Velinov, Aleksandar S. Dimovski +3
The excessively increased volume of data in modern data management systems demands an improved system performance, frequently provided by data distribution, system scalability and…
Variability Abstraction and Refinement for Game-based Lifted Model Checking of full CTL (Extended Version)
Aleksandar S. Dimovski, Axel Legay, Andrzej Wasowski
Variability models allow effective building of many custom model variants for various configurations. Lifted model checking for a variability model is capable of verifying all its…
Verification of High-Level Transformations with Inductive Refinement Types
Ahmad Salim Al-Sibahi, Thomas P. Jensen, Aleksandar S. Dimovski +1
High-level transformation languages like Rascal include expressive features for manipulating large abstract syntax trees: first-class traversals, expressive pattern matching, backt…
Abstract Family-based Model Checking using Modal Featured Transition Systems: Preservation of CTL* (Extended Version)
Aleksandar S. Dimovski
Variational systems allow effective building of many custom variants by using features (configuration options) to mark the variable functionality. In many of the applications, thei…
Probabilistic Analysis Based On Symbolic Game Semantics and Model Counting
Aleksandar S. Dimovski
Probabilistic program analysis aims to quantify the probability that a given program satisfies a required property. It has many potential applications, from program understanding a…
Effective Analysis of C Programs by Rewriting Variability
Alexandru Florin Iosif-Lazar, Jean Melo, Aleksandar S. Dimovski +2
Context. Variability-intensive programs (program families) appear in many application areas and for many reasons today. Different family members, called variants, are derived by sw…
Variability Abstractions: Trading Precision for Speed in Family-Based Analyses (Extended Version)
Aleksandar S. Dimovski, Claus Brabrand, Andrzej Wąsowski
Family-based (lifted) data-flow analysis for Software Product Lines (SPLs) is capable of analyzing all valid products (variants) without generating any of them explicitly. It takes…
Slot Games for Detecting Timing Leaks of Programs
Aleksandar S. Dimovski
In this paper we describe a method for verifying secure information flow of programs, where apart from direct and indirect flows a secret information can be leaked through covert t…
Symbolic Representation of Algorithmic Game Semantics
Aleksandar S. Dimovski
In this paper we revisit the regular-language representation of game semantics of second-order recursion free Idealized Algol with infinite data types. By using symbolic values ins…