{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:32:57Z","timestamp":1742401977586},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439974"},{"type":"electronic","value":"9783540456575"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45657-0_35","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T10:59:43Z","timestamp":1179572383000},"page":"428-441","source":"Crossref","is-referenced-by-count":34,"title":["Interface Compatibility Checking for Software Modules"],"prefix":"10.1007","author":[{"given":"Arindam","family":"Chakrabarti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"de Alfaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Jurdzi\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Freddy Y. C.","family":"Mang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"35_CR1","unstructured":"S. Abramsky. Semantics of Interaction. Lecture Notes, Oxford University, 2002."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur et al. jMocha: A model-checking tool that exploits design structure. Proc. Int. Conf. Software Engineering, pp. 835\u2013836. IEEE, 2001.","DOI":"10.1109\/ICSE.2001.919196"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/258077.258078","volume":"6","author":"R. Allen","year":"1997","unstructured":"R. Allen and D. Garlan. A formal basis for architectural connection. ACM Trans. Software Engineering &Methodology, 6:213\u2013249, 1997.","journal-title":"ACM Trans. Software Engineering &Methodology"},{"key":"35_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"Concurrency Theory","author":"A. Boujjani","year":"1997","unstructured":"A. Boujjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. Concurrency Theory, LNCS 1243, pp. 135\u2013150. Springer, 1997."},{"key":"35_CR5","first-page":"38","volume":"16","author":"A. Beugnard","year":"1999","unstructured":"A. Beugnard, J.-M. J\u00e9z\u00e9quel, N. Plouzeau, and D. Watkins. Making components contract aware. IEEE Software, 16:38\u201345, 1999.","journal-title":"IEEE Software"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"L. de Alfaro and T. A. Henzinger. Interface automata. Proc. Symp. Foundations of Software Engineering, pp. 109\u2013120. ACM, 2001.","DOI":"10.1145\/503209.503226"},{"key":"35_CR7","series-title":"Lect Notes Comput Sci","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":"L. de Alfaro and T. A. Henzinger. Interface theories for component-based design. Embedded Software, LNCS 2211, pp. 148\u2013165. Springer, 2001."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"R. DeLine and M. F\u00e4hndrich. Enforcing high-level protocols in low-level software. Proc. Conf. Programming Language Design &Implementation, pp. 59\u201369. ACM, 2001.","DOI":"10.1145\/381694.378811"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits. MIT Press, 1989.","DOI":"10.7551\/mitpress\/6874.001.0001"},{"key":"35_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-44585-4_30","volume-title":"Computer-Aided Verification","author":"J. Esparza","year":"2001","unstructured":"J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. Computer-Aided Verification, LNCS 2102, pp. 324\u2013336. Springer, 2001."},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"R. B. Findler, M. Latendresse, and M. Felleisen. Behavioral contracts and behavioral subtyping. Proc. Symp. Foundations of Software Engineering, pp. 229\u2013236. ACM, 2001.","DOI":"10.1145\/503209.503240"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"J. Foster, M. F\u00e4ndrich, and A. Aiken. A theory of type qualifiers. Proc. Conf. Programming Language Design & Implementation, pp. 192\u2013203. ACM, 1999.","DOI":"10.1145\/301631.301665"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, and K. Pister. System architecture directions for networked sensors. Proc. Conf. Architectural Support for Programming Languages & Operating Systems, pp. 93\u2013104. ACM, 2000.","DOI":"10.1145\/378993.379006"},{"key":"35_CR14","unstructured":"J. R. Larus, S. K. Rajamani, and J. Rehof. Behavioral Types for Structured Asynchronous Programming. Technical Report, Microsoft Research, 2001."},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/MS.1985.230345","volume":"2","author":"D. C. Luckham","year":"1985","unstructured":"D. C. Luckham and F. von Henke. An overview of Anna, a specification language for Ada. IEEE Software, 2:9\u201323, 1985.","journal-title":"IEEE Software"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1145\/355602.361309","volume":"15","author":"D. L. Parnas","year":"1972","unstructured":"D. L. Parnas. A technique for software module specification with examples. Communications of the ACM, 15:330\u2013336, 1972.","journal-title":"Communications of the ACM"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/32.341844","volume":"21","author":"D. S. Rosenblum","year":"1995","unstructured":"D. S. Rosenblum. A practical approach to programming with assertions. IEEE Trans. Software Engineering, 21:19\u201331, 1995.","journal-title":"IEEE Trans. Software Engineering"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"I. Walukiewicz. Pushdown processes: Games and model checking. Information and Computation, 164:234\u2013263, 2001.","journal-title":"Information and Computation"},{"key":"35_CR19","unstructured":"F. Somenzi. CUDD: CU decision diagram package. Technical Report, University of Colorado at Boulder, 1997."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45657-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T01:21:21Z","timestamp":1556414481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45657-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439974","9783540456575"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45657-0_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}