Path Feasibility Analysis for String-Manipulating Programs
- 1 January 2009
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Pex–White Box Test Generation for .NETLecture Notes in Computer Science, 2008
- What Else Is Decidable about Integer Arrays?Lecture Notes in Computer Science, 2008
- A Static Analysis Framework For Detecting SQL Injection VulnerabilitiesIEEE Annual International Computer Software and Applications Conference (COMPSAC), 2007
- CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking ToolsLecture Notes in Computer Science, 2006
- DARTACM SIGPLAN Notices, 2005
- What’s Decidable About Arrays?Lecture Notes in Computer Science, 2005
- Automatic structures: richness and limitationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Precise Analysis of String ExpressionsLecture Notes in Computer Science, 2003
- Coding in the existential theory of concatenationArchive for Mathematical Logic, 1987
- Symbolic execution and program testingCommunications of the ACM, 1976