TY - BOOK AU - Böcker, Joachim ID - 29933 TI - Untersuchungen zur L_inf-Stabilität für eine Klasse nichtlinearer Regelungssysteme ER - TY - CONF AB - 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. AU - Nagl, Manfred AU - Engels, Gregor AU - Gall, Rupert AU - Schäfer, Wilhelm ID - 8255 T2 - Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany) TI - Software Specification by Graph Grammars VL - 153 ER - TY - JOUR AB - 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. AU - Engels, Gregor AU - Gall, Rupert AU - Nagl, Manfred AU - Schäfer, Wilhelm ID - 7411 IS - 4 JF - Computing TI - Software Specification Using Graph Grammars VL - 31 ER - TY - JOUR AB - 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. AU - Engels, Gregor AU - Pletat, Udo AU - Ehrich, Hans-Dietrich ID - 7412 IS - 3 JF - Acta Informatica TI - An Operational Semantics for Specifications of Abstract Data Types with Error Handling VL - 9 ER - TY - JOUR AU - Meyer auf der Heide, Friedhelm ID - 16806 JF - Acta Informatica SN - 0001-5903 TI - Efficiency of universal parallel computers ER - TY - JOUR AU - Klein, Peter AU - Meyer auf der Heide, Friedhelm ID - 16807 JF - Acta Informatica SN - 0001-5903 TI - A lower time bound for the knapsack problem on random access machines ER - TY - JOUR AU - Meyer auf der Heide, Friedhelm ID - 16808 JF - Information Processing Letters SN - 0020-0190 TI - Infinite cube-connected cycles ER - TY - CONF AU - Meyer auf der Heide, Friedhelm ID - 16809 SN - 0897910990 T2 - Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 TI - A polynomial linear search algorithm for the n-dimensional knapsack problem ER - TY - CHAP AU - Meyer auf der Heide, Friedhelm ID - 16810 SN - 3540119736 T2 - Lecture Notes in Computer Science TI - Efficiency of universal parallel computers ER - TY - CONF AU - Domik, Gitta AU - Leberl, F. AU - Kobrick, M. ID - 21603 IS - 3 SN - 0256-1840 T2 - International archives of photogrammetry and remote sensing TI - Radar Image Simulation and its Application in Image Analysis VL - 25A ER -