TCS
2016
8 years 18 days ago
2016
Abstract. The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, w...
STTT
2016
8 years 18 days ago
2016
This paper considers a generic approach to runtime verification of temporal properties over firstorder theories. This allows especially for the verification of multi-threaded, o...
STTT
2016
8 years 18 days ago
2016
Abstract. This paper is a tutorial on how to model hybrid systems as hybrid programs in differential dynamic logic and how to prove complex properties about these complex hybrid s...
STTT
2016
8 years 18 days ago
2016
Abstract Exploration of design alternatives and estimation of their key performance metrics such as latency and energy consumption is essential for making the proper design decisio...
STTT
2016
8 years 18 days ago
2016
Abstract. Due to the increasing complexity of software systems, there is a growing need for automated and scalable software synthesis and analysis. In the last decade, active resea...
STACS
2016
Springer
8 years 18 days ago
2016
Springer
Cost register automata (CRA) and its subclass, copyless CRA, were recently proposed by Alur et al. as a new model for computing functions over strings. We study structural propert...
STACS
2016
Springer
8 years 18 days ago
2016
Springer
STACS
2016
Springer
8 years 18 days ago
2016
Springer
It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even ho...
STACS
2016
Springer
8 years 18 days ago
2016
Springer
Catalytic computation, defined by Buhrman, Cleve, Koucký, Loff and Speelman (STOC 2014), is a space-bounded computation where in addition to our working memory we have an expon...
STACS
2016
Springer
8 years 18 days ago
2016
Springer
In this paper, we compare the strength of the semantic and syntactic version of the cutting planes proof system. First, we show that the lower bound technique of [22] applies also...