--- _id: '16815' author: - first_name: P. full_name: Klein, P. last_name: Klein - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Klein P, Meyer auf der Heide F. Untere Zeitschranken für das Rucksack-Problem. In: GI - 10. Jahrestagung. Berlin, Heidelberg; 1980. doi:10.1007/978-3-642-67838-7_34' apa: Klein, P., & Meyer auf der Heide, F. (1980). Untere Zeitschranken für das Rucksack-Problem. In GI - 10. Jahrestagung. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_34 bibtex: '@inbook{Klein_Meyer auf der Heide_1980, place={Berlin, Heidelberg}, title={Untere Zeitschranken für das Rucksack-Problem}, DOI={10.1007/978-3-642-67838-7_34}, booktitle={GI - 10. Jahrestagung}, author={Klein, P. and Meyer auf der Heide, Friedhelm}, year={1980} }' chicago: Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.” In GI - 10. Jahrestagung. Berlin, Heidelberg, 1980. https://doi.org/10.1007/978-3-642-67838-7_34. ieee: P. Klein and F. Meyer auf der Heide, “Untere Zeitschranken für das Rucksack-Problem,” in GI - 10. Jahrestagung, Berlin, Heidelberg, 1980. mla: Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.” GI - 10. Jahrestagung, 1980, doi:10.1007/978-3-642-67838-7_34. short: 'P. Klein, F. Meyer auf der Heide, in: GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.' date_created: 2020-04-22T09:06:48Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1007/978-3-642-67838-7_34 language: - iso: eng place: Berlin, Heidelberg publication: GI - 10. Jahrestagung publication_identifier: isbn: - '9783540103882' - '9783642678387' issn: - 0343-3005 publication_status: published status: public title: Untere Zeitschranken für das Rucksack-Problem type: book_chapter user_id: '15415' year: '1980' ... --- _id: '15510' alternative_title: - Ein Buch der Wünsche citation: ama: Hagengruber RE, ed. Inseln im Ich. Matthes & Seitz; 1980. apa: Hagengruber, R. E. (Ed.). (1980). Inseln im Ich. Matthes & Seitz. bibtex: '@book{Hagengruber_1980, place={München}, title={Inseln im Ich}, publisher={Matthes & Seitz}, year={1980} }' chicago: 'Hagengruber, Ruth Edith, ed. Inseln im Ich. München: Matthes & Seitz, 1980.' ieee: 'R. E. Hagengruber, Ed., Inseln im Ich. München: Matthes & Seitz, 1980.' mla: Hagengruber, Ruth Edith, editor. Inseln im Ich. Matthes & Seitz, 1980. short: R.E. Hagengruber, ed., Inseln im Ich, Matthes & Seitz, München, 1980. date_created: 2020-01-13T13:07:39Z date_updated: 2022-12-09T01:27:14Z department: - _id: '519' editor: - first_name: Ruth Edith full_name: Hagengruber, Ruth Edith id: '198' last_name: Hagengruber orcid: https://orcid.org/0000-0003-3360-6335 extern: '1' language: - iso: ger place: München publication_identifier: isbn: - '3882213183' publisher: Matthes & Seitz status: public title: Inseln im Ich type: book_editor user_id: '49063' year: '1980' ... --- _id: '8184' author: - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Udo full_name: Pletat, Udo last_name: Pletat - first_name: Hans-Dietrich full_name: Ehrich, Hans-Dietrich last_name: Ehrich citation: ama: Engels G, Pletat U, Ehrich H-D. Handling Errors and Exceptions in the Algebraic Specifications of Data Types. University of Osnabrück; 1981. apa: Engels, G., Pletat, U., & Ehrich, H.-D. (1981). Handling Errors and Exceptions in the Algebraic Specifications of Data Types. University of Osnabrück. bibtex: '@book{Engels_Pletat_Ehrich_1981, title={Handling Errors and Exceptions in the Algebraic Specifications of Data Types}, publisher={University of Osnabrück}, author={Engels, Gregor and Pletat, Udo and Ehrich, Hans-Dietrich}, year={1981} }' chicago: Engels, Gregor, Udo Pletat, and Hans-Dietrich Ehrich. Handling Errors and Exceptions in the Algebraic Specifications of Data Types. University of Osnabrück, 1981. ieee: G. Engels, U. Pletat, and H.-D. Ehrich, Handling Errors and Exceptions in the Algebraic Specifications of Data Types. University of Osnabrück, 1981. mla: Engels, Gregor, et al. Handling Errors and Exceptions in the Algebraic Specifications of Data Types. University of Osnabrück, 1981. short: G. Engels, U. Pletat, H.-D. Ehrich, Handling Errors and Exceptions in the Algebraic Specifications of Data Types, University of Osnabrück, 1981. date_created: 2019-03-03T16:12:37Z date_updated: 2022-01-06T07:03:51Z department: - _id: '66' language: - iso: eng publisher: University of Osnabrück report_number: OSM-I-3 status: public title: Handling Errors and Exceptions in the Algebraic Specifications of Data Types type: report user_id: '52534' year: '1981' ... --- _id: '8185' author: - first_name: Udo full_name: Pletat, Udo last_name: Pletat - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Hans-Dietrich full_name: Ehrich, Hans-Dietrich last_name: Ehrich citation: ama: Pletat U, Engels G, Ehrich H-D. Operational Semantics of Algebraic Specifications with Conditional Equations. University of Dortmund, Department of Computer Science; 1981. apa: Pletat, U., Engels, G., & Ehrich, H.-D. (1981). Operational Semantics of Algebraic Specifications with Conditional Equations. University of Dortmund, Department of Computer Science. bibtex: '@book{Pletat_Engels_Ehrich_1981, title={Operational Semantics of Algebraic Specifications with Conditional Equations}, publisher={University of Dortmund, Department of Computer Science}, author={Pletat, Udo and Engels, Gregor and Ehrich, Hans-Dietrich}, year={1981} }' chicago: Pletat, Udo, Gregor Engels, and Hans-Dietrich Ehrich. Operational Semantics of Algebraic Specifications with Conditional Equations. University of Dortmund, Department of Computer Science, 1981. ieee: U. Pletat, G. Engels, and H.-D. Ehrich, Operational Semantics of Algebraic Specifications with Conditional Equations. University of Dortmund, Department of Computer Science, 1981. mla: Pletat, Udo, et al. Operational Semantics of Algebraic Specifications with Conditional Equations. University of Dortmund, Department of Computer Science, 1981. short: U. Pletat, G. Engels, H.-D. Ehrich, Operational Semantics of Algebraic Specifications with Conditional Equations, University of Dortmund, Department of Computer Science, 1981. date_created: 2019-03-03T16:12:38Z date_updated: 2022-01-06T07:03:51Z department: - _id: '66' language: - iso: eng publisher: University of Dortmund, Department of Computer Science report_number: '118' status: public title: Operational Semantics of Algebraic Specifications with Conditional Equations type: report user_id: '52534' year: '1981' ... --- _id: '16813' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Anton full_name: Rollik, Anton last_name: Rollik citation: ama: 'Meyer auf der Heide F, Rollik A. Random access machines and straight-line programs. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 1981. doi:10.1007/3-540-10854-8_29' apa: Meyer auf der Heide, F., & Rollik, A. (1981). Random access machines and straight-line programs. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_29 bibtex: '@inbook{Meyer auf der Heide_Rollik_1981, place={Berlin, Heidelberg}, title={Random access machines and straight-line programs}, DOI={10.1007/3-540-10854-8_29}, booktitle={Fundamentals of Computation Theory}, author={Meyer auf der Heide, Friedhelm and Rollik, Anton}, year={1981} }' chicago: Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” In Fundamentals of Computation Theory. Berlin, Heidelberg, 1981. https://doi.org/10.1007/3-540-10854-8_29. ieee: F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line programs,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 1981. mla: Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” Fundamentals of Computation Theory, 1981, doi:10.1007/3-540-10854-8_29. short: 'F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.' date_created: 2020-04-22T09:03:21Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1007/3-540-10854-8_29 language: - iso: eng place: Berlin, Heidelberg publication: Fundamentals of Computation Theory publication_identifier: isbn: - '9783540108542' - '9783540387657' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Random access machines and straight-line programs type: book_chapter user_id: '15415' year: '1981' ... --- _id: '16814' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Meyer auf der Heide F. Time-processor trade-offs for universal parallel computers. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1981. doi:10.1007/3-540-10856-4_111' apa: Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_111 bibtex: '@inbook{Meyer auf der Heide_1981, place={Berlin, Heidelberg}, title={Time-processor trade-offs for universal parallel computers}, DOI={10.1007/3-540-10856-4_111}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1981} }' chicago: Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1981. https://doi.org/10.1007/3-540-10856-4_111. ieee: F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel computers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1981. mla: Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” Lecture Notes in Computer Science, 1981, doi:10.1007/3-540-10856-4_111. short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.' date_created: 2020-04-22T09:05:15Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1007/3-540-10856-4_111 language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540108566' - '9783540387695' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Time-processor trade-offs for universal parallel computers type: book_chapter user_id: '15415' year: '1981' ... --- _id: '16820' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Meyer auf der Heide F. A comparison of two variations of a pebble game on graphs. Theoretical Computer Science. 1981:315-322. doi:10.1016/s0304-3975(81)80004-7 apa: Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble game on graphs. Theoretical Computer Science, 315–322. https://doi.org/10.1016/s0304-3975(81)80004-7 bibtex: '@article{Meyer auf der Heide_1981, title={A comparison of two variations of a pebble game on graphs}, DOI={10.1016/s0304-3975(81)80004-7}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1981}, pages={315–322} }' chicago: Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Theoretical Computer Science, 1981, 315–22. https://doi.org/10.1016/s0304-3975(81)80004-7. ieee: F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Theoretical Computer Science, pp. 315–322, 1981. mla: Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Theoretical Computer Science, 1981, pp. 315–22, doi:10.1016/s0304-3975(81)80004-7. short: F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322. date_created: 2020-04-22T09:33:31Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1016/s0304-3975(81)80004-7 language: - iso: eng page: 315-322 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: A comparison of two variations of a pebble game on graphs type: journal_article user_id: '15415' year: '1981' ... --- _id: '30187' author: - first_name: Joachim full_name: Böcker, Joachim id: '66' last_name: Böcker orcid: 0000-0002-8480-7295 citation: ama: Böcker J. Ein Kreiskriterium für Mehrgrößensysteme und seine Anwendung auf mechanische Schwingungssysteme. Institut für Regelungstechnik, TU Berlin; 1981. apa: Böcker, J. (1981). Ein Kreiskriterium für Mehrgrößensysteme und seine Anwendung auf mechanische Schwingungssysteme. Institut für Regelungstechnik, TU Berlin. bibtex: '@book{Böcker_1981, title={Ein Kreiskriterium für Mehrgrößensysteme und seine Anwendung auf mechanische Schwingungssysteme}, publisher={Institut für Regelungstechnik, TU Berlin}, author={Böcker, Joachim}, year={1981} }' chicago: Böcker, Joachim. Ein Kreiskriterium für Mehrgrößensysteme und seine Anwendung auf mechanische Schwingungssysteme. Institut für Regelungstechnik, TU Berlin, 1981. ieee: J. Böcker, Ein Kreiskriterium für Mehrgrößensysteme und seine Anwendung auf mechanische Schwingungssysteme. Institut für Regelungstechnik, TU Berlin, 1981. mla: Böcker, Joachim. Ein Kreiskriterium für Mehrgrößensysteme und seine Anwendung auf mechanische Schwingungssysteme. Institut für Regelungstechnik, TU Berlin, 1981. short: J. Böcker, Ein Kreiskriterium für Mehrgrößensysteme und seine Anwendung auf mechanische Schwingungssysteme, Institut für Regelungstechnik, TU Berlin, 1981. date_created: 2022-03-02T08:05:13Z date_updated: 2022-03-17T09:40:16Z ddc: - '620' department: - _id: '52' extern: '1' file: - access_level: open_access content_type: application/pdf creator: boecker date_created: 2022-03-02T08:03:56Z date_updated: 2022-03-02T08:19:38Z file_id: '30188' file_name: Böcker 1981 Studienarbeit OCR.pdf file_size: 9663083 relation: main_file file_date_updated: 2022-03-02T08:19:38Z has_accepted_license: '1' language: - iso: ger oa: '1' publication_status: published publisher: Institut für Regelungstechnik, TU Berlin status: public title: Ein Kreiskriterium für Mehrgrößensysteme und seine Anwendung auf mechanische Schwingungssysteme type: book user_id: '66' year: '1981' ... --- _id: '7811' author: - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Wilhelm full_name: Schäfer, Wilhelm last_name: Schäfer citation: ama: 'Engels G, Schäfer W. Specification of a Programming Support Environment by Graph Grammars. In: Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany). München/Leipzig: Hanser; 1982:47-62.' apa: 'Engels, G., & Schäfer, W. (1982). Specification of a Programming Support Environment by Graph Grammars. In Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany) (pp. 47–62). München/Leipzig: Hanser.' bibtex: '@inproceedings{Engels_Schäfer_1982, place={München/Leipzig}, title={Specification of a Programming Support Environment by Graph Grammars}, booktitle={Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)}, publisher={Hanser}, author={Engels, Gregor and Schäfer, Wilhelm}, year={1982}, pages={47–62} }' chicago: 'Engels, Gregor, and Wilhelm Schäfer. “Specification of a Programming Support Environment by Graph Grammars.” In Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany), 47–62. München/Leipzig: Hanser, 1982.' ieee: G. Engels and W. Schäfer, “Specification of a Programming Support Environment by Graph Grammars,” in Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany), 1982, pp. 47–62. mla: Engels, Gregor, and Wilhelm Schäfer. “Specification of a Programming Support Environment by Graph Grammars.” Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany), Hanser, 1982, pp. 47–62. short: 'G. Engels, W. Schäfer, in: Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany), Hanser, München/Leipzig, 1982, pp. 47–62.' date_created: 2019-02-20T13:37:37Z date_updated: 2022-01-06T07:03:46Z department: - _id: '66' language: - iso: eng page: 47-62 place: München/Leipzig publication: Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany) publisher: Hanser status: public title: Specification of a Programming Support Environment by Graph Grammars type: conference user_id: '52534' year: '1982' ... --- _id: '7812' abstract: - lang: eng text: We suppose to give conditional specifications of abstract data types hierarchically. Considering algebraic specifications from an operational point of view this approach enables us to present simple syntactic criteria for the Church-Rosser property, which implies the welldefinedness of the operational semantics of a conditional specification. Furthermore, these criteria are su?cient for the termination of the full substitution reduction strategy. author: - first_name: Udo full_name: Pletat, Udo last_name: Pletat - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Hans-Dietrich full_name: Ehrich, Hans-Dietrich last_name: Ehrich citation: ama: 'Pletat U, Engels G, Ehrich H-D. An Operational Approach to Conditional Algebraic Specifications. In: Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France). Vol 82. ; 1982:254-270.' apa: Pletat, U., Engels, G., & Ehrich, H.-D. (1982). An Operational Approach to Conditional Algebraic Specifications. In Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France) (Vol. 82, pp. 254–270). bibtex: '@inproceedings{Pletat_Engels_Ehrich_1982, title={An Operational Approach to Conditional Algebraic Specifications}, volume={82}, booktitle={Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France)}, author={Pletat, Udo and Engels, Gregor and Ehrich, Hans-Dietrich}, year={1982}, pages={254–270} }' chicago: Pletat, Udo, Gregor Engels, and Hans-Dietrich Ehrich. “An Operational Approach to Conditional Algebraic Specifications.” In Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France), 82:254–70, 1982. ieee: U. Pletat, G. Engels, and H.-D. Ehrich, “An Operational Approach to Conditional Algebraic Specifications,” in Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France), 1982, vol. 82, pp. 254–270. mla: Pletat, Udo, et al. “An Operational Approach to Conditional Algebraic Specifications.” Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France), vol. 82, 1982, pp. 254–70. short: 'U. Pletat, G. Engels, H.-D. Ehrich, in: Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France), 1982, pp. 254–270.' date_created: 2019-02-20T13:39:05Z date_updated: 2022-01-06T07:03:46Z department: - _id: '66' intvolume: ' 82' language: - iso: eng page: 254-270 publication: Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France) status: public title: An Operational Approach to Conditional Algebraic Specifications type: conference user_id: '52534' volume: 82 year: '1982' ... --- _id: '29933' author: - first_name: Joachim full_name: Böcker, Joachim id: '66' last_name: Böcker orcid: 0000-0002-8480-7295 citation: ama: Böcker J. Untersuchungen zur L_inf-Stabilität für eine Klasse nichtlinearer Regelungssysteme. Institut für Regelungstechnik, TU Berlin; 1982. apa: Böcker, J. (1982). Untersuchungen zur L_inf-Stabilität für eine Klasse nichtlinearer Regelungssysteme. Institut für Regelungstechnik, TU Berlin. bibtex: '@book{Böcker_1982, title={Untersuchungen zur L_inf-Stabilität für eine Klasse nichtlinearer Regelungssysteme}, publisher={Institut für Regelungstechnik, TU Berlin}, author={Böcker, Joachim}, year={1982} }' chicago: Böcker, Joachim. Untersuchungen zur L_inf-Stabilität für eine Klasse nichtlinearer Regelungssysteme. Institut für Regelungstechnik, TU Berlin, 1982. ieee: J. Böcker, Untersuchungen zur L_inf-Stabilität für eine Klasse nichtlinearer Regelungssysteme. Institut für Regelungstechnik, TU Berlin, 1982. mla: Böcker, Joachim. Untersuchungen zur L_inf-Stabilität für eine Klasse nichtlinearer Regelungssysteme. Institut für Regelungstechnik, TU Berlin, 1982. short: J. Böcker, Untersuchungen zur L_inf-Stabilität für eine Klasse nichtlinearer Regelungssysteme, Institut für Regelungstechnik, TU Berlin, 1982. date_created: 2022-02-21T14:04:55Z date_updated: 2022-03-17T09:41:17Z ddc: - '620' department: - _id: '52' extern: '1' file: - access_level: open_access content_type: application/pdf creator: boecker date_created: 2022-02-21T14:10:37Z date_updated: 2022-03-02T08:18:51Z file_id: '29935' file_name: Böcker 1982 Diplomarbeit.pdf file_size: 2298515 relation: main_file file_date_updated: 2022-03-02T08:18:51Z has_accepted_license: '1' language: - iso: ger oa: '1' publication_status: published publisher: Institut für Regelungstechnik, TU Berlin status: public title: Untersuchungen zur L_inf-Stabilität für eine Klasse nichtlinearer Regelungssysteme type: book user_id: '66' year: '1982' ... --- _id: '8255' abstract: - lang: eng text: The following paper demonstrates that programmed sequential graph grammars can be used in a systematic proceeding to specify the changes of high level intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to specification engineering using graph grammars. This approach is influenced by the syntactical definition of the underlying programming language or module concept etc. to be supported but also by the idea of the user interface. author: - first_name: Manfred full_name: Nagl, Manfred last_name: Nagl - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Rupert full_name: Gall, Rupert last_name: Gall - first_name: Wilhelm full_name: Schäfer, Wilhelm last_name: Schäfer citation: ama: 'Nagl M, Engels G, Gall R, Schäfer W. Software Specification by Graph Grammars. In: Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany). Vol 153. LNCS. Berlin/Heidelberg: Springer; 1983:267-287. doi:dx.doi.org/10.1007/BFb0000113' apa: 'Nagl, M., Engels, G., Gall, R., & Schäfer, W. (1983). Software Specification by Graph Grammars. In Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany) (Vol. 153, pp. 267–287). Berlin/Heidelberg: Springer. https://doi.org/dx.doi.org/10.1007/BFb0000113' bibtex: '@inproceedings{Nagl_Engels_Gall_Schäfer_1983, place={Berlin/Heidelberg}, series={LNCS}, title={Software Specification by Graph Grammars}, volume={153}, DOI={dx.doi.org/10.1007/BFb0000113}, booktitle={Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany)}, publisher={Springer}, author={Nagl, Manfred and Engels, Gregor and Gall, Rupert and Schäfer, Wilhelm}, year={1983}, pages={267–287}, collection={LNCS} }' chicago: 'Nagl, Manfred, Gregor Engels, Rupert Gall, and Wilhelm Schäfer. “Software Specification by Graph Grammars.” In Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany), 153:267–87. LNCS. Berlin/Heidelberg: Springer, 1983. https://doi.org/dx.doi.org/10.1007/BFb0000113.' ieee: M. Nagl, G. Engels, R. Gall, and W. Schäfer, “Software Specification by Graph Grammars,” in Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany), 1983, vol. 153, pp. 267–287. mla: Nagl, Manfred, et al. “Software Specification by Graph Grammars.” Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany), vol. 153, Springer, 1983, pp. 267–87, doi:dx.doi.org/10.1007/BFb0000113. short: 'M. Nagl, G. Engels, R. Gall, W. Schäfer, in: Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany), Springer, Berlin/Heidelberg, 1983, pp. 267–287.' date_created: 2019-03-04T11:52:04Z date_updated: 2022-01-06T07:03:52Z department: - _id: '66' doi: dx.doi.org/10.1007/BFb0000113 intvolume: ' 153' language: - iso: eng page: 267-287 place: Berlin/Heidelberg publication: Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany) publisher: Springer series_title: LNCS status: public title: Software Specification by Graph Grammars type: conference user_id: '52534' volume: 153 year: '1983' ... --- _id: '7411' abstract: - lang: eng text: The following paper,demonstrates that programmed sequential graph grammars can be used in a systematic proceeding to specify tbe changes of high level intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to "specification engineering" using graph grammars. This approach is influenced by the syntactical definition of the underlying language for Programming in the Small, the module concept etc. to be supported on one side but also by the idea of the user interface. author: - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Rupert full_name: Gall, Rupert last_name: Gall - first_name: Manfred full_name: Nagl, Manfred last_name: Nagl - first_name: Wilhelm full_name: Schäfer, Wilhelm last_name: Schäfer citation: ama: Engels G, Gall R, Nagl M, Schäfer W. Software Specification Using Graph Grammars. Computing. 1983;31(4):317-346. doi:http://dx.doi.org/10.1007/BF02251236 apa: Engels, G., Gall, R., Nagl, M., & Schäfer, W. (1983). Software Specification Using Graph Grammars. Computing, 31(4), 317–346. http://dx.doi.org/10.1007/BF02251236 bibtex: '@article{Engels_Gall_Nagl_Schäfer_1983, title={Software Specification Using Graph Grammars}, volume={31}, DOI={http://dx.doi.org/10.1007/BF02251236}, number={4}, journal={Computing}, author={Engels, Gregor and Gall, Rupert and Nagl, Manfred and Schäfer, Wilhelm}, year={1983}, pages={317–346} }' chicago: 'Engels, Gregor, Rupert Gall, Manfred Nagl, and Wilhelm Schäfer. “Software Specification Using Graph Grammars.” Computing 31, no. 4 (1983): 317–46. http://dx.doi.org/10.1007/BF02251236.' ieee: G. Engels, R. Gall, M. Nagl, and W. Schäfer, “Software Specification Using Graph Grammars,” Computing, vol. 31, no. 4, pp. 317–346, 1983. mla: Engels, Gregor, et al. “Software Specification Using Graph Grammars.” Computing, vol. 31, no. 4, 1983, pp. 317–46, doi:http://dx.doi.org/10.1007/BF02251236. short: G. Engels, R. Gall, M. Nagl, W. Schäfer, Computing 31 (1983) 317–346. date_created: 2019-01-31T15:55:42Z date_updated: 2022-01-06T07:03:36Z department: - _id: '66' doi: http://dx.doi.org/10.1007/BF02251236 intvolume: ' 31' issue: '4' language: - iso: eng page: 317-346 publication: Computing status: public title: Software Specification Using Graph Grammars type: journal_article user_id: '52534' volume: 31 year: '1983' ... --- _id: '7412' abstract: - lang: eng text: A new approach to an operational treatment of errors and exceptions in specifications of abstract data types is presented. Considering a specification as a term rewriting system, we define an operational semantics and give conditions that are sufficient for its well-definedness (Church-Rosser property). Also, we give conditions that are sufficient for the termination of reduction strategies, respecting the specified error and exception handling. author: - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Udo full_name: Pletat, Udo last_name: Pletat - first_name: Hans-Dietrich full_name: Ehrich, Hans-Dietrich last_name: Ehrich citation: ama: Engels G, Pletat U, Ehrich H-D. An Operational Semantics for Specifications of Abstract Data Types with Error Handling. Acta Informatica. 1983;9(3):235-254. doi:http://dx.doi.org/10.1007/BF00265557 apa: Engels, G., Pletat, U., & Ehrich, H.-D. (1983). An Operational Semantics for Specifications of Abstract Data Types with Error Handling. Acta Informatica, 9(3), 235–254. http://dx.doi.org/10.1007/BF00265557 bibtex: '@article{Engels_Pletat_Ehrich_1983, title={An Operational Semantics for Specifications of Abstract Data Types with Error Handling}, volume={9}, DOI={http://dx.doi.org/10.1007/BF00265557}, number={3}, journal={Acta Informatica}, author={Engels, Gregor and Pletat, Udo and Ehrich, Hans-Dietrich}, year={1983}, pages={235–254} }' chicago: 'Engels, Gregor, Udo Pletat, and Hans-Dietrich Ehrich. “An Operational Semantics for Specifications of Abstract Data Types with Error Handling.” Acta Informatica 9, no. 3 (1983): 235–54. http://dx.doi.org/10.1007/BF00265557.' ieee: G. Engels, U. Pletat, and H.-D. Ehrich, “An Operational Semantics for Specifications of Abstract Data Types with Error Handling,” Acta Informatica, vol. 9, no. 3, pp. 235–254, 1983. mla: Engels, Gregor, et al. “An Operational Semantics for Specifications of Abstract Data Types with Error Handling.” Acta Informatica, vol. 9, no. 3, 1983, pp. 235–54, doi:http://dx.doi.org/10.1007/BF00265557. short: G. Engels, U. Pletat, H.-D. Ehrich, Acta Informatica 9 (1983) 235–254. date_created: 2019-01-31T15:56:22Z date_updated: 2022-01-06T07:03:36Z department: - _id: '66' doi: http://dx.doi.org/10.1007/BF00265557 intvolume: ' 9' issue: '3' language: - iso: eng page: 235-254 publication: Acta Informatica status: public title: An Operational Semantics for Specifications of Abstract Data Types with Error Handling type: journal_article user_id: '52534' volume: 9 year: '1983' ... --- _id: '16806' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Meyer auf der Heide F. Efficiency of universal parallel computers. Acta Informatica. 1983:269-296. doi:10.1007/bf00265559 apa: Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. Acta Informatica, 269–296. https://doi.org/10.1007/bf00265559 bibtex: '@article{Meyer auf der Heide_1983, title={Efficiency of universal parallel computers}, DOI={10.1007/bf00265559}, journal={Acta Informatica}, author={Meyer auf der Heide, Friedhelm}, year={1983}, pages={269–296} }' chicago: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Acta Informatica, 1983, 269–96. https://doi.org/10.1007/bf00265559. ieee: F. Meyer auf der Heide, “Efficiency of universal parallel computers,” Acta Informatica, pp. 269–296, 1983. mla: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Acta Informatica, 1983, pp. 269–96, doi:10.1007/bf00265559. short: F. Meyer auf der Heide, Acta Informatica (1983) 269–296. date_created: 2020-04-22T08:48:20Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1007/bf00265559 language: - iso: eng page: 269-296 publication: Acta Informatica publication_identifier: issn: - 0001-5903 - 1432-0525 publication_status: published status: public title: Efficiency of universal parallel computers type: journal_article user_id: '15415' year: '1983' ... --- _id: '16807' author: - first_name: Peter full_name: Klein, Peter last_name: Klein - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Klein P, Meyer auf der Heide F. A lower time bound for the knapsack problem on random access machines. Acta Informatica. 1983:385-395. doi:10.1007/bf00290735 apa: Klein, P., & Meyer auf der Heide, F. (1983). A lower time bound for the knapsack problem on random access machines. Acta Informatica, 385–395. https://doi.org/10.1007/bf00290735 bibtex: '@article{Klein_Meyer auf der Heide_1983, title={A lower time bound for the knapsack problem on random access machines}, DOI={10.1007/bf00290735}, journal={Acta Informatica}, author={Klein, Peter and Meyer auf der Heide, Friedhelm}, year={1983}, pages={385–395} }' chicago: Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.” Acta Informatica, 1983, 385–95. https://doi.org/10.1007/bf00290735. ieee: P. Klein and F. Meyer auf der Heide, “A lower time bound for the knapsack problem on random access machines,” Acta Informatica, pp. 385–395, 1983. mla: Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.” Acta Informatica, 1983, pp. 385–95, doi:10.1007/bf00290735. short: P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395. date_created: 2020-04-22T08:49:58Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1007/bf00290735 language: - iso: eng page: 385-395 publication: Acta Informatica publication_identifier: issn: - 0001-5903 - 1432-0525 publication_status: published status: public title: A lower time bound for the knapsack problem on random access machines type: journal_article user_id: '15415' year: '1983' ... --- _id: '16808' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Meyer auf der Heide F. Infinite cube-connected cycles. Information Processing Letters. 1983:1-2. doi:10.1016/0020-0190(83)90001-7 apa: Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. Information Processing Letters, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7 bibtex: '@article{Meyer auf der Heide_1983, title={Infinite cube-connected cycles}, DOI={10.1016/0020-0190(83)90001-7}, journal={Information Processing Letters}, author={Meyer auf der Heide, Friedhelm}, year={1983}, pages={1–2} }' chicago: Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” Information Processing Letters, 1983, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7. ieee: F. Meyer auf der Heide, “Infinite cube-connected cycles,” Information Processing Letters, pp. 1–2, 1983. mla: Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” Information Processing Letters, 1983, pp. 1–2, doi:10.1016/0020-0190(83)90001-7. short: F. Meyer auf der Heide, Information Processing Letters (1983) 1–2. date_created: 2020-04-22T08:51:01Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1016/0020-0190(83)90001-7 language: - iso: eng page: 1-2 publication: Information Processing Letters publication_identifier: issn: - 0020-0190 publication_status: published status: public title: Infinite cube-connected cycles type: journal_article user_id: '15415' year: '1983' ... --- _id: '16809' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Meyer auf der Heide F. A polynomial linear search algorithm for the n-dimensional knapsack problem. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83. ; 1983. doi:10.1145/800061.808734' apa: Meyer auf der Heide, F. (1983). A polynomial linear search algorithm for the n-dimensional knapsack problem. In Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83. https://doi.org/10.1145/800061.808734 bibtex: '@inproceedings{Meyer auf der Heide_1983, title={A polynomial linear search algorithm for the n-dimensional knapsack problem}, DOI={10.1145/800061.808734}, booktitle={Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83}, author={Meyer auf der Heide, Friedhelm}, year={1983} }' chicago: Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983. https://doi.org/10.1145/800061.808734. ieee: F. Meyer auf der Heide, “A polynomial linear search algorithm for the n-dimensional knapsack problem,” in Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83, 1983. mla: Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983, doi:10.1145/800061.808734. short: 'F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983.' date_created: 2020-04-22T08:52:15Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1145/800061.808734 language: - iso: eng publication: Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 publication_identifier: isbn: - '0897910990' publication_status: published status: public title: A polynomial linear search algorithm for the n-dimensional knapsack problem type: conference user_id: '15415' year: '1983' ... --- _id: '16810' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Meyer auf der Heide F. Efficiency of universal parallel computers. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1983. doi:10.1007/bfb0036483' apa: Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0036483 bibtex: '@inbook{Meyer auf der Heide_1983, place={Berlin/Heidelberg}, title={Efficiency of universal parallel computers}, DOI={10.1007/bfb0036483}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1983} }' chicago: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1983. https://doi.org/10.1007/bfb0036483. ieee: F. Meyer auf der Heide, “Efficiency of universal parallel computers,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1983. mla: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Lecture Notes in Computer Science, 1983, doi:10.1007/bfb0036483. short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.' date_created: 2020-04-22T08:53:33Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1007/bfb0036483 language: - iso: eng place: Berlin/Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '3540119736' publication_status: published status: public title: Efficiency of universal parallel computers type: book_chapter user_id: '15415' year: '1983' ... --- _id: '21603' author: - first_name: Gitta full_name: Domik, Gitta id: '90' last_name: Domik - first_name: F. full_name: Leberl, F. last_name: Leberl - first_name: M. full_name: Kobrick, M. last_name: Kobrick citation: ama: 'Domik G, Leberl F, Kobrick M. Radar Image Simulation and its Application in Image Analysis. In: International Archives of Photogrammetry and Remote Sensing. Vol 25A. ISPRS 1984, XVth congress, Rio de Janeiro, 1984. Rio de Janeiro, Brazil; 1984:99–108.' apa: Domik, G., Leberl, F., & Kobrick, M. (1984). Radar Image Simulation and its Application in Image Analysis. In International archives of photogrammetry and remote sensing (Vol. 25A, pp. 99–108). Rio de Janeiro, Brazil. bibtex: '@inproceedings{Domik_Leberl_Kobrick_1984, place={Rio de Janeiro, Brazil}, series={ISPRS 1984, XVth congress, Rio de Janeiro, 1984}, title={Radar Image Simulation and its Application in Image Analysis}, volume={25A}, number={3}, booktitle={International archives of photogrammetry and remote sensing}, author={Domik, Gitta and Leberl, F. and Kobrick, M.}, year={1984}, pages={99–108}, collection={ISPRS 1984, XVth congress, Rio de Janeiro, 1984} }' chicago: Domik, Gitta, F. Leberl, and M. Kobrick. “Radar Image Simulation and Its Application in Image Analysis.” In International Archives of Photogrammetry and Remote Sensing, 25A:99–108. ISPRS 1984, XVth Congress, Rio de Janeiro, 1984. Rio de Janeiro, Brazil, 1984. ieee: G. Domik, F. Leberl, and M. Kobrick, “Radar Image Simulation and its Application in Image Analysis,” in International archives of photogrammetry and remote sensing, 1984, vol. 25A, no. 3, pp. 99–108. mla: Domik, Gitta, et al. “Radar Image Simulation and Its Application in Image Analysis.” International Archives of Photogrammetry and Remote Sensing, vol. 25A, no. 3, 1984, pp. 99–108. short: 'G. Domik, F. Leberl, M. Kobrick, in: International Archives of Photogrammetry and Remote Sensing, Rio de Janeiro, Brazil, 1984, pp. 99–108.' date_created: 2021-04-12T06:53:46Z date_updated: 2022-01-06T06:55:07Z department: - _id: '65' issue: '3' language: - iso: eng page: 99–108 place: Rio de Janeiro, Brazil publication: International archives of photogrammetry and remote sensing publication_identifier: issn: - 0256-1840 series_title: ISPRS 1984, XVth congress, Rio de Janeiro, 1984 status: public title: Radar Image Simulation and its Application in Image Analysis type: conference user_id: '90' volume: 25A year: '1984' ...