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
Decidable verification of uninterpreted programs
Umang Mathur
,
P. Madhusudan
,
Mahesh Viswanathan
Siebel School of Computing and Data Science
Electrical and Computer Engineering
Information Trust Institute
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Decidable verification of uninterpreted programs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Program Use
100%
P-space
100%
Ghosts
100%
Function Call
100%
Loop Invariants
100%
Undecidable
100%
Verification Problem
100%
Recursive Functions
100%
Undecidability
100%
Constant Function
100%
Uninterpreted Programs
100%
Quantifier Free Formula
100%
Computer Science
Data Model
100%
Postcondition
100%
Subclasses
100%
Constant Function
100%
Recursive Function Call
100%
Invariant
100%