Precise interprocedural dataflow analysis via graph reachability
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic predicate abstraction of C programs
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Bebop: a path-sensitive interprocedural dataflow engine
PASTE '01 Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
ESP: path-sensitive program verification in polynomial time
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
A BDD-Based Model Checker for Recursive Programs
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Insider and Ousider Threat-Sensitive SQL Injection Vulnerability Analysis in PHP
WCRE '06 Proceedings of the 13th Working Conference on Reverse Engineering
Thorough static analysis of device drivers
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Finding security vulnerabilities in java applications with static analysis
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
Extraction of Inter-procedural Simple Role Privilege Models from PHP Code
WCRE '09 Proceedings of the 2009 16th Working Conference on Reverse Engineering
| Hi-index | 0.00 |
A new representation for inter-procedural analysis is presented. The representation only uses regular graph theory with guarded edges and variables for easy integration with model checkers but is limited to binary lattice inter-procedural analysis only. A simple inter-procedural problem is presented here with a description of the control flow graph associated. Construction of the graph automaton for model checking is described using graph rewriting rules applied on the control flow graph. Further research and possible extensions are reported.