Timing Analysis of Parallel Software Using Abstract Execution
Abstract elided by the publisher.
642 papers · page 16 of 33
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
We present a method for the synthesis of polynomial lasso programs. These programs consist of a program stem, a set of transitions, and an exit condition, all in the form of algebraic assertions conjunctions of polynomial equalities. Central to this approach is the discovery of n…
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
One problem with the constraint-based approaches to synthesis that have become popular over the last few years is that they only scale to relatively small routines, on the order of a few dozen lines of code. This paper presents a mechanism for modular reasoning that allows us to …
In this paper we study strong and weak bisimulation equivalences for continuous-time Markov decision processes CTMDPs and the logical characterizations of these relations with respect to the continuous-time stochastic logic CSL. For strong bisimulation, it is well known that it i…
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.