on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
A fundamental issue in the engineering of coordination models is n coordination abstractions that are correct with respect to the specification of the coordination model they imp...
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
: Fully abstract trace semantics for a core Java language. Alan Jeffrey 1,2 and Julian Rathke3 1 Bell Labs, Lucent Technologies, Chicago, IL, USA 2 DePaul University, Chicago, IL, ...
Abstract. Most test-selection algorithms currently in use with probabilistic networks select variables myopically, that is, test variables are selected sequentially, on a one-by-on...