17 search results - page 1 / 4 » A Theory of Slicing for Probabilistic Control Flow Graphs |
SIGSOFT
2003
ACM
14 years 5 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...
RELMICS
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. As part of a larger project, we have built a declarative assembly language that enables us to specify multiple code paths to compute particular quantities, giving the ins...
APLAS
2001
ACM
13 years 8 months ago
2001
ACM
Exception analyses so far cannot provide information on the propagation of thrown exceptions, which is necessary to construct interprocedural control flow graph, visualize exceptio...
ICSE
2004
IEEE-ACM
14 years 4 months ago
2004
IEEE-ACM
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
IEEECIT
2010
IEEE
13 years 2 months ago
2010
IEEE
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...