Treewidth in verification: Local vs. global

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3835 LNAI, Issue , 2005, Pages 489-503

  Ferrara, Andrea ^a   Pan, Guoqiang ^b   Vardi, Moshe Y ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION ANALYSIS; MATHEMATICAL MODELS; PROBLEM SOLVING; TOPOLOGY;

MODEL CHECKING; STATE TRANSITION SYSTEMS; TREEWIDTH BOUNDEDNESS;

TREES (MATHEMATICS);

EID: 33745459177     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_34     Document Type: Conference Paper

References (29)

1. A. Atserias, P.G. Kolaitis, and Moshe Y. Vardi. Constraint propagation as a proof system. In CP 2004, pages 77-91, 2004.
2. I. Beer, S. Ben-David, D. Geist, R. Gewirtzman, and M. Yoeli. Methodology and system for practical formal verification of reactive hardware. In Proc. 6th Conf. on Computer Aided Verification, pages 182-193, Stanford, June 1994.
3. A. Biere, A. Cimatti, E.M Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In DAC 1999, pages 317-320, 1999.
4. P. Bjesse, J.H. Kukula, R.F. Damiano, T. Stanion, and Y. Zhu. Guiding sat diagnosis with tree decompositions. In SAT 2003, volume 2919 of LNCS, pages 315-329. Springer, 2004.
5. H.L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1-23, 1993.
6. H.L. Bodlaender. Treewidth: Algorithmic techniques and results. In Igor Prívara and Peter Ruzicka, editors, Proc. 22nd Int. Symp. MFCS, LNCS 1295. Springer, 1997.
7. H.L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Technical report, Universiteit Utrecht, 1998.
8. R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans. on Computers, C-35(8), 1986.
9. R.E. Bryant. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Transaction on Computers, 40(2):205-213, February 1991.
10. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT Press, 2000.
11. R. Dechter and J. Pearl. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34:1-38, 1987.
12. R. Diestel. Graph Theory. Number 173 in Graduate Texts in Mathematics. Springer, 2000.
13. E.A. Emerson and J.Y Halpern. Sometimes and not never revisited: On the branching versus linear time. Journal of the ACM, 33(1):151-178, 1986.
14. E.C Freuder. Complexity of k-tree structured constraint satisfaction problems. In Proc. AAA1-90, pages 4-9, 1990.
15. G. Gottlob and R. Pichler. Hypergraphs in model checking: Acyclicity and hypertrce-width versus clique-width. SIAM Journal on Computing, 33(2):351-378, 2004.
16. D. Harel, O. Kupferman, and M.Y. Vardi. On the complexity of verifying concurrent transition systems. Information and Computation, 173(2): 143-161, 2002.
17. J. Huang and A. Darwiche. Using DPLL for efficient OBDD construction. In Proc. 7th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT 2004), 2004.
18. M. Jurdziński. Deciding the winner in partity games is in UP ∩ co-UP. Information Processing Letters, 68:119-124, 1998.
19. O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of ACM, 47(2):312-360, 2000.
20. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
21. R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd Int. Joint Conf. on Artif. Int., pages 481-489. British Computer Society, September 1971.
22. J. Obdržálek. Fast mu-calculus model checking when tree-width is bounded. In CAV'03, volume 2725 of LNCS, pages 80-92. Springer, 2003.
23. M.R. Prasad, P. Chong, and K. Keutzer. Why is ATPG easy? In Proc. of 36th ACM/IEEE conference on Design automation, pages 22-28. ACM Press, 1999.
24. A.N. Prior. Past, Present, and Future. Clarendon Press, Oxford, 1967.
25. N. Robertson and P.D. Seymour. Graph minors. i. excluding a forest. Journal of Combinatorial Theory Series B, 35:39-61, 1983.
26. N. Robertson and P.D. Seymour. Graph minors. ii. algorithmic aspects of treewidth. Journal of Algorithms, 7:309-322, 1986.
27. T. Schiex. A note on CSP graph parameters. Technical Report 1999/03, INRIA, 1999.
28. D.M. Thilikos, M.J. Serna, and H.L. Bodlaender. A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. In ESA'0I, volume 2161 of LNCS, pages 380-390. Springer, 2001.
29. D. Wang, E.M. Clarke, Y. Zhu, and J. Kukula. Using cutwidth to improve symbolic simulation and boolean satisfiability. In IEEE International High Level Design Validation and Test Workshop (HLDVT2001), page 6, 2001.