{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:47:00Z","timestamp":1764251220511,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":70,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020582"},{"type":"electronic","value":"9783642020599"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02059-9_3","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T12:00:00Z","timestamp":1245240000000},"page":"72-132","source":"Crossref","is-referenced-by-count":13,"title":["Open Bisimulation for Aspects"],"prefix":"10.1007","author":[{"given":"Radha","family":"Jagadeesan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corin","family":"Pitcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Riely","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Aksit, M., Wakita, K., Bosch, J., Bergmans, L., Yonezawa, A.: Abstracting object-interactions using composition-filters. In: Object-based distributed processing. LNCS (1993)","key":"3_CR1"},{"unstructured":"Bergmans, L.: Composing Concurrent Objects - Applying Composition Filters for the Development and Reuse of Concurrent Object-Oriented Programs. Ph.D. thesis, University of Twente (1994)","key":"3_CR2"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-45337-7_18","volume-title":"ECOOP 2001 - Object-Oriented Programming","author":"G. Kiczales","year":"2001","unstructured":"Kiczales, G., Hilsdale, E., Hugunin, J., Kersten, M., Palm, J., Griswold, W.G.: An overview of AspectJ. In: Knudsen, J.L. (ed.) ECOOP 2001. LNCS, vol.\u00a02072, pp. 327\u2013355. Springer, Heidelberg (2001)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/BFb0053381","volume-title":"ECOOP \u201997 - Object-Oriented Programming","author":"G. Kiczales","year":"1997","unstructured":"Kiczales, G., Lamping, J., Mendhekar, A., Maeda, C., Lopes, C.V., Loingtier, J.-M., Irwin, J.: Aspect-oriented programming. In: Aksit, M., Matsuoka, S. (eds.) ECOOP 1997. LNCS, vol.\u00a01241, pp. 220\u2013242. Springer, Heidelberg (1997)"},{"unstructured":"Lieberherr, K.J.: Adaptive Object-Oriented Software: The Demeter method with propagation patterns. PWS Publishing Company (1996)","key":"3_CR5"},{"doi-asserted-by":"crossref","unstructured":"Ossher, H., Tarr, P.: Multi-dimensional separation of concerns and the hyperspace approach. In: Proceedings of the Symposium on Software Architectures and Component Technology: The State of the Art in Software Development (2001)","key":"3_CR6","DOI":"10.1007\/978-1-4615-0883-0_10"},{"unstructured":"Filman, R., Friedman, D.: Aspect-oriented programming is quantification and obliviousness. In: Workshop on Advanced Separation of Concerns (2000)","key":"3_CR7"},{"doi-asserted-by":"crossref","unstructured":"Tarr, P.L., Ossher, H.: Hyper\/J: Multi-dimensional separation of concerns for Java. In: ICSE, pp. 729\u2013730 (2001)","key":"3_CR8","DOI":"10.1145\/337180.337618"},{"doi-asserted-by":"crossref","unstructured":"Coady, Y., Kiczales, G., Feeley, M.J., Smolyn, G.: Using AspectC to improve the modularity of path-specific customization in operating system code. In: ESEC\/SIGSOFT FSE, pp. 88\u201398 (2001)","key":"3_CR9","DOI":"10.1145\/503271.503223"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.scico.2006.01.003","volume":"63","author":"C. Dutchyn","year":"2006","unstructured":"Dutchyn, C., Tucker, D.B., Krishnamurthi, S.: Semantics and scoping of aspects in higher-order languages. Sci. Comput. Program.\u00a063(3), 207\u2013239 (2006)","journal-title":"Sci. Comput. Program."},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/944705.944718","volume-title":"ICFP","author":"D. Walker","year":"2003","unstructured":"Walker, D., Zdancewic, S., Ligatti, J.: A theory of aspects. In: Runciman, C., Shivers, O. (eds.) ICFP, pp. 127\u2013139. ACM, New York (2003)"},{"key":"3_CR12","first-page":"298","volume-title":"LICS","author":"D. Sangiorgi","year":"2004","unstructured":"Sangiorgi, D.: Bisimulation: From the origins to today. In: LICS, pp. 298\u2013302. IEEE Computer Society, Los Alamitos (2004)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/11768869_3","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"D. Sangiorgi","year":"2006","unstructured":"Sangiorgi, D.: The bisimulation proof method: Enhancements and open problems. In: Gorrieri, R., Wehrheim, H. (eds.) FMOODS 2006. LNCS, vol.\u00a04037, pp. 18\u201319. Springer, Heidelberg (2006)"},{"key":"3_CR14","first-page":"9","volume-title":"Higher-Order Operational Techniques in Semantics","author":"A.D. Gordon","year":"1998","unstructured":"Gordon, A.D.: Operational equivalences for untyped and polymorphic object calculi. In: Gordon, A.D., Pitts, A.M. (eds.) Higher-Order Operational Techniques in Semantics, Publications of the Newton Institute, pp. 9\u201354. Cambridge University Press, Cambridge (1998)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1017\/CBO9780511526619.007","volume-title":"Semantics and Logics of Computation","author":"A.M. Pitts","year":"1997","unstructured":"Pitts, A.M.: Operationally-based theories of program equivalence. In: Dybjer, P., Pitts, A.M. (eds.) Semantics and Logics of Computation, Publications of the Newton Institute, pp. 241\u2013298. Cambridge University Press, Cambridge (1997)"},{"doi-asserted-by":"crossref","unstructured":"Sumii, E., Pierce, B.C.: A bisimulation for type abstraction and recursion. J. ACM\u00a054(5) (2007)","key":"3_CR16","DOI":"10.1145\/1284320.1284325"},{"issue":"1-3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2004.03.005","volume":"323","author":"A. Jeffrey","year":"1999","unstructured":"Jeffrey, A., Rathke, J.: A theory of bisimulation for a fragment of concurrent ML with local names. Theor. Comput. Sci.\u00a0323(1-3), 1\u201348 (1999); Preliminary version appeared in IEEE LICS 1999","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Koutavas, V., Wand, M.: Small bisimulations for reasoning about higher-order imperative programs. In: Morrisett and Jones [50], pp. 141\u2013152","key":"3_CR18","DOI":"10.1145\/1111320.1111050"},{"doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Rees, G.D.: Bisimilarity for a first-order calculus of objects with subtyping. In: POPL, pp. 386\u2013395 (1996)","key":"3_CR19","DOI":"10.1145\/237721.237807"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11693024_11","volume-title":"Programming Languages and Systems","author":"V. Koutavas","year":"2006","unstructured":"Koutavas, V., Wand, M.: Bisimulations for untyped imperative objects. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol.\u00a03924, pp. 146\u2013161. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Sieber, K.: Towards fully abstract semantics for local variables. In: POPL, pp. 191\u2013203 (1988)","key":"3_CR21","DOI":"10.1145\/73560.73577"},{"key":"3_CR22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/1062455.1062482","volume-title":"ICSE 2005: Proceedings of the 27th international conference on software engineering","author":"G. Kiczales","year":"2005","unstructured":"Kiczales, G., Mezini, M.: Aspect-oriented programming and modular reasoning. In: ICSE 2005: Proceedings of the 27th international conference on software engineering, pp. 49\u201358. ACM Press, New York (2005)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11531142_7","volume-title":"ECOOP 2005 - Object-Oriented Programming","author":"J. Aldrich","year":"2005","unstructured":"Aldrich, J.: Open modules: Modular reasoning about advice. In: Black, A.P. (ed.) ECOOP 2005. LNCS, vol.\u00a03586, pp. 144\u2013168. Springer, Heidelberg (2005)"},{"key":"3_CR24","first-page":"39","volume-title":"AOSD 2006: Proceedings of the 5th international conference on Aspect-oriented software development","author":"N. Ongkingco","year":"2006","unstructured":"Ongkingco, N., Avgustinov, P., Tibble, J., Hendren, L., de Moor, O., Sittampalam, G.: Adding open modules to AspectJ. In: AOSD 2006: Proceedings of the 5th international conference on Aspect-oriented software development, pp. 39\u201350. ACM Press, New York (2006)"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/11940197_2","volume-title":"Formal Approaches to Software Testing and Runtime Verification","author":"P. Avgustinov","year":"2006","unstructured":"Avgustinov, P., Bodden, E., Hajiyev, E., Hendren, L., Lhot\u00e1k, O., de Moor, O., Ongkingco, N., Sereni, D., Sittampalam, G., Tibble, J.: Aspects for trace monitoring. In: Havelund, K., N\u00fa\u00f1ez, M., Ro\u015fu, G., Wolff, B. (eds.) FATES 2006 and RV 2006. LNCS, vol.\u00a04262, pp. 20\u201339. Springer, Heidelberg (2006)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/11539452_2","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"R. Alur","year":"2005","unstructured":"Alur, R.: The benefits of exposing calls and returns. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 2\u20133. Springer, Heidelberg (2005)"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11779148_1","volume-title":"Developments in Language Theory","author":"R. Alur","year":"2006","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 1\u201313. Springer, Heidelberg (2006)"},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.scico.2006.02.009","volume":"63","author":"C. Clifton","year":"2006","unstructured":"Clifton, C., Leavens, G.T.: MiniMAO: An imperative core language for studying aspect-oriented reasoning. Sci. Comput. Program.\u00a063(3), 321\u2013374 (2006)","journal-title":"Sci. Comput. Program."},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","volume-title":"ECOOP 2003 - Object-Oriented Programming","author":"R. Jagadeesan","year":"2003","unstructured":"Jagadeesan, R., Jeffrey, A., Riely, J.: An untyped calculus of aspect oriented programs. In: Cardelli, L. (ed.) ECOOP 2003. LNCS, vol.\u00a02743, Springer, Heidelberg (2003)"},{"unstructured":"Clifton, C., Leavens, G.T., Wand, M.: Parameterized aspect calculus: A core calculus for the direct study of aspect-oriented languages (2003), http:\/\/www.cs.iastate.edu\/~cclifton\/papers\/TR03-13.pdf","key":"3_CR30"},{"key":"3_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8598-9","volume-title":"A Theory of Objects","author":"M. Abadi","year":"1996","unstructured":"Abadi, M., Cardelli, L.: A Theory of Objects. Springer, Heidelberg (1996)"},{"key":"3_CR32","first-page":"59","volume-title":"ICSE","author":"H. Rajan","year":"2005","unstructured":"Rajan, H., Sullivan, K.J.: Classpects: unifying aspect- and object-oriented language design. In: Roman, G.-C., Griswold, W.G., Nuseibeh, B. (eds.) ICSE, pp. 59\u201368. ACM, New York (2005)"},{"issue":"5","key":"3_CR33","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1145\/1018203.1018208","volume":"26","author":"M. Wand","year":"2004","unstructured":"Wand, M., Kiczales, G., Dutchyn, C.: A semantics for advice and dynamic join points in aspect-oriented programming. TOPLAS\u00a026(5), 890\u2013910 (2004)","journal-title":"TOPLAS"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-36579-6_4","volume-title":"Compiler Construction","author":"H. Masuhara","year":"2003","unstructured":"Masuhara, H., Kiczales, G., Dutchyn, C.: A compilation and optimization model for aspect-oriented programs. In: Hedin, G. (ed.) CC 2003. LNCS, vol.\u00a02622, pp. 46\u201360. Springer, Heidelberg (2003)"},{"issue":"3","key":"3_CR35","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.scico.2006.01.004","volume":"63","author":"J. Ligatti","year":"2006","unstructured":"Ligatti, J., Walker, D., Zdancewic, S.: A type-theoretic interpretation of pointcuts and advice. Sci. Comput. Program.\u00a063(3), 240\u2013266 (2006)","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"3_CR36","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.scico.2006.02.008","volume":"63","author":"R. Jagadeesan","year":"2006","unstructured":"Jagadeesan, R., Jeffrey, A., Riely, J.: Typed parametric polymorphism for aspects. Sci. Comput. Program.\u00a063(3), 267\u2013296 (2006)","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"3_CR37","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10515-005-2643-9","volume":"12","author":"H.C. Li","year":"2005","unstructured":"Li, H.C., Krishnamurthi, S., Fisler, K.: Modular verification of open features using three-valued model checking. Autom. Softw. Eng.\u00a012(3), 349\u2013382 (2005)","journal-title":"Autom. Softw. Eng."},{"unstructured":"Sihman, M., Katz, S.: Model checking applications of aspects and superimpositions. In: Foundations of Aspect Languages (2003)","key":"3_CR38"},{"key":"3_CR39","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/508386.508405","volume-title":"AOSD 2002: Proceedings of the 1st international conference on Aspect-oriented software development","author":"N. Ubayashi","year":"2002","unstructured":"Ubayashi, N., Tamai, T.: Aspect-oriented programming with model checking. In: AOSD 2002: Proceedings of the 1st international conference on Aspect-oriented software development, pp. 148\u2013154. ACM Press, New York (2002)"},{"doi-asserted-by":"crossref","unstructured":"Dantas, D.S., Walker, D.: Harmless advice. In: Morrisett and Jones [50], pp. 383\u2013396","key":"3_CR40","DOI":"10.1145\/1111320.1111071"},{"unstructured":"Nakajima, S., Tamai, T.: Lightweight formal analysis of aspect-oriented models. In: UML 2004 Workshop on Aspect-Oriented Modeling (2004)","key":"3_CR41"},{"issue":"2","key":"3_CR42","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S., Ong, C.-H.L.: Full abstraction in the lazy lambda calculus. Inf. Comput.\u00a0105(2), 159\u2013267 (1993)","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Gordon, A.D.: Bisimilarity as a theory of functional programming. Electr. Notes Theor. Comput. Sci.\u00a01 (1995)","key":"3_CR43","DOI":"10.1016\/S1571-0661(04)80013-6"},{"issue":"2","key":"3_CR44","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D.J. Howe","year":"1996","unstructured":"Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Inf. Comput.\u00a0124(2), 103\u2013112 (1996)","journal-title":"Inf. Comput."},{"issue":"1-3","key":"3_CR45","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.tcs.2006.12.032","volume":"375","author":"E. Sumii","year":"2007","unstructured":"Sumii, E., Pierce, B.C.: A bisimulation for dynamic sealing. Theor. Comput. Sci.\u00a0375(1-3), 169\u2013192 (2007)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Koutavas, V., Wand, M.: Proving class equivalence (submitted for publication) (July 2006)","key":"3_CR46"},{"key":"3_CR47","first-page":"293","volume-title":"LICS","author":"D. Sangiorgi","year":"2007","unstructured":"Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: LICS, pp. 293\u2013302. IEEE Computer Society, Los Alamitos (2007)"},{"issue":"1","key":"3_CR48","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Inf.\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Inf."},{"key":"3_CR49","first-page":"345","volume-title":"LICS","author":"S. Lassen","year":"2005","unstructured":"Lassen, S.: Eager normal form bisimulation. In: LICS, pp. 345\u2013354. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"3_CR50","first-page":"297","volume-title":"LICS","author":"S.B. Lassen","year":"2006","unstructured":"Lassen, S.B.: Head normal form bisimulation for pairs and the \u03bb\u03bc-calculus. In: LICS, pp. 297\u2013306. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"3_CR51","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/1190216.1190244","volume-title":"POPL","author":"K. St\u00f8vring","year":"2007","unstructured":"St\u00f8vring, K., Lassen, S.B.: A complete, co-inductive syntactic theory of sequential control and state. In: Hofmann, M., Felleisen, M. (eds.) POPL, pp. 161\u2013172. ACM, New York (2007)"},{"issue":"2","key":"3_CR52","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Inf. Comput.\u00a0163(2), 409\u2013470 (2000)","journal-title":"Inf. Comput."},{"issue":"2","key":"3_CR53","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J.M.E. Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II, and III. Inf. Comput.\u00a0163(2), 285\u2013408 (2000)","journal-title":"Inf. Comput."},{"key":"3_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-74915-8_23","volume-title":"Computer Science Logic","author":"S.B. Lassen","year":"2007","unstructured":"Lassen, S.B., Levy, P.B.: Typed normal form bisimulation. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 283\u2013297. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Bockisch, C., Haupt, M., Mezini, M., Ostermann, K.: Virtual machine support for dynamic join points. In: AOSD, pp. 83\u201392 (2004)","key":"3_CR55","DOI":"10.1145\/976270.976282"},{"key":"3_CR56","volume-title":"Types and Programming Languages","author":"B.C. Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"3_CR57","first-page":"78","volume-title":"Glasgow functional programming workshop","author":"A.D. Gordon","year":"1994","unstructured":"Gordon, A.D.: A tutorial on co-induction and functional programming. In: Glasgow functional programming workshop, pp. 78\u201395. Springer, Heidelberg (1994)"},{"issue":"1","key":"3_CR58","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Information and Computation\u00a093(1), 55\u201392 (1991)","journal-title":"Information and Computation"},{"issue":"3","key":"3_CR59","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","volume":"52","author":"M. Felleisen","year":"1987","unstructured":"Felleisen, M., Friedman, D.P., Kohlbecker, E., Duba, B.: A syntactic theory of sequential control. Theor. Comput. Sci.\u00a052(3), 205\u2013237 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"3_CR60","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. De Nicola","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science\u00a034(1-2), 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"key":"3_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-540-31987-0_29","volume-title":"Programming Languages and Systems","author":"A. Jeffrey","year":"2005","unstructured":"Jeffrey, A., Rathke, J.: Java Jr: Fully abstract trace semantics for a core Java language. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 423\u2013438. Springer, Heidelberg (2005)"},{"unstructured":"Morris, J.H.: Lambda-Calculus Models of Programming Languages. PhD thesis, MIT (December 1968)","key":"3_CR62"},{"unstructured":"Abadi, M., Fournet, C.: Access control based on execution history. In: Proceedings of the Network and Distributed System Security Symposium Conference (2003)","key":"3_CR63"},{"unstructured":"Boebert, W.E., Kain, R.Y.: A practical alternative to hierarchical integrity policies. In: Proceedings of the Eighth National Computer Security Conference (1985)","key":"3_CR64"},{"unstructured":"Walker, K.M., Sterne, D.F., Badger, M.L., Petkac, M.J., Shermann, D.L., Oostendorp, K.A.: Confining root programs with Domain and Type Enforcement (DTE). In: Proceedings of the Sixth USENIX UNIX Security Symposium (1996)","key":"3_CR65"},{"unstructured":"Loscocco, P.A., Smalley, S.D.: Meeting critical security objectives with Security-Enhanced Linux. In: Proceedings of the 2001 Ottawa Linux Symposium (2001)","key":"3_CR66"},{"unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First Order and Higher Order Paradigms. PhD thesis, University of Edinburgh (1993)","key":"3_CR67"},{"key":"3_CR68","volume-title":"Communication and concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and concurrency. Prentice-Hall, Inc., Upper Saddle River (1989)"},{"issue":"4","key":"3_CR69","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"Landin, P.J.: The mechanical evaluation of expressions. Computer Journal\u00a06(4), 308\u2013320 (1964)","journal-title":"Computer Journal"},{"volume-title":"Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006","year":"2006","unstructured":"Morrisett, J.G., Jones, S.L.P. (eds.): Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, January 11-13, 2006. ACM, New York (2006)","key":"3_CR70"}],"container-title":["Lecture Notes in Computer Science","Transactions on Aspect-Oriented Software Development V"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02059-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T05:35:29Z","timestamp":1739165729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02059-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020582","9783642020599"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02059-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}