{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:44:31Z","timestamp":1725558271752},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407539"},{"type":"electronic","value":"9783540451877"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45187-7_28","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T22:38:49Z","timestamp":1277505529000},"page":"431-445","source":"Crossref","is-referenced-by-count":9,"title":["Abstract Patterns of Compositional Reasoning"],"prefix":"10.1007","author":[{"given":"Nina","family":"Amla","sequence":"first","affiliation":[]},{"given":"E. Allen","family":"Emerson","sequence":"additional","affiliation":[]},{"given":"Kedar","family":"Namjoshi","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Trefler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Abadi, M., Lamport, L.: The existence of refinement mappings. In: LICS (1988)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Lamport, L.: Conjoining specifications. In: ACM Trans. on Programming Languages and Systems (TOPLAS) (May 1995)","DOI":"10.1145\/203095.201069"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Computer Science 1995","author":"M. Abadi","year":"1995","unstructured":"Abadi, M., Merz, S.: An abstract account of composition. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969. Springer, Heidelberg (1995)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Abadi, M., Plotkin, G.: A logical view of composition and refinement. In: POPL (1991)","DOI":"10.1145\/99583.99626"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Alpern, B., Schneider, F.: Defining liveness. Information Processing Letters\u00a021(4) (1985)","DOI":"10.1016\/0020-0190(85)90056-0"},{"key":"28_CR6","unstructured":"Alur, R., Henzinger, T.: Reactive modules. In: LICS (1996)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-45319-9_32","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N. Amla","year":"2001","unstructured":"Amla, N., Emerson, E.A., Namjoshi, K.S., Trefler, R.J.: Assume-guarantee based compositional reasoning for synchronous timing diagrams. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, p. 465. Springer, Heidelberg (2001)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36135-9_15","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2002","author":"N. Amla","year":"2002","unstructured":"Amla, N., Emerson, E.A., Namjoshi, K.S., Trefler, R.J.: Visual specifications for modular reasoning about asynchronous systems. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol.\u00a02529. Springer, Heidelberg (2002)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Chandy, K.M., Misra, J.: Proofs of networks of processes. IEEE Transactions on Software Engineering\u00a07(4) (1981)","DOI":"10.1109\/TSE.1981.230844"},{"key":"28_CR10","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Workshop on Logics of Programs. LNCS, vol.\u00a0131 (1981)"},{"key":"28_CR11","volume-title":"Concurrency Verification: Introduction to Compositional and Noncompositional Proof Methods","author":"W.-P. Roever de","year":"2001","unstructured":"de Roever, W.-P., de Boer, F., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Proof Methods. Cambridge University Press, Cambridge (2001)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Compositionality: The Significant Difference","year":"1997","unstructured":"de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.): COMPOS 1997. LNCS, vol.\u00a01536. Springer, Heidelberg (1997)"},{"key":"28_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-3228-5","volume-title":"Predicate Calculus and Program Semantics","author":"E.W. Dijkstra","year":"1990","unstructured":"Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Springer, Heidelberg (1990)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR\u201997: Concurrency Theory","author":"T.A. Henzinger","year":"1997","unstructured":"Henzinger, T.A., Kupferman, O., Rajamani, S.: Fair simulation. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243. Springer, Heidelberg (1997)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Qadeer, S., Rajamani, S.K., Tasiran, S.: An assume-guarantee rule for checking simulation. ACM Trans. on Programming Languages and Systems (TOPLAS) (January 2002)","DOI":"10.1145\/509705.509707"},{"key":"28_CR16","unstructured":"Jones, C.B.: Development methods for computer programs including a notion of interference. PhD thesis, Oxford University (1981)"},{"key":"28_CR17","volume-title":"Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach","author":"R.P. Kurshan","year":"1994","unstructured":"Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton (1994)"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/3-540-48224-5_67","volume-title":"Automata, Languages and Programming","author":"P. Maier","year":"2001","unstructured":"Maier, P.: A set-theoretic framework for assume-guarantee reasoning. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, p. 821. Springer, Heidelberg (2001)"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-36576-1_22","volume-title":"Foundations of Software Science and Computational Structures","author":"P. Maier","year":"2003","unstructured":"Maier, P.: Compositional circular assume-guarantee rules cannot be sound and complete. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 343\u2013357. Springer, Heidelberg (2003)"},{"key":"28_CR20","unstructured":"Manolios, P., Trefler, R.J.: Safety and liveness in branching time. In: LICS (2001)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-48153-2_30","volume-title":"Correct Hardware Design and Verification Methods","author":"K.L. McMillan","year":"1999","unstructured":"McMillan, K.L.: Circular compositional reasoning about liveness. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol.\u00a01703, pp. 342\u2013346. Springer, Heidelberg (1999)"},{"key":"28_CR22","unstructured":"Milner, R.: An algebraic definition of simulation between programs. In: 2nd IJCAI (1971)"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"K.S. Namjoshi","year":"2000","unstructured":"Namjoshi, K.S., Trefler, R.J.: On the completeness of compositional reasoning. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855. Springer, Heidelberg (2000)"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Pandya, P., Joseph, M.: P-A logic - a compositional proof system for distributed programs. Distributed Computing (1991)","DOI":"10.1007\/BF02311231"},{"key":"28_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"International Symposium on Programming","author":"J.P. Queille","year":"1982","unstructured":"Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol.\u00a0137. Springer, Heidelberg (1982)"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/3-540-48224-5_68","volume-title":"Automata, Languages and Programming","author":"M. Viswanathan","year":"2001","unstructured":"Viswanathan, M., Viswanathan, R.: Foundations for circular compositional reasoning. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, p. 835. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2003 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45187-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:15:16Z","timestamp":1558293316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45187-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407539","9783540451877"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45187-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}