Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Reasoning About the Unknown in Static Analysis Isil Dillig Thomas Dillig Alex Aiken
 

Summary: Reasoning About the Unknown in Static Analysis
Isil Dillig Thomas Dillig Alex Aiken
{isil, tdillig, aiken}@cs.stanford.edu
Computer Science Department
Stanford University
ABSTRACT
Static program analysis techniques cannot know certain val-
ues, such as the value of user input or network state, at anal-
ysis time. While such unknown values need to be treated as
non-deterministic choices made by the program's execution
environment, it is still possible to glean very useful infor-
mation about how such statically unknown values may or
must influence computation. We give a method for integrat-
ing such non-deterministic choices with an expressive static
analysis. Interestingly, we cannot solve the resulting recur-
sive constraints directly, but we give an exact method for
answering all may and must queries. We show experimen-
tally that the resulting solved forms are concise in practice,
enabling us to apply the technique to very large programs,
including an entire operating system.

  

Source: Aiken, Alex - Department of Computer Science, Stanford University

 

Collections: Computer Technologies and Information Sciences