Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
Making numerical program analysis fast
Gagandeep Singh
, Markus Püschel
, Martin Vechev
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Making numerical program analysis fast'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Static Analysis
100%
Numerical Program Analysis
100%
Static Analyzer
66%
Numerical Abstract Domains
66%
Popular
33%
Optimization Techniques
33%
Optimization Approach
33%
High Efficiency
33%
Performance Optimization
33%
Linear Algebra
33%
Actual Performance
33%
Performance Benefits
33%
Practical Applicability
33%
Disjointness
33%
Program Analysis
33%
Array Bounds
33%
Locality of Reference
33%
C Library
33%
Numerical Domains
33%
Online Decomposition
33%
Scalar Replacement
33%
Computer Science
Program Analysis
100%
Static Program Analysis
100%
Optimization Technique
33%
Operation Count
33%
Vectorization
33%
Performance Optimization
33%
Fundamental Component
33%
Actual Performance
33%
Numerical Domain
33%
Scalar Replacement
33%