Sciweavers

327 search results - page 65 / 66
» Model Checking and Evidence Exploration
Sort
View
PASTE
2005
ACM
13 years 11 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
IUI
2003
ACM
13 years 11 months ago
Personal choice point: helping users visualize what it means to buy a BMW
How do we know if we can afford a particular purchase? We can find out what the payments might be and check our balances on various accounts, but does this answer the question? Wh...
Andrew E. Fano, Scott W. Kurth
CAV
2003
Springer
188views Hardware» more  CAV 2003»
13 years 9 months ago
Thread-Modular Abstraction Refinement
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 4 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
SIGSOFT
2010
ACM
13 years 3 months ago
Finding latent performance bugs in systems implementations
Robust distributed systems commonly employ high-level recovery mechanisms enabling the system to recover from a wide variety of problematic environmental conditions such as node f...
Charles Edwin Killian, Karthik Nagaraj, Salman Per...