{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:55:44Z","timestamp":1725551744243},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297970"},{"type":"electronic","value":"9783540322504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11576280_28","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T14:01:26Z","timestamp":1130162486000},"page":"405-420","source":"Crossref","is-referenced-by-count":4,"title":["Using Three-Valued Logic to Specify and Verify Algorithms of Computational Geometry"],"prefix":"10.1007","author":[{"given":"Jens","family":"Brandt","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-08494-6","volume-title":"Many-Valued logics","author":"L. Bolc","year":"1992","unstructured":"Bolc, L., Borowik, P.: Many-Valued logics. Springer, Heidelberg (1992)"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/11596356_42","volume-title":"Embedded and Ubiquitous Computing \u2013 EUC 2005","author":"J. Brandt","year":"2005","unstructured":"Brandt, J., Schneider, K.: Dependable polygon-processing algorithms for safety-critical embedded systems. In: Yang, L.T., Amamiya, M., Liu, Z., Guo, M., Rammig, F.J. (eds.) EUC 2005. LNCS, vol.\u00a03824, pp. 405\u2013417. Springer, Heidelberg (2005)"},{"key":"28_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4210-9","volume-title":"Asynchronous Circuits","author":"J. Brzozowski","year":"1995","unstructured":"Brzozowski, J., Seger, C.-J.: Asynchronous Circuits. Springer, Heidelberg (1995)"},{"key":"28_CR4","first-page":"16","volume-title":"Symposium on Discrete Algorithms (SODA)","author":"C. Burnikel","year":"1994","unstructured":"Burnikel, C., Mehlhorn, K., Schirra, S.: On degeneracy in geometric computations. In: Symposium on Discrete Algorithms (SODA), Arlington, Virginia, USA, pp. 16\u201323. ACM Press, New York (1994)"},{"key":"28_CR5","doi-asserted-by":"crossref","DOI":"10.1142\/2196","volume-title":"Machine Proofs in Geometry","author":"S. Chou","year":"1994","unstructured":"Chou, S., Gao, X., Zhang, J.: Machine Proofs in Geometry. World Scientific, Singapore (1994)"},{"key":"28_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry. Springer, Heidelberg (2000)"},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H. Edelsbrunner","year":"1990","unstructured":"Edelsbrunner, H., M\u00fccke, E.: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics\u00a09(1), 66\u2013104 (1990)","journal-title":"ACM Transactions on Graphics"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1147\/rd.92.0090","volume":"9","author":"E. Eichelberger","year":"1965","unstructured":"Eichelberger, E.: Hazard detection in combinational and sequential switching circuits. IBM Journal of Research and Development\u00a09, 90\u201399 (1965)","journal-title":"IBM Journal of Research and Development"},{"key":"28_CR9","volume-title":"Computer Graphics: Principles and Practice","author":"J. Foley","year":"2000","unstructured":"Foley, J., van Dam, A., Feiner, S., Hughes, J.: Computer Graphics: Principles and Practice. Addison Wesley, Reading (2000)"},{"key":"28_CR10","volume-title":"Introduction to HOL: A Theorem Proving Environment for Higher Order Logic","author":"M. Gordon","year":"1993","unstructured":"Gordon, M., Melham, T.: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge (1993)"},{"key":"28_CR11","volume-title":"Introduction to Metamathematics","author":"S. Kleene","year":"1952","unstructured":"Kleene, S.: Introduction to Metamathematics. North Holland, Amsterdam (1952)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55611-7","volume-title":"Axioms and Hulls","author":"D. Knuth","year":"1992","unstructured":"Knuth, D.: Axioms and Hulls. LNCS, vol.\u00a0606. Springer, Heidelberg (1992)"},{"issue":"7","key":"28_CR13","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1109\/43.293952","volume":"13","author":"S. Malik","year":"1994","unstructured":"Malik, S.: Analysis of cycle combinational circuits. IEEE Transactions on Computer Aided Design\u00a013(7), 950\u2013956 (1994)","journal-title":"IEEE Transactions on Computer Aided Design"},{"key":"28_CR14","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-44755-5_24","volume-title":"Theorem Proving in Higher Order Logics","author":"D. Pichardie","year":"2001","unstructured":"Pichardie, D., Bertot, Y.: Formalizing convex hull algorithms. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol.\u00a02152, pp. 346\u2013361. Springer, Heidelberg (2001)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-27813-9_2","volume-title":"Computer Aided Verification","author":"T. Reps","year":"2004","unstructured":"Reps, T., Sagiv, M., Wilhelm, R.: Static program analysis via 3-valued logic. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 15\u201330. Springer, Heidelberg (2004)"},{"key":"28_CR17","volume-title":"Formal Methods and Models for Codesign (MEMOCODE)","author":"T. Schuele","year":"2005","unstructured":"Schuele, T., Schneider, K.: Three-valued logic in bounded model checking. In: Formal Methods and Models for Codesign (MEMOCODE), Verona, Italy. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"28_CR18","first-page":"157","volume":"21","author":"W.-T. Wu","year":"1978","unstructured":"Wu, W.-T.: On the decision problem and the mechanization of theorem proving in elementary geometry. Scientia Sinica\u00a021, 157\u2013179 (1978)","journal-title":"Scientia Sinica"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-60275-5_77","volume-title":"Higher Order Logic Theorem Proving and Its Applications","author":"M. Yamamoto","year":"1995","unstructured":"Yamamoto, M., Nishizaki, S., Hagiya, M.: Formalization of planar graphs. In: Schubert, E.T., Alves-Foss, J., Windley, P. (eds.) HUG 1995. LNCS, vol.\u00a0971, pp. 369\u2013384. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11576280_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:44:20Z","timestamp":1619505860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11576280_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297970","9783540322504"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11576280_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}