2018 · 13 citations · 6 references
ComputingComputer ScienceAlgorithmsData StructuresProgramming LanguagesAbstract Syntax TreesControl-flow AnalysisData-flow AnalysisSoftware TestingSymbolic ExecutionAutomated Test GenerationAvl TreesHeap AnalysisSatisfiabilitySeparation LogicSymbolic Execution EnginesTest Case GenerationTest Generation
We present Java StarFinder (JSF), a tool for automated test case generation and error detection for Java programs having inputs in the form of complex heap-manipulating data structures. The core of JSF is a symbolic execution engine that uses separation logic with existential quantifiers and inductively-defined predicates to precisely represent the (unbounded) symbolic heap. The feasibility of a heap configuration is checked by a satisfiability solver for separation logic. At the end of each feasible path, a concrete model of the symbolic heap (returned by the solver) is used to generate a test case, e.g., a linked list or an AVL tree, that exercises that path.
6
Symbolic execution and program testing
James C. King · Communications of the ACM · 1976 · 3K citations · Full text
Separation logic: a logic for shared mutable data structures
John Reynolds · 2003 · 2.2K citations
BI as an assertion language for mutable data structures
Samin Ishtiaq, Peter W. O’Hearn · ACM SIGPLAN Notices · 2011 · 499 citations
BI as an assertion language for mutable data structures
Samin Ishtiaq, Peter W. O’Hearn · 2001 · 281 citations