TO
1 - 25 of 4
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 1 |
 | Gopalakrishnan, Ganesh | Bounded transaction model checking | Industrial cache coherence protocol models often have too many reachable states, preventing full reachability analysis even for small model instances (number of processors, addresses, etc.). Several partial search debugging methods are, therefore, employed, including lossy state compression using... | Model checking; Reachability analysis | 2006-02-27 |
| 2 |
 | Gopalakrishnan, Ganesh | Precision on demand: an improvement in probabilistic hashing | In explicit state (enumerative) model checking, state vectors are often represented in a compressed form in order to reduce storage needs, typically employing fingerprints, bithashes, or state signatures. When using this kind of techniques, it could happen that the compressed image of a nonvisite... | Probabilistic hashing; Model checking | 2007 |
| 3 |
 | Sivaraj, Hemanthkumar; Gopalakrishnan, Ganesh | Random walk based heuristic algorithms for distributed memory model checking | Model checking techniques suffer from the state space explosion problem: as the size of the system being verified increases, the total state space of the system increases exponentially. Some of the methods that have been devised to tackle this problem are partial order reduction, symmetry reducti... | Model checking; Distributed memory | 2003-01-29 |
| 4 |
 | Gopalakrishnan, Ganesh | Refactoring SPIN for safety | We show how to refactor SPIN for safety model checking resulting in a compact model checker occupying less than 200 lines of code without appreciable loss of performance while reusing much of SPIN?s front-end facilities. In addition to being far easier to understand and being eminently suitable a... | Model checking; SPIN | 2006-02-14 |
1 - 25 of 4