Back to Results
First PageMeta Content
Graph connectivity / Diagrams / Models of computation / Directed acyclic graph / Transitive closure / Reachability / Unreachable memory / Model checking / Connected component / Graph theory / Mathematics / Theoretical computer science


Inductively Finding a Reachable State Space Over-Approximation Michael L. Case Alan Mishchenko
Add to Reading List

Document Date: 2006-05-01 16:01:54

Open Document

File Size: 182,42 KB

Share Result on Facebook

City

Cambridge / /

Company

ABC / MIT Press / Vertex / MVSIS Group / /

/

Facility

D. Building / University of California / /

IndustryTerm

logic network / maximum processing time / reachability over-approximation algorithm / overall algorithm / search space / graph algorithms / reachability algorithm / /

MarketIndex

QUALITY / /

MusicGroup

ABC / /

Organization

MIT / UC Berkeley / Reachable State Space Over-Approximation Michael L. Case Alan Mishchenko Robert K. Brayton Department of EECS / University of California / Berkeley / /

Person

Van Eijk / Michael L. Case Alan Mishchenko Robert / /

Position

representative / /

ProvinceOrState

Massachusetts / /

Technology

graph algorithms / overall algorithm / BDD-based reachability algorithm / finite state machine / two graph algorithms / Integrated Circuits / ESULTS Our reachability over-approximation algorithm / reachability algorithm / /

URL

http /

SocialTag