{"title":"CTAG software generator model for constructing network applications","authors":"T. Matsuzaki, T. Tokuda","doi":"10.1109/APSEC.1998.733603","DOIUrl":null,"url":null,"abstract":"We present a new software generator model for the construction of network applications. Our model is called Communicating Timed Attribute Grammars (CTAG) model, which is an extension of attribute grammars. Our CTAG model allows us to describe dynamic behavior of network applications. We represent one application program by an attributed tree. Communication between application programs is achieved by the exchange of attribute values between connected attributed trees. Traditionally network applications are constructed by procedural programming languages, but it is not easy to produce the whole codes of network application programs. Our CTAG model allows us to construct network applications based on a set of simple computing rules instead of using complex knowledge of existing function libraries and class hierarchies. We give examples of constructing a chat system and a POP client system using our CTAG model. We give comparisons of our method with previous approaches.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSEC.1998.733603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We present a new software generator model for the construction of network applications. Our model is called Communicating Timed Attribute Grammars (CTAG) model, which is an extension of attribute grammars. Our CTAG model allows us to describe dynamic behavior of network applications. We represent one application program by an attributed tree. Communication between application programs is achieved by the exchange of attribute values between connected attributed trees. Traditionally network applications are constructed by procedural programming languages, but it is not easy to produce the whole codes of network application programs. Our CTAG model allows us to construct network applications based on a set of simple computing rules instead of using complex knowledge of existing function libraries and class hierarchies. We give examples of constructing a chat system and a POP client system using our CTAG model. We give comparisons of our method with previous approaches.