This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
Discovery of graphical models is NP-hard in general, which justifies using heuristics. We consider four commonly used heuristics. We summarize the underlying assumptions and anal...
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, ...
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...
This paper describes an executable formal semantics of C. Being executable, the semantics has been thoroughly tested against the GCC torture test suite and successfully passes 99....