{"title":"Software Specification Using Graph Grammars","_id":"7411","department":[{"_id":"66"}],"volume":31,"user_id":"52534","citation":{"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.","short":"G. Engels, R. Gall, M. Nagl, W. Schäfer, Computing 31 (1983) 317–346.","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} }","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","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.","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","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."},"date_created":"2019-01-31T15:55:42Z","status":"public","intvolume":" 31","year":"1983","author":[{"id":"107","last_name":"Engels","full_name":"Engels, Gregor","first_name":"Gregor"},{"full_name":"Gall, Rupert","last_name":"Gall","first_name":"Rupert"},{"first_name":"Manfred","last_name":"Nagl","full_name":"Nagl, Manfred"},{"first_name":"Wilhelm","full_name":"Schäfer, Wilhelm","last_name":"Schäfer"}],"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."}],"doi":"http://dx.doi.org/10.1007/BF02251236","page":"317-346","type":"journal_article","date_updated":"2022-01-06T07:03:36Z","publication":"Computing","language":[{"iso":"eng"}],"issue":"4"}