514 search results - page 21 / 103 » Dependency Analysis of Ada Programs |
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
VISSOFT
2005
IEEE
14 years 29 days ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
SIGSOFT
2010
ACM
13 years 5 months ago
2010
ACM
For `mixed-criticality' systems that have both critical and non-critical functions, the greatest leverage on dependability may be at the design level. By designing so that ea...
ICMT
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In Model-Driven Engineering models and metamodels are not preserved from the evolutionary pressure which inevitably affects almost any artefacts. Moreover, the coupling b...
AAECC
2005
Springer
13 years 7 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...