Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Kesten, Yonit Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 2 of 2 reviews    
  Model checking with strong fairness
Kesten Y., Pnueli A., Raviv L., Shahar E. Formal Methods in System Design 28(1): 57-84, 2006.  Type: Article

Classical model checking methods for temporal logic formulas suffer from the problem of unsatisfactory treatment of fairness—only a weak form of fairness, “justice,” is directly addressed. &...
...
Nov 23 2006  
  Verification by augmented finitary abstraction
Kesten Y., Pnueli A. Information and Computation 163(1): 203-243, 2000.  Type: Article

The potentially infinite variation in the behavior of reactive systems means that finite-state techniques used with terminating programs may not be utilized directly. Verification by Finitary Abstraction (VFA) is a proof method for the...
...
Feb 1 2002  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy