Sciweavers

445 search results - page 15 / 89
» A Call Abstraction for Component Coordination
Sort
View
MEMOCODE
2005
IEEE
14 years 2 months ago
Extended abstract: a race-free hardware modeling language
We describe race-free properties of a hardware description language called GEZEL. The language describes networks of cycle-true finite-state-machines with datapaths (FSMDs). We de...
Patrick Schaumont, Sandeep K. Shukla, Ingrid Verba...
KBSE
2007
IEEE
14 years 2 months ago
Finding errors in components that exchange xml data
Two or more components (e.g., objects, modules, or programs) interoperate when they exchange data, such as XML data. Using Application Programming Interface (API) calls exported b...
Mark Grechanik
PROCEDIA
2010
66views more  PROCEDIA 2010»
13 years 7 months ago
Parallel signal processing with S-Net
We argue that programming high-end stream-processing applications requires a form of coordination language that enables the designer to represent interactions between stream-proce...
Frank Penczek, Stephan Herhut, Clemens Grelck, Sve...
MOC
2002
86views more  MOC 2002»
13 years 8 months ago
An algorithm for finding all preprojective components of the Auslander-Reiten quiver
Abstract. The Auslander-Reiten quiver of a finite-dimensional associative algebra A encodes information about the indecomposable finite-dimensional representations of A and their h...
Peter Dräxler, Klara Kögerler
FATES
2005
Springer
14 years 2 months ago
A Novel Test Coverage Metric for Concurrently-Accessed Software Components
We propose a novel, practical coverage metric called “location pairs” (LP) for concurrently-accessed software components. The LP metric captures well common concurrency errors ...
Serdar Tasiran, Tayfun Elmas, Guven Bolukbasi, M. ...