We have presented a novel technique combining three standard methods: specification of errors with state machines, slicing, and symbolic execution. We currently do not know about any technique combining arbitrary two of the three methods. We have di…

We introduce a novel technique for finding real errors in programs. The technique is based on a synergy of three well-known methods: metacompilation,…

The graph crossing number problem, cr(G)<=k, asks for a drawing of a graph G in the plane with at most k edge crossings. Although this problem is in …

In this paper we present a tool that performs CUDA accelerated LTL Model Checking. The tool exploits parallel algorithm MAP adjusted to the NVIDIA CU…

Let $G$ be a connected planar (but not yet embedded) graph and $F$ a set of additional edges not yet in $G$. The {multiple edge insertion} problem (M…

The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural q…

The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper w…

We study the problem of colouring the vertices of a polygon, such that every viewer can see a unique colour. The goal is to minimize the number of co…

We study the complexity of central controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize both the expected mean-payoff performance of the system and its stability. We argue that the basic theo…

We study the complexity of central controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize both …

When studying multi-body protein complexes, biochemists use computational tools that can suggest hundreds or thousands of their possible spatial conf…

This report proposes a novel framework for a rigorous robustness analysis of stochastic biochemical systems. The technique is based on probabilistic …

Path-width of matroids naturally generalizes better known path-width of graphs, and is NP-hard by a reduction from the graph case. While the term mat…

We overview current problems of audio retrieval and time-series subsequence matching. We discuss the usage of subsequence matching approaches in audi…

In various areas of computer science, e.g. requirements analysis, software development, or formal verification, we deal with a set of constraints/req…

We close with several open problems we consider interesting and promising.

Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, invol…

It is well known that the classification of pure multiparticle entangled states according to stochastic local operations leads to a natural classific…

We presented algorithm computing for a given target program location the necessary condition apc representing an over-approximated set of real program paths leading to the target. We proposed the use of apc in tests generation tools based on symboli…

We present a symbolic-execution-based algorithm that for a given program and a given program location produces a nontrivial necessary condition on in…

We are designing and developing a web user interface for digital mathematics libraries called WebMIaS. It allows queries to be expressed by mathemati…

We consider the problem of computing the value and an optimal strategy for minimizing the expected termination time in one-counter Markov decision processes. Since the value may be irrational and an optimal strategy may be rather complicated, we con…

We consider the problem of computing the value and an optimal strategy for minimizing the expected termination time in one-counter Markov decision pr…

Cyber defence exercises are intensive, hands-on learning events for teams of professionals who gain or develop their skills to successfully prevent a…

Our proof of the existence of an optimal defender’s strategy (Theorem 2.1) does not allow to conclude anything about the structure of optimal strategies. One is tempted to expect that optimal strategies are in some sense “regular” and require only f…

Patrolling is one of the central problems in operational security. Formally, a patrolling problem is specified by a set $U$ of nodes (admissible defe…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account