Sciweavers

4074 search results - page 770 / 815
» Abstract Graph Transformation
Sort
View
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
15 years 3 months ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
FCCM
1997
IEEE
199views VLSI» more  FCCM 1997»
15 years 2 months ago
The RAW benchmark suite: computation structures for general purpose computing
The RAW benchmark suite consists of twelve programs designed to facilitate comparing, validating, and improving reconfigurable computing systems. These benchmarks run the gamut o...
Jonathan Babb, Matthew Frank, Victor Lee, Elliot W...
DAC
1994
ACM
15 years 2 months ago
A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
Gjalt G. de Jong, Bill Lin
ICSE
2000
IEEE-ACM
15 years 1 months ago
Testing levels for object-oriented software
One of the characteristicsof object-oriented software is the complex dependency that may exist between classes due to inheritance, association and aggregation relationships. Hence...
Yvan Labiche, Pascale Thévenod-Fosse, H&eac...
AI
2007
Springer
14 years 10 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne