2012
DOI: 10.3724/sp.j.1001.2012.04196
|View full text |Cite
|
Sign up to set email alerts
|

Path Sensitive Program Verification Based on SMT Solvers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2014
2014

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 1 publication
0
1
0
Order By: Relevance
“…In the stage of compressing circular paths, we consider the maximal strongly connected components as compressed objects to obtain the compressed control flow graph. The maximal strongly connected component is defined in [11], and we replace it with one abstract node to compress the CFG under the rules as follows:…”
Section: B Compressing Circular Pathsmentioning
confidence: 99%
“…In the stage of compressing circular paths, we consider the maximal strongly connected components as compressed objects to obtain the compressed control flow graph. The maximal strongly connected component is defined in [11], and we replace it with one abstract node to compress the CFG under the rules as follows:…”
Section: B Compressing Circular Pathsmentioning
confidence: 99%