{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:43Z","timestamp":1725455923001},"publisher-location":"Berlin, Heidelberg","reference-count":61,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023444","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:06:33Z","timestamp":1132383993000},"page":"1-20","source":"Crossref","is-referenced-by-count":18,"title":["Unifying models"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Steffen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"H. Andersen: Model Checking and Boolean Graphs, Proc. of ESOP '92, LNCS 582, Springer, 1992.","DOI":"10.1007\/3-540-55253-7_1"},{"key":"1_CR2","first-page":"102","volume-title":"Method Integration and Abstraction from Detailed Semantics to Improve Software Quality","author":"M. Beeck von der","year":"1994","unstructured":"M. von der Beeck: Method Integration and Abstraction from Detailed Semantics to Improve Software Quality, Proc. 1st Int. Worksh. on Requirements Engineering: Foundation of Software Quality REFSQ'94, Augustinus Buchh., Aachen, pp. 102\u2013111, 1994"},{"key":"1_CR3","unstructured":"T. Bolognesi, M. Caneve: Squiggles: A tool for the analysis of LOTOS specifications, in K. Turner Ed., Formal Description Techniques, pp. 201\u2013216, North-Holland, 1989."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"G. Boudol, V. Roy, R. de Simone, D. Vergamini: Process calculi, from theory to practice: Verification tools, Rapport de Recherche RR1098, INRIA, 1989.","DOI":"10.1007\/3-540-52148-8_1"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"M. Broy: Towards a Formal Foundation of the Specification and Description Language SDL, Formal Aspects of Computing, vol. 3, 1991.","DOI":"10.1007\/BF01211434"},{"key":"1_CR6","unstructured":"British Standards Institution: VDM Specification Language \u2014 Proto-Standard, Technical Report, BSI ist\/5\/50 N-231, 1991."},{"key":"1_CR7","first-page":"123","volume-title":"LNCS 630","author":"O. Burkart","year":"1992","unstructured":"O. Burkart, B. Steffen: Model Checking for Context-Free Processes, Proc. CONCUR '92, Stony Brook (NJ), Aug. 1992, LNCS 630, pp. 123\u2013137, Springer."},{"key":"1_CR8","first-page":"98","volume-title":"LNCS 836","author":"O. Burkart","year":"1994","unstructured":"O. Burkart, B. Steffen: Pushdown Processes: Parallel Composition and Model Checking, Proc. CONCUR '94, Uppsala (Sweden), August 1994, LNCS 836, pp. 98\u2013113, Springer."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"K. Cerans, J. Godskesen, K. Larsen: Timed Modal Specification \u2014 Theory and Tools, Proc. CAV, LNCS 697, Springer, pp. 253\u2013267, 1993.","DOI":"10.1007\/3-540-56922-7_21"},{"issue":"No.1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland, J. Parrow, B. Steffen: The Concurrency Workbench: A Semantics-Based Verification Tool for Finite State Systems, ACM TOPLAS, Vol. 15, No. 1, pp. 36\u201372, 1993.","journal-title":"ACM TOPLAS"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"E. Clarke, J.M. Wing: Position Statement of the Formal Methods Working Group, ACM Worksh. on Strategic Directions in Computing Research, Boston (USA), June 14\u201315 1996. ACM Computing Surveys, 28(4), Dec. 1996.","DOI":"10.1145\/242223.242257"},{"key":"1_CR12","unstructured":"G. Doumenc, E. Madelaine, R. de Simone: Proving process calculi translations in ECRINS: The PureLotos-> Meije example, Rapport de recherche RR1192, INRIA, 1990."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"R. Elmstrom, R. Lintulampi, M. Pezz\u00e9: Giving Semantics to SA\/RT by Means of High-Level Timed Petri Nets, Real-Time Systems, Vol. 5, pp. 249\u2013271, Academic Publishing, 1993.","DOI":"10.1007\/BF01088591"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"E.A. Emerson: Temporal and Modal Logic, In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, p. 995\u20131072, MIT Press\/Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"P. Fencott, A. Galloway, M. Lockyer, S. O'Brien, S. Pearson: Formalising the Semantics of Ward\/Mellor SA\/RT Essential Models using a Process Algebra, Proc. FME'94, LNCS 873, pp. 681\u2013702, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58555-9_122"},{"issue":"no.5","key":"1_CR16","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1109\/32.90448","volume":"17","author":"M. Fraser","year":"1991","unstructured":"M. Fraser, K. Kumar, V. Vaishnavi: Informal and Formal Requirements Specification Languages: Bridging the Gap, IEEE Transact. on Softw. Eng., vol. 17, no. 5, pp. 454\u2013466, 1991.","journal-title":"IEEE Transact. on Softw. Eng."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"D. Harel: Statecharts: A visual formalism for complex systems, Science of Computer Programming, Vol. 8, pp. 231\u2013274, 1987.","journal-title":"Science of Computer Programming"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"T. Henzinger, P. Ho, H. Wong-Toi: A User Guide to HyTech, Proc. TACAS'95, LNCS 1019, Springer, pp. 41\u201371, 1995.","DOI":"10.1007\/3-540-60630-0_3"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"C. Hoare: Communicating Sequential Processes, Prentice-Hall Int., 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"1_CR20","first-page":"169","volume-title":"LNCS 818","author":"H. Hungar","year":"1994","unstructured":"H. Hungar: Model Checking of Macro Processes, Proc. of CAV'94, Palo Alto (CA), June 1994, LNCS 818, Springer, pp.169\u2013181."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"D. Jackson, S. Jha, C.A. Damon: Faster checking of software specifications by eliminating isomorphs, Proc. ACM POPL'96, St. Petersburg Beach, FL (USA), Jan. 1996.","DOI":"10.1145\/237721.237733"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"N.D. Jones, F. Nielson. Abstract Interpretation: A Semantics-Based Tool for Program Analysis. In Handbook of Logics in Computer Science, Vol. 4, pp. 527\u2013637, Oxford University Press, 1995.","DOI":"10.1093\/oso\/9780198537809.003.0005"},{"key":"1_CR23","first-page":"89","volume-title":"LNCS 1019","author":"J. Henriksen","year":"1995","unstructured":"J. Henriksen, J. Jensen, M. J\u00f8rgensen N. Klarlund, R. Paige, T. Rauhe, A. Sandholm: \u201cMona: Monadic second-order logic in practice,\u201d Proc. of TACAS'95, \u00c5rhus (DK), May 1995, LNCS 1019, Springer, pp. 89\u2013110."},{"key":"1_CR24","volume-title":"LNCS","author":"P. Kelb","year":"1997","unstructured":"P. Kelb, T. Margaria, M. Mendler, C. Gsottberger: \u201cMosel: A Flexible Toolset for Monadic Second-Order Logic,\u201d Appears at TACAS'97, Enschede (NL), April 1997, LNCS, Springer."},{"key":"1_CR25","volume-title":"PhD thesis","author":"J. Knoop","year":"1993","unstructured":"J. Knoop: Optimal Interprocedural Program Optimization: A new Frame-work and its Application, PhD thesis, Dep. of Computer Science, Univ. of Kiel, Germany, 1993. To appear as LNCS monograph, Springer."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"J. Knoop, O. R\u00fcthing, B. Steffen. Partial Dead Code Elimination, ACM SIGPLAN PLDI Conf.'94, ACM SIGPLAN Notices 29, Orlando, June 1994.","DOI":"10.1145\/178243.178256"},{"key":"1_CR27","unstructured":"J. Knoop, O. R\u00fcthing, B. Steffen: A Tool Kit for Constructing Optimal Interprocedural Data Flow Analyses, appears in Journal of Programming Languages, Chapman & Hall"},{"key":"1_CR28","first-page":"264","volume-title":"LNCS 1019","author":"J. Knoop","year":"1995","unstructured":"J. Knoop. B. Steffen. J. Vollmer: Parallelism for Free: bitvector analyses \u21d2 no state explosion! TACAS'95, Selected Papers, Aarhus (DK), LNCS 1019, pp. 264\u2013290, Springer, 1995."},{"issue":"3","key":"1_CR29","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/229542.229545","volume":"18","author":"J. Knoop","year":"1996","unstructured":"J. Knoop. B. Steffen. J. Vollmer: Parallelism for free: Efficient and optimal bitvector analyses for parallel programs, ACM TOPLAS, Vol. 18, 3 (1996), pp.268\u2013299.","journal-title":"ACM TOPLAS"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen. Results on the Propositional mu-Calculus. TCS 27, 333\u2013354, 1983","journal-title":"TCS"},{"key":"1_CR31","volume-title":"Technical Report R 89-19","author":"K.G. Larsen","year":"1989","unstructured":"K.G. Larsen, J.C. Godskesen, M. Zeeberg: TAV, tools for automatic verification, user manual, Technical Report R 89-19, Department of Mathematics and Computer Science, \u00c5lborg University (DK), 1989."},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"K.G. Larsen: Efficient Local Correctness Checking, Proc. of CAV'92, Montreal (CAN), LNCS 663, pp. 410\u2013422, Springer.","DOI":"10.1007\/3-540-56496-9_4"},{"key":"1_CR33","unstructured":"E. Madelaine: Verification tools from the Concur project, EATCS Bulletin, Vol. 47, 1992."},{"issue":"N.1","key":"1_CR34","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/357233.357237","volume":"6","author":"Z. Manna","year":"1984","unstructured":"Z. Manna, P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications, ACM TOPLAS Vol.6, N.1, Jan. 1984, pp.68\u201393.","journal-title":"ACM TOPLAS"},{"key":"1_CR35","unstructured":"R. Milner: Communication and Concurrency, Prentice-Hall, 1989."},{"key":"1_CR36","unstructured":"P.D. Mosses: Action Semantics, Cambridge Tracts in Theoretical Computer Science, Vol. 26, Cambridge Univ. Press, 1992."},{"key":"1_CR37","volume-title":"Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems","author":"J. Malhotra","year":"1988","unstructured":"J. Malhotra, S.A. Smolka, A. Giacalone, R. Shapiro: Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems, Work. on Specification and Verification of Concurrent Systems, Univ. of Stirling, Scotland, 1988."},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"X. Nicollin, A. Olivero, J. Sifakis, S. Yovine: An Approach to the Description and Analysis of Hybrid Systems, Proc. Work. on Theory of Hybrid Systems, LNCS 736, Springer, pp. 149\u2013178, 1993.","DOI":"10.1007\/3-540-57318-6_28"},{"key":"1_CR39","volume-title":"DAIMI FN-19","author":"G. Plotkin","year":"1981","unstructured":"G. Plotkin: A Structural Approach to Operational Semantics, University of Aarhus (DK), DAIMI FN-19, 1981."},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"W. Reisig: Petri Nets. An Introduction., Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-69968-9"},{"key":"1_CR41","volume-title":"LNCS 962","author":"B. Steffen","year":"1995","unstructured":"B. Steffen, A. Cla\u00dfen, M. Klein, J. Knoop, T. Margaria: The Fixpoint Analysis Machine, (invited paper) to CONCUR'95, Pittsburgh (USA), August 1995, LNCS 962, Springer."},{"key":"1_CR42","first-page":"518","volume":"1051","author":"L. Shi","year":"1996","unstructured":"L. Shi, P. Nixon: An Improved Translation of SA\/RT Specification Model to High-Level Timed Petri Nets, Proc. FME'96, LNCS 1051, pp. 518\u2013537, 1996.","journal-title":"LNCS"},{"issue":"3","key":"1_CR43","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"A.P. Sistla, E.M. Clarke. The Complexity of the Propositional Linear Temporal Logics, Journal of the ACM, Vol.32, 3, July 1985, pp.733\u2013749.","journal-title":"Journal of the ACM"},{"key":"1_CR44","first-page":"283","volume-title":"Proc. PACT'96","author":"B. Steffen","year":"1996","unstructured":"B. Steffen, T. Margaria, A. Cla\u00dfen, V. Braun, M. Reitenspie\u00df: A Constraint-Oriented Service Creation Environment, Proc. PACT'96, 2nd Int. Conf. on Practical Application of Constraint Technology \u2014 April 1996, London (UK), Ed. by The Practical Application Company pp. 283\u2013298."},{"key":"1_CR45","first-page":"450","volume-title":"LNCS 1102","author":"B. Steffen","year":"1996","unstructured":"B. Steffen, T. Margaria, A. Cla\u00dfen, V. Braun: The MetaFrame '95 Environment, Proc. CAV'96, Juli\u2013Aug. 1996, New Brunswick, NJ (USA), LNCS 1102, pp.450\u2013453, Springer."},{"key":"1_CR46","unstructured":"B. Steffen, T. Margaria, A. Cla\u00dfen, V. Braun: \u201cIncremental Formalization: A Key to Industrial Success \u201d, In \u201cSOFTWARE: Concepts and Tools\u201d, Vol. 17, No 2, pp. 78\u201391, Springer, July 1996."},{"key":"1_CR47","unstructured":"J. Spivey: The Z Notation: A Reference Manual, Prentice-Hall, 1989."},{"key":"1_CR48","volume-title":"LNCS 372","author":"B. Steffen","year":"1989","unstructured":"B. Steffen. Characteristic Formulae. Proc. ICALP'89, Stresa (Italy), LNCS 372, Springer, 1989."},{"key":"1_CR49","first-page":"346","volume-title":"LNCS 526","author":"B. Steffen","year":"1991","unstructured":"B. Steffen. Data Flow Analysis as Model Checking. Proc. of TACS'91, Sendai (Japan), LNCS 526, pp. 346\u2013364, Springer, 1991."},{"key":"1_CR50","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0167-6423(93)90003-8","volume":"N. 21","author":"B. Steffen","year":"1993","unstructured":"B. Steffen. Generating Data Flow Analysis Algorithms from Modal Specifications, Science of Computer Programming, N. 21, 1993, pp. 115\u2013139.","journal-title":"Science of Computer Programming"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"B. Steffen, A. Ing\u00f3lfsd\u00f3ttir: Characteristic Formulae for Finite State Processes, Information and Computation, Vol. 110, No. 1, 1994.","DOI":"10.1006\/inco.1994.1028"},{"key":"1_CR52","unstructured":"C. Stirling: Modal and Temporal Logics, In Handbook of Logics in Computer Science, Vol. 2, pp. 478\u2013551, Oxford Univ. Press, 1995."},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"B. Steffen, T. Margaria: Method Engineering for Real-Life Concurrent Systems, position statement, ACM Works. on Strategic Directions in Computing Research, Working Group on Concurrency (Chair S. Smolka). Appears in ACM Computing Surveys 28A(4), Dec. 1996, http:\/\/www.acm. org\/surveys\/1996\/SteffenMethod\/.","DOI":"10.1145\/242224.242296"},{"key":"1_CR54","doi-asserted-by":"crossref","unstructured":"B. Steffen, T. Margaria: Tools Get Formal Methods into Practice, position statement, ACM Works. on Strategic Directions in Computing Research, Working Group on Formal Methods (Co-Chairs E. Clarke, J. Wing). Appears in ACM Computing Surveys 28A(4), Dec. 1996, http:\/\/www.acm.org\/surveys\/1996\/SteffenTools\/.","DOI":"10.1145\/242224.242385"},{"key":"1_CR55","unstructured":"B. Steffen, T. Margaria, A. Cla\u00dfen. Heterogeneous Analysis and Verification for Distributed Systems, In \u201cSOFTWARE: Concepts and Tools\u201d, vol. 17, N.1, pp. 13\u201325, Springer, 1996."},{"key":"1_CR56","unstructured":"International Journal on Software Tools for Technology Transfer (STTT), Springer Verlag, coming September 1997 http:\/\/brahms.fmi.uni-passau.de\/bs\/sttt."},{"key":"1_CR57","doi-asserted-by":"crossref","unstructured":"W. Thomas: \u201cAutomata on infinite objects,\u201d In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, vol.B, pp.133\u2013191. MIT Press\/Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"1_CR58","unstructured":"W. Thomas: \u201cLanguages, automata, and objects,\u201d to appear in the forthcoming new edition of the Handbook of Theoretical Computer Science, MIT Press\/Elsevier."},{"key":"1_CR59","first-page":"263","volume-title":"LNCS 1119","author":"D. Janin","year":"1996","unstructured":"D. Janin, I. Walukiewicz: On the expressive completeness of the propositional mu-calculus with respect to the Monadic Second Order logic, Proc. CONCUR'96, Pisa (I), LNCS 1119, Springer, pp.263\u2013277, Aug. 1996."},{"key":"1_CR60","doi-asserted-by":"crossref","unstructured":"P. Zave, M. Jackson: Conjunction as Composition, ACM TOSEM 2(4), pp. 379\u2013411, October'93.","DOI":"10.1145\/158431.158438"},{"key":"1_CR61","unstructured":"P. Zave, M. Jackson: Where do operations come from? A Multiparadigm specification technique, To appear on Trans. on Softw. Eng."}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T23:00:57Z","timestamp":1706742057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/bfb0023444","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}