{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:11:39Z","timestamp":1725552699079},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540308072"},{"type":"electronic","value":"9783540322955"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11596356_42","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:49:24Z","timestamp":1132642164000},"page":"405-417","source":"Crossref","is-referenced-by-count":2,"title":["Dependable Polygon-Processing Algorithms for Safety-Critical Embedded Systems"],"prefix":"10.1007","author":[{"given":"Jens","family":"Brandt","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-61739-6_33","volume-title":"Static Analysis","author":"M. Alt","year":"1996","unstructured":"Alt, M., Ferdinand, C., Martin, F., Wilhelm, R.: Cache behavior prediction by abstract interpretation. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol.\u00a01145, pp. 52\u201366. Springer, Heidelberg (1996)"},{"key":"42_CR2","unstructured":"Berry, G.: The constructive semantics of pure Esterel (July 1999), \n                    \n                      http:\/\/www-sop.inria.fr\/esterel.org"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/11576280_28","volume-title":"Formal Methods and Software Engineering","author":"J. Brandt","year":"2005","unstructured":"Brandt, J., Schneider, K.: Using three-valued logic to specify and verify algorithms of computational geometry. In: Lau, K.-K., Banach, R. (eds.) ICFEM 2005. LNCS, vol.\u00a03785, pp. 405\u2013420. Springer, Heidelberg (2005)"},{"key":"42_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4210-9","volume-title":"Asynchronous Circuits","author":"J.A. Brzozowski","year":"1995","unstructured":"Brzozowski, J.A., Seger, C.-J.H.: Asynchronous Circuits. Springer, Heidelberg (1995)"},{"key":"42_CR5","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, New York (1994)"},{"key":"42_CR6","doi-asserted-by":"crossref","DOI":"10.1142\/2196","volume-title":"Machine Proofs in Geometry","author":"S.C. Chou","year":"1994","unstructured":"Chou, S.C., Gao, X.S., Zhang, J.Z.: Machine Proofs in Geometry. World Scientific, Singapore (1994)"},{"key":"42_CR7","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":"42_CR8","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.P.: 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":"42_CR9","volume-title":"Computer Graphics: Principles and Practice","author":"J.D. Foley","year":"2000","unstructured":"Foley, J.D., van Dam, A., Feiner, S.K., Hughes, J.F.: Computer Graphics: Principles and Practice. Addison-Wesley, Reading (2000)"},{"key":"42_CR10","volume-title":"Introduction to HOL: A Theorem Proving Environment for Higher Order Logic","author":"M.J.C. Gordon","year":"1993","unstructured":"Gordon, M.J.C., Melham, T.F.: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge (1993)"},{"issue":"3","key":"42_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0925-7721(01)00012-8","volume":"20","author":"K. Hormann","year":"2001","unstructured":"Hormann, K., Agathos, A.: The point in polygon problem for arbitrary polygons. Computational Geometry\u00a020(3), 131\u2013144 (2001)","journal-title":"Computational Geometry"},{"key":"42_CR12","volume-title":"Introduction to Metamathematics","author":"S.C. Kleene","year":"1952","unstructured":"Kleene, S.C.: Introduction to Metamathematics. North-Holland, Amsterdam (1952)"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1109\/ICCAD.1993.580150","volume-title":"Conference on Computer Aided Design (ICCAD)","author":"S. Malik","year":"1993","unstructured":"Malik, S.: Analysis of cyclic combinational circuits. In: Conference on Computer Aided Design (ICCAD), Santa Clara, California, pp. 618\u2013625. IEEE Computer Society, Los Alamitos (1993)"},{"key":"42_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":"42_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":"42_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.W. Reps","year":"2004","unstructured":"Reps, T.W., 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":"42_CR17","unstructured":"Schneider, K., Brandt, J., Schuele, T., Tuerk, T.: Improving constructiveness in code generators. In: Synchronous Languages, Applications, and Programming (SLAP), Edinburgh, Scotland, UK (2005)"},{"key":"42_CR18","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/ACSD.2005.24","volume-title":"Conference on Application of Concurrency to System Design (ACSD)","author":"K. Schneider","year":"2005","unstructured":"Schneider, K., Brandt, J., Schuele, T., Tuerk, T.: Maximal causality analysis. In: Conference on Application of Concurrency to System Design (ACSD), St. Malo, France, pp. 106\u2013115. IEEE Computer Society, Los Alamitos (2005)"},{"key":"42_CR19","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, Los Alamitos (2005)"},{"key":"42_CR20","unstructured":"Shiple, T.R.: Formal Analysis of Synchronous Circuits. PhD thesis, University of California at Berkeley (1996)"},{"key":"42_CR21","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"}],"container-title":["Lecture Notes in Computer Science","Embedded and Ubiquitous Computing \u2013 EUC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11596356_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:43Z","timestamp":1619506483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11596356_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540308072","9783540322955"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11596356_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}