Skip to main navigation
Skip to search
Skip to main content
Boise State University Home
Search content at Boise State University
Home
Profiles
Research units
Equipment
Projects
Research output
Datasets
Prizes
Activities
Press/Media
Minimizing the Size of Path Conditions Using Convex Polyhedra Abstract Domain
Justin Lloyd
,
Elena Sherman
Computer Science Department
Boise State University
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Minimizing the Size of Path Conditions Using Convex Polyhedra Abstract Domain'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Abstract Domains
100%
Path Condition
100%
Convex Polyhedron
100%
Symbolic Execution
71%
Program Path
28%
Polyhedron
28%
Program Analysis
14%
Additional Time
14%
Constraint Set
14%
Path Sensitive
14%
Program Execution
14%
Linear Constraints
14%
Symbolic Input
14%
Constraint Solver
14%
Program Verification
14%
Redundant Constraints
14%
Parma
14%
Computer Science
Convex Polyhedron
100%
Symbolic Execution
100%
Analysis Technique
20%
Constraint Solver
20%
Program Verification
20%
Program Analysis
20%
Redundant Constraint
20%
Program Execution
20%
Linear Constraint
20%