390 search results - page 37 / 78 » Using Graph Transformations and Graph Abstractions for Softw... |
139
click to vote
LCPC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
154
click to vote
FOSSACS
2006
Springer
15 years 6 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
212
Voted
POPL
2005
ACM
16 years 2 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
175
Voted
AGTIVE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In runtime monitoring, a programmer specifies code to execute whenever a sequence of events occurs during program execution. Previous and related work has shown that runt...
126
click to vote
TC
1998
15 years 1 months ago
1998
ion Techniques for Validation Coverage Analysis and Test Generation Dinos Moundanos, Jacob A. Abraham, Fellow, IEEE, and Yatin V. Hoskote —The enormous state spaces which must be...