Sciweavers

1550 search results - page 144 / 310
» Benchmarking for Graph Transformation
Sort
View
128
Voted
ECEASST
2006
103views more  ECEASST 2006»
15 years 3 months ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco
117
Voted
SCAM
2008
IEEE
15 years 9 months ago
User-Input Dependence Analysis via Graph Reachability
Bug-checking tools have been used with some success in recent years to find bugs in software. For finding bugs that can cause security vulnerabilities, bug checking tools requir...
Bernhard Scholz, Chenyi Zhang, Cristina Cifuentes
DAC
2009
ACM
16 years 4 months ago
Mode grouping for more effective generalized scheduling of dynamic dataflow applications
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
William Plishker, Nimish Sane, Shuvra S. Bhattacha...
123
Voted
DAC
2006
ACM
16 years 4 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
110
Voted
WWW
2004
ACM
16 years 4 months ago
Towards the composition of Ad Hoc B2B Applications: Semantics, Properties and Complexity Management
The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
Jaime Delgado, Rosa Gil, Zièd Choukair