Efficient multiple-valued model-checking using lattice representations

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

Volumn 2154, Issue , 2001, Pages 441-455

  Chechik, Marsha ^a   Devereux, Benet ^a   Easterbrook, Steve ^a   Lai, Albert Y C ^a   Petrovykh, Victor ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

LATTICE THEORY; MODEL CHECKING;

INCONSISTENT SYSTEMS; LATTICE REPRESENTATION; MODEL CHECKING PROBLEM; MULTIPLE VALUED DECISION DIAGRAMS; MULTIPLE VALUED LOGIC; SOFTWARE REQUIREMENTS; SYMBOLIC MODEL CHECKING; SYMBOLIC OPERATIONS;

MANY VALUED LOGICS;

EID: 84944044774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_30     Document Type: Conference Paper

References (29)

1. N.D. Belnap. “A Useful Four-Valued Logic”. In Dunn and Epstein, editors, Modern Uses of Multiple-Valued Logic, pages 30–56. Reidel, 1977.
2. L. Bolc and P. Borowik. Many-Valued Logics. Springer-Verlag, 1992.
3. G. Bruns and P. Godefroid. “Model Checking Partial State Spaces with 3-Valued Temporal Logics”. In Proceedings of CAV’99, volume 1633 of LNCS, pages 274–287, 1999.
4. G. Bruns and P. Godefroid. “Generalized Model Checking: Reasoning about Partial State Spaces”. In Proceedings of CONCUR’00, volume 877 of LNCS, pages 168–182, August 2000.
5. R. E. Bryant. “Symbolic Boolean manipulation with ordered binary-decision diagrams”. Computing Surveys, 24(3):293–318, September 1992.
6. T. Bultan, R. Gerber, and C. League. “Composite Model Checking: Verification with Type-Specific Symbolic Representations”. ACM Transactions on Software Engineering and Methodology, 9(1):3–50, January 2000.
7. M. Chechik, B. Devereux, and S. Easterbrook. “Implementing a Multi-Valued Symbolic Model-Checker”. In Proceedings of TACAS’01, volume 2031 of LNCS, pages 404–419. Springer, April 2001.
8. M. Chechik, B. Devereux, and A. Gurfinkel. “Model-Checking Infinite State-Space Systems with Fine-Grained Abstractions Using SPIN”. In Proceedings of the 8th SPIN Workshop on Model Checking Software, volume 2057 of LNCS, pages 16–36, May 2001.
9. M. Chechik and W. Ding. “Lightweight Reasoning about Program Correctness”. CSRG Technical Report 396, University of Toronto, March 2000.
10. M. Chechik, S. Easterbrook, and V. Petrovykh. “Model-Checking Over Multi-Valued Logics”. In Proceedings of FME’01, volume 2021 of LNCS, pages 72–98. Springer, March 2001.
11. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
12. B.A. Davey and H.A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
13. B. Devereux.: Symbolic representation and reasoning over state-based models with multiplicities. Master’s thesis, University of Toronto, Department of Computer Science, June 2001.
14. E.W. Dijkstra and C.S. Scholten. Predicate Calculus and Program Semantics. Springer, 1990.
15. J.M. Dunn. “A Comparative Study of Various Model-Theoretic Treatments of Negation: A History of Formal Negation”. In Dov Gabbay and Heinrich Wansing, editors, What is Negation. Kluwer Academic Publishers, 1999.
16. S. Easterbrook and M. Chechik. “A Framework for Multi-Valued Reasoning over Inconsistent Viewpoints”. In Proceedings of International Conference on Software Engineering (ICSE’01), pages 411–420, May 2001.
17. Melvin Fitting. “Many-ValuedModal Logics”. Fundamenta Informaticae, 15(3-4):335–350, 1991.
18. Melvin Fitting. “Many-Valued Modal Logics II”. Fundamenta Informaticae, 17:55–73, 1992.
19. Brian R. Gaines. “Logical Foundations for Database Systems”. International Journal of Man-Machine Studies, 11(4):481–500, 1979.
20. Matthew Ginsberg. “Multi-valued logic”. In M. Ginsberg, editor, Readings in Nonmonotonic Reasoning, pages 251–255. Morgan-Kaufmann Pub., 1987.
21. Reiner Hahnle. Automated Deduction in Multiple-Valued Logics, volume 10 of International Series of Monographs on Computer Science. Oxford University Press, 1994.
22. S. Hazelhurst. Compositional Model Checking of Partially Ordered State Spaces. PhD thesis, Department of Computer Science, University of British Columbia, 1996.
23. J. Łukasiewicz. Selected Works. North-Holland, Amsterdam, Holland, 1970.
24. R. S. Michalski. “Variable-Valued Logic and its Applications to Pattern Recognition and Machine Learning”. In D. C. Rine, editor, Computer Science and Multiple-Valued Logic: Theory and Applications, pages 506–534. North-Holland, Amsterdam, 1977.
25. M. Sagiv, T. Reps, and R. Wilhelm. “Parametric Shape Analysis via 3-Valued Logic”. In Proceedings of 26th Annual ACM Symposium on Principles of Programming Languages, 1999.
26. E. Santos. “Regular Fuzzy Expressions”. In Madan M. Gupta, George N. Saridis, and Brian R. Gaines, editors, Fuzzy Automata and Decision Processes, pages 169–176, New York, 1977. North–Holland.
27. Viorica Sofronie-Stokkermans. Automated theorem proving by resolution for finitely-valued logics based on distributive lattices with operators. Multiple-Valued Logic, 2000.
28. Fabio Somenzi. “Binary Decision Diagrams”. In Manfred Broy and Ralf Steinbruggen, editors, Calculational System Design, volume 173 of NATO Science Series F: Computer and Systems Sciences, pages 303–366. IOS Press, 1999.
29. L.A. Zadeh. “Fuzzy Sets”. In R. R. Yager, S. Ovchinnikov, R. M. Tong, and H. T. Nguyen, editors, Fuzzy Sets and Applications: Selected Papers by L.A. Zadeh, pages 29–44, New York, 1987. John Wiley & Sons, Inc.