{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T23:40:03Z","timestamp":1736034003382,"version":"3.32.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2005,10,14]],"date-time":"2005-10-14T00:00:00Z","timestamp":1129248000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s00236-005-0180-4","type":"journal-article","created":{"date-parts":[[2005,10,15]],"date-time":"2005-10-15T01:03:12Z","timestamp":1129338192000},"page":"349-388","source":"Crossref","is-referenced-by-count":5,"title":["A general framework for types in graph rewriting"],"prefix":"10.1007","volume":"42","author":[{"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,14]]},"reference":[{"key":"180_CR1","doi-asserted-by":"crossref","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: A static analysis technique for graph transformation systems. In Proc. of CONCUR '01, pp. 381\u2013395. Springer-Verlag, LNCS 2154 (2001)","DOI":"10.1007\/3-540-44685-0_26"},{"key":"180_CR2","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.K.: The SLAM project: debugging system software via static analysis. In Proc. of POPL '02, pp. 1\u20133. ACM (2002)","DOI":"10.1145\/503272.503274"},{"key":"180_CR3","doi-asserted-by":"crossref","unstructured":"Barendregt, H.P., van Eekelen, M.C.J.D., Glauert, J.R.W., Kennaway, R., Plasmeijer, M.J., Sleep, M.R.: Term graph rewriting. In Proc. of PARLE '87, Volume 2, pp. 141\u2013158. Springer, LNCS 259 (1987)","DOI":"10.1007\/3-540-17945-3_8"},{"key":"180_CR4","unstructured":"Barr, M., Wells, C.: Category Theory for Computing Science. Prentice Hall (1990)"},{"key":"180_CR5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"Bauderon, M., Courcelle, B.: Graph expressions and graph rewritings. Mathematical Systems Theory, 20, 83\u2013127 (1987)","journal-title":"Mathematical Systems Theory"},{"key":"180_CR6","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Gordon, A.D.: Types for mobile ambients. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages, pp. 79\u201392. ACM (1999)","DOI":"10.1145\/292540.292550"},{"key":"180_CR7","doi-asserted-by":"crossref","unstructured":"Chaki, S., Clarke, E., Groce, A., Jha, S., Veith, H.: Modular verification of software components in C. In Proc. of ICSE '03 (25th International Conference on Software Engineering), pp. 385\u2013395. IEEE Computer Society (2003)","DOI":"10.1109\/ICSE.2003.1201217"},{"issue":"3\/4","key":"180_CR8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A. Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae 26(3\/4), 241\u2013265 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"180_CR9","doi-asserted-by":"crossref","unstructured":"Cousot, P.: Abstract interpretation. ACM Computing Surveys 28(2) (1996)","DOI":"10.1145\/234528.234740"},{"key":"180_CR10","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. of POPL '77 (Los Angeles, California), pp. 238\u2013252. ACM (1977)","DOI":"10.1145\/512950.512973"},{"key":"180_CR11","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In Proc. of POPL '79 (San Antonio, Texas), pp. 269\u2013282. ACM Press (1979)","DOI":"10.1145\/567752.567778"},{"key":"180_CR12","doi-asserted-by":"crossref","unstructured":"Ehrig, H.: Introduction to the algebraic theory of graph grammars. In Proc. 1st International Workshop on Graph Grammars, pp. 1\u201369. Springer-Verlag, LNCS 73 (1979)","DOI":"10.1007\/BFb0025714"},{"key":"180_CR13","doi-asserted-by":"crossref","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting. In Proc. of FOSSACS '04, pp. 151\u2013166. Springer, LNCS 2987 (2004)","DOI":"10.1007\/978-3-540-24727-2_12"},{"key":"180_CR14","doi-asserted-by":"crossref","unstructured":"Fradet, P., Le M\u00e9tayer, D.: Shape types. In Proc. of POPL '97, pp. 27\u201339. ACM (1997)","DOI":"10.1145\/263699.263706"},{"key":"180_CR15","doi-asserted-by":"crossref","unstructured":"Gadducci, F., Heckel, R.: An inductive view of graph transformation. In Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT '97, pp. 223\u2013237. Springer-Verlag, LNCS 1376 (1997)","DOI":"10.1007\/3-540-64299-4_36"},{"issue":"2","key":"180_CR16","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0304-3975(01)00362-0","volume":"285","author":"F. Gadducci","year":"2002","unstructured":"Gadducci, F., Montanari, U.: Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoretical Computer Science 285(2), 319\u2013358 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"180_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0304-3975(98)00355-7","volume":"228","author":"P. Gardner","year":"1999","unstructured":"Gardner, P.: Closed action calculi. Theoretical Computer Science 228(1\u20132), 77\u2013103 (1999)","journal-title":"Theoretical Computer Science"},{"key":"180_CR18","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. Springer-Verlag, LNCS 643 (1992)"},{"key":"180_CR19","doi-asserted-by":"crossref","unstructured":"Hatcliff, J., Dwyer, M.: Using the Bandera tool set to model-check properties of concurrent Java software. In Proc. of CONCUR 2001, pp. 39\u201358. Springer, LNCS 2154 (2001)","DOI":"10.1007\/3-540-44685-0_5"},{"key":"180_CR20","doi-asserted-by":"crossref","unstructured":"Honda, K.: Composing processes. In Proc. of POPL'96, pp. 344\u2013357. ACM (1996)","DOI":"10.1145\/237721.237802"},{"key":"180_CR21","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Kobayashi, N.: A generic type system for the pi-calculus. In Proc. of POPL '01, pp. 128\u2013141. ACM (2001)","DOI":"10.1145\/360204.360215"},{"key":"180_CR22","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.: A fully abstract semantics for concurrent graph reduction. In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science, pp. 128\u2013131 (1994)","DOI":"10.1109\/LICS.1994.316084"},{"key":"180_CR23","doi-asserted-by":"crossref","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and transitions. In Proc. of POPL 2003, pp. 38\u201349. ACM (2003)","DOI":"10.1145\/604131.604135"},{"key":"180_CR24","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, B.: Generating type systems for process graphs. In Proc. of CONCUR '99, pp. 352\u2013367. Springer-Verlag, LNCS 1664 (1999)","DOI":"10.1007\/3-540-48320-9_25"},{"key":"180_CR25","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, B.: A general framework for types in graph rewriting. In Proc. of FST TCS '00, pp. 373\u2013384. Springer-Verlag, LNCS 1974 (2000)","DOI":"10.1007\/3-540-44450-5_30"},{"key":"180_CR26","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, B.: A general framework for types in graph rewriting. Technical Report TUM-I0014, Technische Universit\u00e4t M\u00fcnchen (2000)","DOI":"10.1007\/3-540-44450-5_30"},{"key":"180_CR27","unstructured":"K\u00f6nig, B.: A graph rewriting semantics for the polyadic \u03c0-calculus. In Workshop on Graph Transformation and Visual Modeling Techniques (Geneva, Switzerland), ICALP Workshops '00, pp. 451\u2013458. Carleton Scientific (2000)"},{"key":"180_CR28","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, B.: Analysing input\/output-capabilities of mobile processes with a generic type system. In Proc. of ICALP '00, pp. 403\u2013414. Springer-Verlag, LNCS 1853 (2000)","DOI":"10.1007\/3-540-45022-X_34"},{"key":"180_CR29","unstructured":"K\u00f6nig, B.: Hypergraph construction and its application to the compositional modelling of concurrency. In GRATRA '00: Joint APPLIGRAPH\/GETGRATS Workshop on Graph Transformation Systems, Proceedings available as Report Nr. 2000-2 (Technische Universit\u00e4t Berlin) (2000)"},{"issue":"2","key":"180_CR30","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1017\/S0960129501003486","volume":"12","author":"B. K\u00f6nig","year":"2002","unstructured":"K\u00f6nig, B.: Hypergraph construction and its application to the static analysis of concurrent systems. Mathematical Structures in Computer Science 12(2), 149\u2013175 (2002)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"180_CR31","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.jlap.2004.01.004","volume":"63","author":"B. K\u00f6nig","year":"2005","unstructured":"K\u00f6nig, B.: Analysing input\/output-capabilities of mobile processes with a generic type system. Journal of Logic and Algebraic Programming 63(1), 35\u201358 (2005)","journal-title":"Journal of Logic and Algebraic Programming"},{"issue":"5","key":"180_CR32","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1145\/330249.330251","volume":"21","author":"N. Kobayashi","year":"1999","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. ACM Transactions on Programming Languages and Systems 21(5), 914\u2013947 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"180_CR33","doi-asserted-by":"crossref","unstructured":"Lafont, Y.: Interaction nets. In Proc. of POPL '90, pp. 95\u2013108. ACM Press (1990)","DOI":"10.1145\/96709.96718"},{"key":"180_CR34","doi-asserted-by":"crossref","unstructured":"Leifer, J.J.: Operational congruences for reactive systems. PhD thesis, University of Cambridge Computer Laboratory, September (2001)","DOI":"10.1007\/3-540-44618-4_19"},{"key":"180_CR35","doi-asserted-by":"crossref","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Springer-Verlag (1971)","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"180_CR36","unstructured":"Milner, R.: The polyadic \u03c0-calculus: a tutorial. Tech. Rep. ECS-LFCS-91-180, University of Edinburgh, Laboratory for Foundations of Computer Science (1991)"},{"key":"180_CR37","unstructured":"Mitchell, J.C.: Foundations for Programming Languages. MIT Press (1996)"},{"key":"180_CR38","doi-asserted-by":"crossref","unstructured":"Montanari, U., Pistore, M.: \u03c0-calculus, structured coalgebras, and minimal hd-automata. In Proc. of MFCS '00, pp. 569\u2013578. Springer-Verlag, LNCS 1893 (2000)","DOI":"10.1007\/3-540-44612-5_52"},{"key":"180_CR39","doi-asserted-by":"crossref","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer-Verlag (1999)","DOI":"10.1007\/978-3-662-03811-6"},{"key":"180_CR40","doi-asserted-by":"crossref","unstructured":"Pierce, B., Sangiorgi, D.: Typing and subtyping for mobile processes. In Proc. of LICS '93, pp. 376\u2013385 (1993)","DOI":"10.1109\/LICS.1993.287570"},{"issue":"5","key":"180_CR41","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S096012950007002X","volume":"6","author":"B. Pierce","year":"1996","unstructured":"Pierce, B., Sangiorgi, D.: Typing and subtyping for mobile processes. Journal of Mathematical Structures in Computer Science 6(5), 409\u2013454 (1996)","journal-title":"Journal of Mathematical Structures in Computer Science"},{"key":"180_CR42","unstructured":"Rensink, A.: Model checking graph grammars. In Proc. of AVOCS '03 (Workshop on Automated Verification of Critical Systems) (2003)"},{"issue":"1","key":"180_CR43","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. Journal of the ACM 12(1), 23\u201341 (1965)","journal-title":"Journal of the ACM"},{"key":"180_CR44","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., editor: Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1: Foundations, volume 1. World Scientific (1997)","DOI":"10.1142\/3303"},{"issue":"3","key":"180_CR45","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"M. Sagiv","year":"2002","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. TOPLAS (ACM Transactions on Programming Languages and Systems) 24(3), 217\u2013298 (2002)","journal-title":"TOPLAS (ACM Transactions on Programming Languages and Systems)"},{"key":"180_CR46","doi-asserted-by":"crossref","unstructured":"Visser, W., Havelund, K., Brat, G.P., Park, S.: Model checking programs. In Proc. of ASE '00 (International Conference on Automated Software Engineering), pp. 3\u201312. IEEE (2000)","DOI":"10.1109\/ASE.2000.873645"},{"key":"180_CR47","unstructured":"Wadsworth, C.P.: Semantics and Pragmatics of the Lambda Calculus. PhD thesis, Oxford University, September (1971)"},{"key":"180_CR48","unstructured":"Yoshida, N.: Graph notation for concurrent combinators. In Proc. of TPPP '94. Springer-Verlag, LNCS 907 (1994)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0180-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-005-0180-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0180-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T23:15:39Z","timestamp":1736032539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-005-0180-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,14]]},"references-count":48,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["180"],"URL":"https:\/\/doi.org\/10.1007\/s00236-005-0180-4","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2005,10,14]]}}}