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
  Ganty, Pierre Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 2 of 2 reviews    
  Pattern-based verification for multithreaded programs
Esparza J., Ganty P., Poch T. ACM Transactions on Programming Languages and Systems 36(3): 1-29, 2014.  Type: Article

The verification of some program properties via model checking has matured in recent years for sequential programming. However, for multithreaded programming, an area becoming ever more important, several complexity-theory-related ques...
...
Nov 19 2014  
  Parikh’s theorem: a simple and direct automaton construction
Esparza J., Ganty P., Kiefer S., Luttenberger M. Information Processing Letters 111(12): 614-619, 2011.  Type: Article

As the title promises, the construction given by the authors is, indeed, quite simple and direct. For any context-free grammar G, their method can be easily applied to “construct a nondeterministic finite a...
...
Oct 31 2011  

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