{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:32:25Z","timestamp":1725471145083},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540367499"},{"type":"electronic","value":"9783540367505"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11804192_12","type":"book-chapter","created":{"date-parts":[[2006,9,29]],"date-time":"2006-09-29T08:20:46Z","timestamp":1159518046000},"page":"243-258","source":"Crossref","is-referenced-by-count":3,"title":["Program Compatibility Approaches"],"prefix":"10.1007","author":[{"given":"Edmund","family":"Clarke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natasha","family":"Sharygina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nishant","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation\u00a075(2), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"12_CR2","unstructured":"Ball, T., Rajamani, S.: Boolean programs: A model and process for software analysis. TR-2000-14 (2000)"},{"issue":"1","key":"12_CR3","first-page":"65","volume":"13","author":"A. Black","year":"1987","unstructured":"Black, A., Hutchinson, A., Jul, N., Levy, E., Carter, L.: Distribution and abstract types in emerald. IEEE TSE\u00a013(1), 65\u201376 (1987)","journal-title":"IEEE TSE"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0890-5401(88)90007-7","volume":"76","author":"L. Cardelli","year":"1988","unstructured":"Cardelli, L.: A semantics of multiple inheritance. Information and Computation\u00a076, 138\u2013164 (1988)","journal-title":"Information and Computation"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/11526841_34","volume-title":"FM 2005: Formal Methods","author":"S. Chaki","year":"2005","unstructured":"Chaki, S., Sharygina, E.C.N., Sinha, N.: Dynamic component substitutability analysis. In: Fitzgerald, J.S., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol.\u00a03582, pp. 512\u2013528. Springer, Heidelberg (2005)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/3-540-45657-0_34","volume-title":"Computer Aided Verification","author":"A. Chakrabarti","year":"2002","unstructured":"Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Mang, F.Y.C.: Synchronous and bidirectional component interfaces. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 414\u2013427. Springer, Heidelberg (2002)"},{"key":"12_CR7","volume-title":"Model Checking","author":"E. Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-36577-X_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.M. Cobleigh","year":"2003","unstructured":"Cobleigh, J.M., Giannakopoulou, D., P\u0103s\u0103reanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol.\u00a02619, pp. 331\u2013346. Springer, Heidelberg (2003)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: FSE (2001)","DOI":"10.1145\/503209.503226"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-45449-7_11","volume-title":"Embedded Software","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface theories for component-based design. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol.\u00a02211, pp. 148\u2013165. Springer, Heidelberg (2001)"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1145\/1066100.1066102","volume":"52","author":"D. Detlefs","year":"2005","unstructured":"Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: a theorem prover for program checking. J. ACM\u00a052(3), 365\u2013473 (2005)","journal-title":"J. ACM"},{"key":"12_CR13","volume-title":"A Discipline of Programming","author":"E. Dijkstra","year":"1976","unstructured":"Dijkstra, E.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Ernst, M.D., Cockrell, J., Griswold, W.G., Notkin, D.: Dynamically discovering likely program invariants to support program evolution. In: International Conference on Software Engineering (ICSE 1999), pp. 213\u2013224 (1999)","DOI":"10.1145\/302405.302467"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S. Graf","year":"1997","unstructured":"Graf, S., Sa\u00efdi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"key":"12_CR16","unstructured":"Ivers, J., Sharygina, N.: Overview of ComFoRT: A model checking reasoning framework. CMU\/SEI-2004-TN-018 (2004)"},{"key":"12_CR17","volume-title":"Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach","author":"R. Kurshan","year":"1994","unstructured":"Kurshan, R.: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton (1994)"},{"issue":"6","key":"12_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.ipl.2004.10.015","volume":"93","author":"K. Rustan","year":"2005","unstructured":"Rustan, K., Leino, M.: Efficient weakest preconditions. Inf. Process. Lett.\u00a093(6), 281\u2013288 (2005)","journal-title":"Inf. Process. Lett."},{"key":"12_CR19","unstructured":"Liskov, B., Wing, J.: Behavioral subtyping using invariants and constraints. Formal Methods for Distributed Processing, an Object Oriented Approach, pp. 254\u2013280 (2001)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Lynch, N., Tuttle, M.: Hierarchical correctness proofs for distributed algorithms (1987)","DOI":"10.1145\/41840.41852"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-540-24851-4_20","volume-title":"ECOOP 2004 \u2013 Object-Oriented Programming","author":"S. McCamant","year":"2004","unstructured":"McCamant, S., Ernst, M.D.: Early identification of incompatibilities in multi-component upgrades. In: Odersky, M. (ed.) ECOOP 2004. LNCS, vol.\u00a03086, pp. 440\u2013464. Springer, Heidelberg (2004)"},{"key":"12_CR22","volume-title":"Logics and models of concurrent systems","author":"A. Pnueli","year":"1985","unstructured":"Pnueli, A.: In transition from global to modular temporal reasoning about programs. In: Logics and models of concurrent systems. Springer, New York (1985)"},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"R.L. Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Information and Computation\u00a0103(2), 299\u2013347 (1993)","journal-title":"Information and Computation"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-540-24730-2_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Shoham","year":"2004","unstructured":"Shoham, S., Grumberg, O.: Monotonic abstraction-refinement for CTL. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 546\u2013560. Springer, Heidelberg (2004)"},{"key":"12_CR25","unstructured":"Szyperski, C., Gruntz, D., Murer, S.: Component Software - Beyond Object-Oriented Programming. Addison-Wesley, ACM Press (2002)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Components and Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11804192_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T10:54:59Z","timestamp":1555844099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11804192_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540367499","9783540367505"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11804192_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}