Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Program analysis via satisfiability modulo path programs
William R. Harris
, Sriram Sankaranarayanan
, Franjo Ivaňcíc
,
Aarti Gupta
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
11
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Program analysis via satisfiability modulo path programs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Abstract Interpretation
10%
Blocked Clauses
10%
C Program
10%
Correctness Proofs
10%
Efficient Enumeration
10%
Multiple Paths
10%
Oracle
10%
Path Programs
100%
Path Sensitive
10%
Path Sensitivity
10%
Path-based
10%
Performance Improvement
10%
Program Analysis
100%
Program Verification
10%
Proof-based
10%
Safety Properties
10%
SAT Formulas
20%
Satisfiability Modulo Theories
10%
Soft Program
10%
Sufficient Set
10%
Symbolic Execution
10%
Verification Framework
10%
Computer Science
Abstract Interpretation
50%
Analysis Technique
50%
C Program
50%
Program Analysis
100%
Program Verification
50%
Symbolic Execution
50%