When a software system enters the maintenance phase, the availability of accurate and consistent information about its organization can help alleviate the difficulties of program...
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for ...
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
The NPAC kernel runtime, developed in the PCRC Parallel Compiler Runtime Consortium project, is a runtime library with special support for the High Performance Fortran data model....
Bryan Carpenter, Geoffrey Fox, Donald Leskiw, Xiao...