{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:53:10Z","timestamp":1725997990282},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319980461"},{"type":"electronic","value":"9783319980478"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98047-8_16","type":"book-chapter","created":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T01:05:49Z","timestamp":1540343149000},"page":"251-266","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Are Synchronous Programs Logic Programs?"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Schneider","sequence":"first","affiliation":[]},{"given":"Marc","family":"Dahlem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"key":"16_CR1","unstructured":"J. Aguado et al. \u201cGrounding Synchronous Deterministic Concurrency in Sequential Programming\u201d. In: Programming Languages and Systems Ed. by Z. Shao. Vol. 8410. LNCS. Grenoble, France: Springer, 2014, pp. 229\u2013248."},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/JPROC.2002.805826","volume":"91","author":"A. Benveniste","year":"2003","unstructured":"A. Benveniste et al. \u201cThe Synchronous Languages Twelve Years Later\u201d. In: Proceedings of the IEEE 91.1 (2003), pp. 64\u201383.","journal-title":"Proceedings of the IEEE"},{"key":"16_CR3","unstructured":"G. Berry and L. Cosserat. \u201cThe Esterel Synchronous Programming Language and its Mathe- matical Semantics\u201d. In: Seminar on Concurrency (CONCUR) Ed. by S.D. Brookes, A.W. Roscoe, and G. Winskel. Vol. 197. LNCS. Pittsburgh, Pennsylvania, USA: Springer, 1985, pp. 389\u2013448."},{"key":"16_CR4","first-page":"128","volume-title":"Lecture Notes in Computer Science","author":"Michael Beeck","year":"1994","unstructured":"M. von der Beeck. \u201cA Comparison of Statecharts Variants\u201d. In: Formal Techniques in Real- Time and Fault-Tolerant Systems (FTRTFT) Ed. by H. Langmaack, W.-P. de Roever, and J. Vytopil. Vol. 863. LNCS. L\u00fcbeck, Germany: Springer, 1994, pp. 128\u2013148."},{"key":"16_CR5","unstructured":"G. Berry. The Constructive Semantics of Pure Esterel. July 1999."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"J. Brandt et al. \u201cEmbedding Polychrony into Synchrony\u201d. In: IEEE Transactions on Software Engineering (TSE) 39.7 (July 2013), pp. 917\u2013929.","DOI":"10.1109\/TSE.2012.85"},{"key":"16_CR7","unstructured":"J.-P. Bodeveix, M. Filali-Amine, and S. Kan. \u201cA Refinement-based compiler development for synchronous language\u201d. In: Formal Methods and Models for Codesign (MEMOCODE) Ed. by J.-P. Talpin, P. Derler, and K. Schneider. Vienna, Austria: IEEE Computer Society, 2017, pp. 165\u2013174."},{"issue":"9","key":"16_CR8","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/5.97299","volume":"79","author":"F. Boussinot","year":"1991","unstructured":"F. Boussinot and R. de Simone. \u201cThe Esterel language\u201d. In: Proceedings of the IEEE 79.9 (1991), pp. 1293\u20131304.","journal-title":"Proceedings of the IEEE"},{"issue":"11","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1109\/12.177306","volume":"41","author":"J.A. Brzozowski","year":"1992","unstructured":"J.A. Brzozowski and C. Ebergen. \u201cOn the Delay-Sensitivity of Gate Networks\u201d. In: IEEE Transactions on Computers (T-C) 41.11 (Nov 1992), pp. 1349\u20131359.","journal-title":"IEEE Transactions on Computers"},{"key":"16_CR10","first-page":"1","volume-title":"Software and Compilers for Embedded Systems (SCOPES)","author":"J Brandt","year":"2009","unstructured":"J. Brandt and K. Schneider. \u201cSeparate Compilation for Synchronous Programs\u201d. In: Software and Compilers for Embedded Systems (SCOPES). Nice, France: ACM, 2009, pp. 1\u201310."},{"key":"16_CR11","unstructured":"J.A. Brzozowski and C.-J.H. Seger. Advances in asynchronous circuit theory part I. Bulletin of the European association of Theoretical Computer Science. Oct. 1990."},{"key":"16_CR12","unstructured":"R.E. Bryant and C.-J.H. Seger. \u201cFormal Verification of Digital Circuits Using Symbolic Ternary System Models\u201d. In: Computer Aided Verification (CAV). Ed. by E.M. Clarke and R.P. Kurshan. Vol. 531. LNCS. New Brunswick, New Jersey USA: Springer, 1991, pp. 33\u201343."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"J.A. Brzozowski and C.-J.H. Seger. Asynchronous Circuits Springer, 1995.","DOI":"10.1007\/978-1-4612-4210-9"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1109\/TCAD.1987.1270310","volume":"6","author":"R.E. Bryant","year":"1987","unstructured":"R.E. Bryant. \u201cBoolean Analysis of MOS Circuits\u201d. In: IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems (T-CAD). CAD-6.4 (July 1987), pp. 634\u2013649.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"16_CR15","first-page":"178","volume-title":"Principles of Programming Languages (POPL) Munich","author":"P Caspi","year":"1987","unstructured":"P. Caspi et al. \u201cLUSTRE: A declarative language for programming synchronous systems\u201d. In: Principles of Programming Languages (POPL) Munich, Germany: ACM, 1987, pp. 178\u2013188."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"Keith L. Clark","year":"1978","unstructured":"K.L. Clark. \u201cNegation as Failure\u201d. In: Logic and Data Bases Ed. by H. Gallaire and J. Minker. Toulouse, France: Plemum Press, New York, 1977, pp. 293\u2013322."},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"William F. Dowling","year":"1984","unstructured":"W.F. Dowling and J.H. Gallier. \u201cLinear-time algorithms for testing the satisfiability of propositional Horn formulae\u201d. In: The Journal of Logic Programming 1.3 (Oct. 1984), pp. 267\u2013284.","journal-title":"The Journal of Logic Programming"},{"key":"16_CR18","first-page":"40","volume-title":"Lecture Notes in Computer Science","author":"Thomas Eiter","year":"2009","unstructured":"T. Eiter, G. Ianni, and T. Krennwallner. \u201cAnswer Set Programming: A Primer\u201d. In: Reasoning Web Semantic Technologies for Information Systems Ed. by S. Tessaris et al. Vol. 5689. LNCS. Brixen-Bressanone, Italy: Springer, 2009, pp. 40\u2013110."},{"key":"16_CR19","unstructured":"M. van Emden and R. Kowalski. \u201cThe semantics of predicate logic as a programming language\u201d. In: Journal of the ACM (JACM) 23.4 (Oct. 1976), pp. 733\u2013742."},{"key":"16_CR20","unstructured":"F. Fages. \u201cConsistency of Clark\u2019s completion and existence of stable models\u201d. In: Methods of Logic in Computer Science 1.1 (1994), pp. 51\u201360."},{"issue":"4","key":"16_CR21","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"Melvin Fitting","year":"1985","unstructured":"M. Fitting. \u201cA Kripke-Kleene Semantics for Logic Programs\u201d. In: Journal of Logic Pro- gramming 2.4 (Dec. 1985), pp. 295\u2013312.","journal-title":"The Journal of Logic Programming"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"H. Fecher et al. \u201c29 New Unclarities in the Semantics of UML 2.0 State Machines\u201d. In: International Conference on Formal Engineering Methods (ICFEM) Ed. by K.-K. Lau and R. Banach. Vol. 3785. LNCS. Manchester England, UK: Springer, 2005, pp. 52\u201365.","DOI":"10.1007\/11576280_5"},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-18317-5_15","volume-title":"Functional Programming Languages and Computer Architecture","author":"Thierry Gautier","year":"1987","unstructured":"T. Gautier, P. Le Guernic, and L. Besnard. \u201cSIGNAL, a declarative language for synchronous programming of real-time systems\u201d. In: Functional Programming Languages and Computer Architecture Ed. by G. Kahn. Vol. 274. LNCS. Portland, Oregon, USA: Springer, 1987, pp. 257\u2013277."},{"key":"16_CR24","unstructured":"M. Gelfond and V. Lifschitz. \u201cThe Stable Model Semantics for Logic Programming\u201d. In: Logic Programming. Ed. by R.A. Kowalski and K.A. Bowen. Seattle, Washington, USA: MIT Press, 1988, pp. 1070\u20131080."},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"A. van Gelder, K.A. Ross, and J.S. Schlipf. \u201cThe Well-Founded Semantics for General Logic Programs\u201d. In: Journal of the ACM (JACM) 38.3 (July 1991), pp. 620\u2013650.","DOI":"10.1145\/116825.116838"},{"issue":"9","key":"16_CR26","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1109\/5.97301","volume":"79","author":"P. LeGuernic","year":"1991","unstructured":"P. Le Guernic et al. \u201cProgramming real-time applications with SIGNAL\u201d. In: Proceedings of the IEEE 79.9 (1991), pp. 1321\u20131336.","journal-title":"Proceedings of the IEEE"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"N. Halbwachs. Synchronous programming of reactive systems. Kluwer, 1993.","DOI":"10.1007\/978-1-4757-2231-4"},{"issue":"4","key":"16_CR28","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/235321.235322","volume":"5","author":"David Harel","year":"1996","unstructured":"D. Harel and A. Naamad. \u201cThe STATEMATE Semantics of Statecharts\u201d. In: ACM Transactions on Software Engineering and Methodology (TOSEM) 5.4 (1996), pp. 293\u2013333.","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"D. Harel and A. Pnueli \u201cOn the development of reactive systems\u201d. In: Logic and Models of Concurrent Systems. Ed. by K.R. Apt. Springer, 1985, pp. 477\u2013498.","DOI":"10.1007\/978-3-642-82453-1_17"},{"issue":"3","key":"16_CR30","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"David Harel","year":"1987","unstructured":"D. Harel. \u201cStatecharts: A visual formulation for complex systems\u201d. In: Science of Computer Programming 8.3 (1987), pp. 231\u2013274.","journal-title":"Science of Computer Programming"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"N. Halbwachs et al. \u201cThe Synchronous Dataflow Programming Language LUSTRE\u201d. In: Proceedings of the IEEE 79.9 (Sept. 1991), pp. 1305\u20131320.","DOI":"10.1109\/5.97300"},{"key":"16_CR32","unstructured":"R. von Hanxleden et al. \u201cSCCharts: sequentially constructive statecharts for safety-critical applications: HW\/SW-synthesis for a conservative extension of synchronous statecharts\u201d. In: Programming Language Design and Implementation (PLDI) Ed. by M.F.P. O\u2019Boyle and K. Pingali. Edinburgh, United Kingdom: ACM, 2014, pp. 372\u2013383."},{"key":"16_CR33","unstructured":"R. von Hanxleden et al. \u201cSequentially constructive concurrency: a conservative extension of the synchronous model of computation\u201d. In: Design, Automation and Test in Europe (DATE). Ed. by E. Macii. Grenoble, France: EDA Consortium\/ACM, 2013, pp. 581\u2013586."},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"R. von Hanxleden et al. \u201cSequentially Constructive Concurrency A Conservative Extension of the Synchronous Model of Computation\u201d. In: ACM Transactions on Embedded Computing Systems (TECS) 13.4s (July 2014), 144:1\u2013144:26.","DOI":"10.1145\/2627350"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"D.A. Huffman. \u201cCombinational circuits with feedback\u201d. In: Recent Developments in Switch- ing Theory Ed. by A. Mukhopadhyay Academic Press, 1971, pp. 27\u201355.","DOI":"10.1016\/B978-0-12-509850-2.50007-5"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"W.H. Kautz. \u201cThe necessity of closed circuit loops in minimal combinational circuits\u201d. In: IEEE Transactions on Computers (T-C) C-19.2 (Feb 1970), pp. 162\u2013166.","DOI":"10.1109\/T-C.1970.222884"},{"key":"16_CR37","unstructured":"R. Kowalski. \u201cPredicate Logic as Programming Language\u201d. In: IFIP Congress Stockholm, Sweden, 1974, pp. 569\u2013574."},{"issue":"3","key":"16_CR38","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","volume":"7","author":"Kenneth Kunen","year":"1989","unstructured":"K. Kunen. \u201cSigned data dependencies in logic programs\u201d. In: Journal of Logic Programming 7.3 (Nov 1989), pp. 231\u2013245.","journal-title":"The Journal of Logic Programming"},{"issue":"1-2","key":"16_CR39","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"Fangzhen Lin","year":"2004","unstructured":"F. Lin and Y. Zhao. \u201cASSAT: Computing answer sets of a logic program by SAT solvers\u201d. In: Artificial Intelligence 157 (2004), pp. 115\u2013137.","journal-title":"Artificial Intelligence"},{"key":"16_CR40","doi-asserted-by":"crossref","unstructured":"S. Malik. \u201cAnalysis of Cyclic Combinational Circuits\u201d. In: International Conference on Computer-Aided Design (ICCAD). Santa Clara, California USA: IEEE Computer Society, 1993, pp. 618\u2013625.","DOI":"10.1109\/ICCAD.1993.580150"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"S. Malik. \u201cAnalysis of cycle combinational circuits\u201d. In: IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems (T-CAD) 13.7 (July 1994), pp. 950\u2013956.","DOI":"10.1109\/43.293952"},{"key":"16_CR42","volume-title":"A Short Introduction to Intuitionistic Logic","author":"G Mints","year":"2000","unstructured":"G. Mints. A Short Introduction to Intuitionistic Logic The University Series in Mathematics. Kluwer, 2000."},{"key":"16_CR43","first-page":"244","volume-title":"Lecture Notes in Computer Science","author":"A. Pnueli","year":"1991","unstructured":"A. Pnueli and M. Shalev. \u201cWhat is in a step: On the semantics of statecharts\u201d. In: Theoretical Aspects of Computer Software (TACS) Ed. by T. Ito and A.R. Meyer. Vol. 526. LNCS. Sendai, Japan: Springer, 1991, pp. 244\u2013264."},{"key":"16_CR44","doi-asserted-by":"crossref","unstructured":"R.L. Rivest. \u201cThe Necessity of Feedback in Minimal Monotone Combinational Circuits\u201d. In: IEEE Transactions on Computers (T-C) C-26.6 (1977), pp. 606\u2013607.","DOI":"10.1109\/TC.1977.1674886"},{"key":"16_CR45","first-page":"10","volume-title":"Formal Methods and Models for Codesign (MEMOCODE) Austin","author":"K Rathlev","year":"2015","unstructured":"K. Rathlev et al. \u201cSCEst: Sequentially Constructive Esterel\u201d. In: Formal Methods and Models for Codesign (MEMOCODE) Austin, Texas, USA: IEEE Computer Society, 2015, pp. 10\u201319."},{"key":"16_CR46","unstructured":"K. Schneider et al. \u201cMaximal Causality Analysis\u201d. In: Application of Concurrency to System Design (ACSD) Ed. by J. Desel and Y. Watanabe. Saint-Malo, France: IEEE Computer Society, 2005, pp. 106\u2013115."},{"key":"16_CR47","first-page":"179","volume-title":"Compilers, Architecture and Synthesis for Embedded Systems (CASES)","author":"K Schneider","year":"2004","unstructured":"K. Schneider, J. Brandt, and T. Sch\u00fcle. \u201cCausality Analysis of Synchronous Programs with Delayed Actions\u201d. In: Compilers, Architecture and Synthesis for Embedded Systems (CASES). Washington, District of Columbia, USA: ACM, 2004, pp. 179\u2013189."},{"key":"16_CR48","doi-asserted-by":"crossref","unstructured":"K. Schneider. \u201cA Verified Hardware Synthesis for Esterel\u201d. In: Distributed and Parallel Embedded Systems (DIPES) Ed. by F.J. Rammig. Kluwer, 2000, pp. 205\u2013214.","DOI":"10.1007\/978-0-387-35409-5_20"},{"key":"16_CR49","unstructured":"K. Schneider The Synchronous Programming Language Quartz. Internal Report 375. Kaiser slautern, Germany: Department of Computer Science, University of Kaiserslautern, Dec. 2009."},{"key":"16_CR50","unstructured":"C.-J. Seger and J.A. Brzozowski. \u201cAn optimistic ternary simulation of gate races\u201d. In: Theoretical Computer Science (TCS) 61.1 (Oct. 1988), pp. 49\u201366."},{"key":"16_CR51","doi-asserted-by":"crossref","unstructured":"E.M. Sentovich. \u201cQuick conservative causality analysis\u201d. In: International Symposium on System Synthesis (ISSS) Ed. by F. Vahid and F. Catthoor. Antwerp, Belgium: ACM, 1997, pp. 2\u20138.","DOI":"10.1109\/ISSS.1997.621669"},{"key":"16_CR52","first-page":"328","volume-title":"European Design Automation Conference (EDAC) Paris","author":"TR Shiple","year":"1996","unstructured":"T.R. Shiple, G. Berry, and H. Touati. \u201cConstructive Analysis of Cyclic Circuits\u201d. In: European Design Automation Conference (EDAC) Paris, France: IEEE Computer Society, 1996, pp. 328\u2013333."},{"key":"16_CR53","doi-asserted-by":"crossref","unstructured":"L. Stok. \u201cFalse Loops Through Resource Sharing\u201d. In: International Conference on Computer-Aided Design (ICCAD) IEEE Computer Society 1992, pp. 345\u2013348.","DOI":"10.1109\/ICCAD.1992.279349"},{"key":"16_CR54","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-35722-0_24","volume-title":"Logical Foundations of Computer Science","author":"Jean-Pierre Talpin","year":"2013","unstructured":"J.-P. Talpin et al. \u201cConstructive Polychronous Systems\u201d. In: Logical Foundations of Com- puter Science (LFCS) Ed. by S.N. Art\u00ebmov and A. Nerode. Vol. 7734. LNCS. San Diego, California, USA: Springer, 2013, pp. 335\u2013349."},{"key":"16_CR55","doi-asserted-by":"crossref","unstructured":"Z. Yang et al. \u201cA verified transformation: from polychronous programs to a variant of clocked guarded actions\u201d. In: International Workshop on Software and Compilers for Embedded Systems (SCOPES). Ed. by H. Corporaal and S. Stuijk. Sankt Goar, Germany: ACM, 2014, pp. 128\u2013137.","DOI":"10.1145\/2609248.2609259"}],"container-title":["Principled Software Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98047-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,27]],"date-time":"2019-10-27T17:15:36Z","timestamp":1572196536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98047-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319980461","9783319980478"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98047-8_16","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}