{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T08:50:19Z","timestamp":1672995019142},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540003489","type":"print"},{"value":"9783540363842","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36384-x_18","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T14:21:13Z","timestamp":1196346073000},"page":"206-222","source":"Crossref","is-referenced-by-count":34,"title":["On the Expressiveness of 3-Valued Models"],"prefix":"10.1007","author":[{"given":"Patrice","family":"Godefroid","sequence":"first","affiliation":[]},{"given":"Radha","family":"Jagadeesan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"18_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/3-540-48683-6_25","volume-title":"Model Checking Partial State Spaces with 3-Valued Temporal Logics","author":"G. Bruns","year":"1999","unstructured":"G. Bruns and P. Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In Proceedings of the 11th Conference on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 274\u2013287, Trento, July1999. Springer-Verlag."},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-44618-4_14","volume-title":"Generalized Model Checking: Reasoning about Partial State Spaces","author":"G. Bruns","year":"2000","unstructured":"G. Bruns and P. Godefroid. Generalized Model Checking: Reasoning about Partial State Spaces. In Proceedings of CONCUR\u20192000 (11th International Conference on Concurrency Theory), volume 1877 of Lecture Notes in Computer Science, pages 168\u2013182, University Park, August 2000. Springer-Verlag."},{"key":"18_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45420-9","volume-title":"Boolean and Cartesian Abstraction for Model Checking C Programs","author":"T. Ball","year":"2001","unstructured":"T. Ball, A. Podelski, and S. K. Rajamani. Boolean and Cartesian Abstraction for Model Checking C Programs. In Proceedings of TACAS\u20192001 (Tools and Algorithms for the Construction and Analysis of Systems), volume 2031 of Lecture Notes in Computer Science. Springer-Verlag, April 2001."},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-44585-4_25","volume-title":"The SLAM Toolkit","author":"T. Ball","year":"2001","unstructured":"T. Ball and S. Rajamani. The SLAM Toolkit. In Proceedings of CAV\u20192001 (13th Conference on Computer Aided Verification), volume 2102 of Lecture Notes in Computer Science, pages 260\u2013264, Paris, July 2001. Springer-Verlag."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"D.R. Chase, M. Wegman, and F.K. Zadeck. Analysis of pointers and structures. In Proccedings of Conference on Programming Language Design and Implementation, pages 296\u2013310, June 1990.","DOI":"10.1145\/93542.93585"},{"key":"18_CR6","unstructured":"D. Dams. Abstract interpretation and partition refinement for model checking. PhD thesis, Technische Universiteit Eindhoven, The Netherlands, 1996."},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/3-540-48683-6_16","volume-title":"Experience with Predicate Astraction","author":"S. Das","year":"1999","unstructured":"S. Das, D. L. Dill, and S. Park. Experience with Predicate Astraction. In Proc. of the 11th International Conference on Computer-Aided Verification, Lecture Notes in Computer Science, pages 160\u2013172, Trento, July 1999. Springer Verlag."},{"key":"18_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/3-540-44685-0_29","volume-title":"Abstraction-based Model Checking using Modal Transition Systems","author":"P. Godefroid","year":"2001","unstructured":"P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based Model Checking using Modal Transition Systems. In Proceedings of CONCUR\u2019 2001 (12th International Conference on Concurrency Theory), volume 2154 of Lecture Notes in Computer Science, pages 426\u2013440, Aalborg, August 2001. Springer-Verlag."},{"key":"18_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-45657-0_11","volume-title":"Automatic Abstraction Using Generalized Model Checking","author":"P. Godefroid","year":"2002","unstructured":"P. Godefroid and R. Jagadeesan. Automatic Abstraction Using Generalized Model Checking. In Proceedings of CAV\u20192002 (14th Conference on Computer Aided Verification), volume 2404 of Lecture Notes in Computer Science, pages 137\u2013150, Copenhagen, July 2002. Springer-Verlag."},{"key":"18_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Construction of Abstract State Graphs with PVS","author":"S. Graf","year":"1997","unstructured":"S. Graf and H. Saidi. Construction of Abstract State Graphs with PVS. In Proceedings of the 9th International Conference on Computer Aided Verification, volume 1254 of Lecture Notes in Computer Science, pages 72\u201383, Haifa, June 1997. Springer-Verlag."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"T. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy Abstraction. In Proceedings of the 29th ACM Symposium on Principles of Programming Languages, pages 58\u201370, Portland, January 2002.","DOI":"10.1145\/503272.503279"},{"key":"18_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Modal Transition Systems: a Foundation for Three-Valued Program Analysis","author":"M. Huth","year":"2001","unstructured":"M. Huth, R. Jagadeesan, and D. Schmidt. Modal Transition Systems: a Foundation for Three-Valued Program Analysis. In Proceedings of the European Symposium on Programming (ESOP\u20192001), volume 2028 of Lecture Notes in Computer Science. Springer-Verlag, April 2001."},{"key":"18_CR13","unstructured":"M. Huth, R. Jagadeesan, and D. Schmidt. A Domain Equation for Refinement of Partial Systems. Submitted to Mathematical Structures in Computer Science, 2002."},{"key":"18_CR14","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979."},{"key":"18_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-47813-2_21","volume-title":"Model Checking Modal Transition Systems using Kripke Structures","author":"M. Huth","year":"2002","unstructured":"M. Huth. Model Checking Modal Transition Systems using Kripke Structures. In Proceedings of the Third International Workshop on Verification, Model Checking and Abstract Interpretation (VMCAI\u20192002), volume 2294 of Lecture Notes in Computer Science, pages 302\u2013316, Venice, January 2002. Springer-Verlag."},{"key":"18_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-45605-8_8","volume-title":"Possibilistic and Probabilistic Abstraction-based Model Checking","author":"M. Huth","year":"2002","unstructured":"M. Huth. Possibilistic and Probabilistic Abstraction-based Model Checking. In Proceedings of the PAPM-Probmiv 2002 Workshop, volume 2329 of Lecture Notes in Computer Science, pages 115\u2013134, Copenhagen, July 2002. Springer-Verlag."},{"key":"18_CR17","unstructured":"S. C. Kleene. Introduction to Metamathematics. North Holland, 1987."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen. Results on the Propositional Mu-Calculus. Theoretical Computer Science, 27:333\u2013354, 1983.","journal-title":"Theoretical Computer Science"},{"key":"18_CR19","series-title":"Lect Notes Comput Sci","first-page":"232","volume-title":"Modal Specifications","author":"K. G. Larsen","year":"1989","unstructured":"K. G. Larsen. Modal Specifications. In J. Sifakis, editor, Workshop on Automatic Verification Methods for Finite-State Systems, volume 407 of Lecture Notes in Computer Science, pages 232\u2013246. Springer-Verlag, June 1989. International Workshop, Grenoble, France."},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"K. G. Larsen and B. Thomsen. A Modal Process Logic. In Proceedings of Third Annual Symposium on Logic in Computer Science, pages 203\u2013210. IEEE Computer Society Press, 1988.","DOI":"10.1109\/LICS.1988.5119"},{"key":"18_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-10828-9_52","volume-title":"A Modal Characterization of Observable Machine Behavior","author":"R. Milner","year":"1981","unstructured":"R. Milner. A Modal Characterization of Observable Machine Behavior. In Proc. CAAP\u201981, volume 112 of Lecture Notes in Computer Science, pages 25\u201334. Springer-Verlag, 1981."},{"key":"18_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-49057-4","volume-title":"Model Checking: A Tutorial Introduction","author":"M. Muller-Olm","year":"1999","unstructured":"M. Muller-Olm, D. Schmidt, and B. Steffen. Model Checking: A Tutorial Introduction. In Proceedings of the 6th International Static Analysis Symposium (SAS\u201999), volume 1694 of Lecture Notes in Computer Science, pages 331\u2013354, Berlin, September 1999. Springer-Verlag."},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"M. Sagiv, T. Reps, and R. Wilhelm. Parametric Shape Analysis Via 3-Valued Logic. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages, January 1999.","DOI":"10.1145\/292540.292552"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36384-X_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T23:59:17Z","timestamp":1551139157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36384-X_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,16]]},"ISBN":["9783540003489","9783540363842"],"references-count":23,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-36384-x_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2002,12,16]]}}}