Computing vertex eccentricity in exponentially large graphs: QBF formulation and solution

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

Volumn 2919, Issue , 2004, Pages 411-425

  Mneimneh, Maher ^a   Sakallah, Karem ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATION THEORY; EMBEDDED SYSTEMS; GRAPH THEORY;

DECISION PROBLEMS; EXPERIMENTAL ANALYSIS; EXPERIMENTAL EVIDENCE; GRAPH TRANSFORMATION; HARDWARE VERIFICATION; QUANTIFIED BOOLEAN FORMULAS; SAT-BASED DECISION PROCEDURE; WORST-CASE BEHAVIORS;

BOOLEAN ALGEBRA;

EID: 35048870576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_31     Document Type: Article

References (18)

1. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu, "Symbolic Model Checking Using SAT Procedures instead of BDDs," in Proceedings of the 36th Design Automation Conference, 1999.
2. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, "Symbolic Model Checking without BDDs," in TACAS'99, 1999.
3. R. E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," in IEEE Transactions on Computers, 35(8), pp. 677-691, August 1986.
4. B. V. Cherkassky, A. V. Goldberg, and T. Radzik, "Shortest Paths Algorithms: Theory and Experimental Evaluation," in SODA: ACM-SIAM Symposium on Discrete Algorithms, 1993.
5. M. Labbe, D. Peeters, and J. -F Thisse, "Location on Networks," in Handbooks in OR & MS, North-Holland, pp. 551-624, 1995.
6. J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill, "Symbolic Model Checking for Sequential Circuit Verification," in IEEE Transactions on Computer-Aided Design of Integrated Circuits 13(4), pp. 401-424, April 1994.
7. E. M. Clarke, E. A. Emerson, and A. P. Sistla, "Automatic Verification of Finite-state Concurrent Systems Using Temporal Logic Specifications," in ACM Transactions on Programming Languages and Systems, 8(2), pp. 244-263, 1986.
8. H. Galperin and A. Wigderson, "Succinct Representations of Graphs," in Information and Control, 56, 1983.
9. E. Giunchiglia, M. Narizzano, and A. Tacchella, "System Description: QuBE A System for Deciding Quantified Boolean Formulas Satisfiability," in Proceedings of the International Joint Conference on Automated Reasoning, 2001.
10. A. Gupta, Z. Yang, P. Ashar, L. Zhang, and S. Malik, "Partition- Based Decision Heuristics for Image Computation Using SAT and BDDs," in Proceedings of the International Conference on Computer-Aided Design, 2001.
11. D. Kroening, and O. Strichman, "Efficient Computation of Recurrence Diameters," in 4th International Conference on Verification, Model Checking, and Abstract Interpretation, 2003.
12. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT solver," in Proceedings of the Design Automation Conference, 2001.
13. C. Papadimitriou and M. Yannakakis, "A Note on Succinct Representations of Graphs," in Information and Control, 71, 1986.
14. D. A. Plaisted, A. Biere, and Y. Zhu, "A Satisfiability Procedure for Quantified Boolean Formulae," submitted for publication, Discrete Applied Mathematics.
15. J. Rintanen, "Improvements to the Evaluation of Quantified Boolean Formulae," Proceedings of the 16th Intemational Joint Conference on Artificial Intelligence, pp. 1192-1197, August, 1999.
16. M. Sheeran, S. Singh, and G. Stalmarck, "Checking Safety Properties Using Induction and a SAT-solver," in Formal Methods in Computer Aided Design, 2000
17. L. Zhang, and S. Malik, "Conflict Driven Learning in a Quantified Boolean Satisfiability Solver," Proceedings of the International Conference on Computer Aided Design (ICCAD2002), 2002.
18. C.-C. Yen, K.-C Chen, and J.-Y. Jou, "A Practical Approach to Cycle Bound Estimation for Property Checking," in 11th IEEE/ACM International Workshop on Logic Synthesis, pp. 149-154, June 2002.