Back to Results
First PageMeta Content
Tree decomposition / Path decomposition / Width / Boolean satisfiability problem / Graph theory / Theoretical computer science / Graph operations


Treewidth in Verification: Local vs. Global⋆ Andrea Ferrara1 , Guoqiang Pan2 , and Moshe Y. Vardi2 1 DIS - Universit`a di Roma ”La Sapienza” Via Salaria 113, 00198 Roma, Italy
Add to Reading List

Document Date: 2005-09-30 15:47:37

Open Document

File Size: 166,34 KB

Share Result on Facebook

City

Roma / /

Company

CNF / Intel Corporation / /

/

Facility

Rice University / /

IndustryTerm

satisfiability algorithm / paper concurrent transition systems / typical model-checking algorithms / state transition systems / concurrent systems / graphs underlying systems / real-world systems / concurrent transition systems / transition systems / /

Organization

Rice University / National Science Foundation / /

Technology

DPLL-based satisfiability algorithm / av / typical model-checking algorithms / simulation / OBDD-based algorithms / /

SocialTag