{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:12:31Z","timestamp":1725516751117},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_7","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"75-86","source":"Crossref","is-referenced-by-count":1,"title":["Placement Inference for a Client-Server Calculus"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Neubauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Thiemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Proc. 1992 IEEE Symposium on Logic in Computer Science","author":"A. Aiken","year":"1992","unstructured":"Aiken, A., Wimmers, E.L.: Solving systems of set constraints. In: Proc. 1992 IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (1992)"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11601548_6","volume-title":"Processes, Terms and Cycles","author":"K.R. Apt","year":"2005","unstructured":"Apt, K.R.: Explaining constraint programming. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R.C. (eds.) Processes, Terms and Cycles. LNCS, vol.\u00a03838, pp. 55\u201369. Springer, Heidelberg (2005)"},{"key":"7_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, New York (1999)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/B978-044450813-3\/50010-2","volume-title":"Handbook of Automated Reasoning, ch.8","author":"F. Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch.8, vol.\u00a0I, pp. 445\u2013534. Elsevier Science, Amsterdam (2001)"},{"key":"7_CR6","volume-title":"Synchronization and Linearity, An Algebra for Discrete Event Systems","author":"F. Baccelli","year":"1992","unstructured":"Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.-P.: Synchronization and Linearity, An Algebra for Discrete Event Systems. John Wiley and Sons, Chichester (1992)"},{"issue":"2","key":"7_CR7","first-page":"187","volume":"8","author":"P. Buchholz","year":"2003","unstructured":"Buchholz, P., Kemper, P.: Weak bisimulation for (max\/+) automata and related models. Journal of Automata, Languages and Combinatorics\u00a08(2), 187\u2013218 (2003)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"7_CR8","unstructured":"Chen, L.: Timed Processes: Models, Axioms and Decidabilty. PhD thesis, University of Edinburgh (1992)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Post-proceedings of FMCO 2006","author":"E. Cooper","year":"2006","unstructured":"Cooper, E., Lindley, S., Wadler, P., Yallop, J.: Links: Web programming without tiers. In: Post-proceedings of FMCO 2006. LNCS, vol.\u00a04709. Springer, Heidelberg (2006)"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0004-3702(94)90021-3","volume":"65","author":"M.C. Cooper","year":"1994","unstructured":"Cooper, M.C., Cohen, D.A., Jeavons, P.G.: Characterising tractable constraints. Artificial Intelligence\u00a065(2), 347\u2013361 (1994)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/1027084.1027085","volume":"9","author":"A. Dasdan","year":"2004","unstructured":"Dasdan, A.: Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Transactions on Design Automation of Electronic Systems\u00a09(4), 385\u2013418 (2004)","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"key":"7_CR12","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Gaubert, S.: Performance evaluation of (max,+) automata. IEEE Transactions On Automatic Control\u00a040(12) (December 1995)","DOI":"10.1109\/9.478227"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/LICS.1996.561342","volume-title":"Proceedings of the 11th Annual Symposium on Logic in Computer Science","author":"T.A. Henzinger","year":"1996","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: Proceedings of the 11th Annual Symposium on Logic in Computer Science, pp. 278\u2013292. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"7_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, automata, languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, automata, languages. Springer, London (1986)"},{"key":"7_CR16","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BFb0032002","volume-title":"Proceedings REX Workshop on Real-Time: Theory in Practice","author":"N.A. Lynch","year":"1992","unstructured":"Lynch, N.A., Vaandrager, F.W.: Forward and backward simulations for timing-based systems. In: de Bakker, J.W., Huizing, K., de Roever, W.P., Rozenberg, G. (eds.) Proceedings REX Workshop on Real-Time: Theory in Practice, Mook, The Netherlands, June 1991. LNCS, vol.\u00a0600, pp. 397\u2013446. Springer, Berlin (1992)"},{"key":"7_CR18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with constraints: an introduction","author":"K. Marriott","year":"1998","unstructured":"Marriott, K., Stuckey, P.J.: Programming with constraints: an introduction. MIT Press, Cambridge (1998)"},{"key":"7_CR19","unstructured":"Murphy VII, T., Crary, K., Harper, R.: Type-safe distributed programming with ML5. In: Trustworthy Global Computing 2007 pre-proceedings (November 2007)"},{"key":"7_CR20","unstructured":"Neubauer, M.: Multi-Tier Programming. PhD thesis, Universit\u00e4t Freiburg (April 2007), http:\/\/www.freidok.uni-freiburg.de\/volltexte\/3104\/"},{"key":"7_CR21","first-page":"221","volume-title":"Proc.\u00a032nd ACM Symp. POPL","author":"M. Neubauer","year":"2005","unstructured":"Neubauer, M., Thiemann, P.: From sequential programs to multi-tier applications by program transformation. In: Abadi, M. (ed.) Proc.\u00a032nd ACM Symp. POPL, Long Beach, CA, USA, January 2005, pp. 221\u2013232. ACM Press, New York (2005)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Serrano, M., Gallesio, E., Loitsch, F.: HOP, a language for programming the Web 2.0. In: Proceedings of the First Dynamic Languages Symposium, Portland, OR, USA (October 2006)","DOI":"10.1145\/1176617.1176756"},{"key":"7_CR23","first-page":"203","volume-title":"Proc.\u00a029th ACM Symp. POPL","author":"Z. Su","year":"2002","unstructured":"Su, Z., Aiken, A., Niehren, J., Priesnitz, T., Treinen, R.: The first-order theory of subtyping constraints. In: Mitchell, J. (ed.) Proc.\u00a029th ACM Symp. POPL, Portland, OR, USA, January 2002, pp. 203\u2013216. ACM Press, New York (2002)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:07Z","timestamp":1605762487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}