On temporal path conditions in dependence graphs
- 19 February 2009
- journal article
- research article
- Published by Springer Nature in Automated Software Engineering
- Vol. 16 (2) , 263-290
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A new foundation for control dependence and slicing for modern program structuresACM Transactions on Programming Languages and Systems, 2007
- Efficient path conditions in dependence graphs for software safety analysisACM Transactions on Software Engineering and Methodology, 2006
- Path-Sensitive Dataflow Analysis with Iterative RefinementLecture Notes in Computer Science, 2006
- A Theorem Proving Approach to Analysis of Secure Information Flow2005
- Language-based information-flow securityIEEE Journal on Selected Areas in Communications, 2003
- ESPACM SIGPLAN Notices, 2002
- NuSMV: A New Symbolic Model Verifier1999
- Conditioned program slicingInformation and Software Technology, 1998
- Combining slicing and constraint solving for validation of measurement softwareLecture Notes in Computer Science, 1996
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991