Algebraic specification
Efficiently computing static single assignment form and the control dependence graph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint-Based Automatic Test Data Generation
IEEE Transactions on Software Engineering
Constraint logic programming: selected research
Constraint logic programming: selected research
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Identifying loops using DJ graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
Automatic test data generation using constraint solving techniques
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Term rewriting and all that
Automated test data generation using an iterative relaxation method
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Constraint-based array dependence analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Undecidability of context-sensitive data-dependence analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Combining Slicing and Constraint Solving for Validation of Measurement Software
SAS '96 Proceedings of the Third International Symposium on Static Analysis
A Comparative Study of Two Whole Program Slicers for C
A Comparative Study of Two Whole Program Slicers for C
Proceedings of the 5th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Slicing, Chopping, and Path Conditions with Barriers
Software Quality Control
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Dynamic path conditions in dependence graphs
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
From daikon to agitator: lessons and challenges in building a commercial tool for developer testing
Proceedings of the 2006 international symposium on Software testing and analysis
Proceedings of the 5th international conference on Generative programming and component engineering
Efficient path conditions in dependence graphs for software safety analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Subsumption of program entities for efficient coverage and monitoring
Proceedings of the 3rd international workshop on Software quality assurance
Predicting vulnerable software components
Proceedings of the 14th ACM conference on Computer and communications security
Static path conditions for Java
Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security
Automatic documentation inference for exceptions
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Effective blame for information-flow violations
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
On temporal path conditions in dependence graphs
Automated Software Engineering
A new elimination-based data flow analysis framework using annotated decomposition trees
CC'07 Proceedings of the 16th international conference on Compiler construction
Automatically documenting program changes
Proceedings of the IEEE/ACM international conference on Automated software engineering
Model extraction using context information
MoDELS'06 Proceedings of the 9th international conference on Model Driven Engineering Languages and Systems
Synthesizing API usage examples
Proceedings of the 34th International Conference on Software Engineering
| Hi-index | 0.00 |
Program slicing combined with constraint solving is a powerful tool for software analysis. Path conditions are generated for a slice or chop, which --- when solved for the input variables --- deliver compact "witnesses" for dependences or illegal influences between program points.In this contribution we show how to make path conditions work for large programs. Aggressive engineering, based on interval analysis and BDDs, is shown to overcome the potential combinatoric explosion. Case studies and empirical data will demonstrate the usefulness of path conditions for practical program analysis.