Learn More
An implementation-oriented algorithm for <italic>lazy code motion</italic> is presented that minimizes the number of computations in programs while suppressing any unnecessary code motion in order to avoid superfluous register pressure. In particular, this variant of the original algorithm for lazy code motion works on flowgraphs whose nodes are basic(More)
The Concurrency Workbench is an automated tool for analyzing networks of finite-state processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its breadth: a variety of different verification methods, including equivalence checking, preorder checking, and model checking, are supported for several different process semantics. One(More)
We i n troduce three models of probabilistic processes, namely, reactive, generative and stratiied. These models are investigated within the context of PCCS, an extension of Milner's SCCS in which each summand of a process summation expression is guarded by a probability and the sum of these probabilities is 1. For each model we present a structural(More)
We present a bit-vector algorithm for the <i>optimal</i> and <i>economical</i> placement of computations within flow graphs, which is as <i>efficient</i> as standard uni-directional analyses. The point of our algorithm is the <i>decomposition</i> of the bi-directional structure of the known placement algorithms into a sequence of a backward and a forward(More)
In this paper, we present the LearnLib, a library of tools for automata learning, which is explicitly designed for the systematic experimental analysis of the profile of available learning algorithms and corresponding optimizations. Its modular structure allows users to configure their own tailored learning scenarios, which exploit specific properties of(More)
We present a complete solution of the RPC-Memory Spec-iication Problem, by applying a constraint-oriented state-based proof methodology for concurrent software systems. Our methodolgy exploits compositionality and abstraction for the reduction of the veriication problem under investigation. Formal basis for this methodology are Modal Transition Systems(More)
We develop a model-checking algorithm for a logic that permits propositions to be deened using greatest and least xed points of mutually recursive systems of equations. This logic is as expressive as the alternation-free fragment of the modal mu-calculus identiied by Emerson and Lei, and it may therefore be used to encode a number of temporal logics and(More)