Sciweavers

ECOOPW
2000
Springer
13 years 11 months ago
Reflection and Meta-level Architectures: State of the Art and Future Trends
Previous workshops on reflection both in ECOOP and in OOPSLA have pointed out the growing interest and importance of Reflection and Metalevel Architectures in the fields of program...
Walter Cazzola, Shigeru Chiba, Thomas Ledoux
ECOOPW
2000
Springer
13 years 11 months ago
Poster Session
Mireille Blay-Fornarino, Anne-Marie Dery
ECOOPW
1998
Springer
13 years 11 months ago
Providing Automatic Support for Heuristic Rules of Methods
In method-based software development, software engineers create artifacts based on the heuristic rules of the adopted method. Most CASE tools, however, do not actively assist soft...
Bedir Tekinerdogan, Mehmet Aksit
COORDINATION
2000
Springer
13 years 11 months ago
GCCS: A Graphical Coordination Language for System Specification
Abstract. We present GCCS, a graphical coordination language for hierarchical concurrent systems. GCCS, which is implemented in the Concurrency Factory design environment, represen...
Rance Cleaveland, Xiaoqun Du, Scott A. Smolka
COORDINATION
2000
Springer
13 years 11 months ago
A Principled Semantics for inp
Jeremy L. Jacob, Alan M. Wood
COORDINATION
2000
Springer
13 years 11 months ago
OpenSpaces: An Object-Oriented Framework for Reconfigurable Coordination Spaces
Abstract. Tuple spaces have turned out to be one of the most fundamental abstractions for coordinating communicating agents. At the same time, researchers continue to propose new v...
Stéphane Ducasse, Thomas Hofmann, Oscar Nie...
CONCUR
2000
Springer
13 years 11 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
CONCUR
2000
Springer
13 years 11 months ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
CLUSTER
2000
IEEE
13 years 11 months ago
Madeleine II: a Portable and Efficient Communication Library for High-Performance Cluster Computing
This paper introduces MadeleineII, a new adaptive and portable multi-protocol implementation of the Madeleine communication library. MadeleineII has the ability to control multipl...
Olivier Aumage, Luc Bougé, Alexandre Denis,...