Sciweavers

390 search results - page 29 / 78
» Using Graph Transformations and Graph Abstractions for Softw...
Sort
View
APCCM
2009
13 years 9 months ago
Extracting Conceptual Graphs from Japanese Documents for Software Requirements Modeling
A requirements analysis step plays a significant role on the development of information systems, and in this step we various kinds of abstract models of the systems (called requir...
Ryo Hasegawa, Motohiro Kitamura, Haruhiko Kaiya, M...
GD
1995
Springer
14 years 7 days ago
Graph Layout Adjustment Strategies
Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightn...
Margaret-Anne D. Storey, Hausi A. Müller
ESEC
1997
Springer
14 years 25 days ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
DAC
1995
ACM
14 years 7 days ago
Rephasing: A Transformation Technique for the Manipulation of Timing Constraints
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...
Miodrag Potkonjak, Mani B. Srivastava
WEA
2007
Springer
111views Algorithms» more  WEA 2007»
14 years 2 months ago
Vertex Cover Approximations on Random Graphs
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
Eyjolfur Asgeirsson, Clifford Stein