Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733612
D. Poo
In traditional programming, business policies are embedded in program code. This form of representing business policies has its problem because policies are disintegrated into low-level program code statements that project more of the control flow aspect of a system rather than the semantic of the policies. This paper argues that business policies should be explicitly represented in a system. The paper examines business policies and its relevance in the context of system specification and suggests an approach to representing policies explicitly in classes.
{"title":"Explicit representation of business policies","authors":"D. Poo","doi":"10.1109/APSEC.1998.733612","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733612","url":null,"abstract":"In traditional programming, business policies are embedded in program code. This form of representing business policies has its problem because policies are disintegrated into low-level program code statements that project more of the control flow aspect of a system rather than the semantic of the policies. This paper argues that business policies should be explicitly represented in a system. The paper examines business policies and its relevance in the context of system specification and suggests an approach to representing policies explicitly in classes.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121859460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733735
H. Okada, Hiromichi Iwata, Haruo Toyama, Yoshitomi Morisawa
When implementing an application system in distributed computing environment, several architectural questions arise such as, how and where computing resources are distributed and how the communication among computing resources should be implemented. To simplify the process of making these choices, we have developed a distributed computing model. This model classifies distributed processing systems into seven categories based on the location of data storage and the style of processing between client and server. This paper describes our model and its use in planning the infrastructure of a new system for one of our customers.
{"title":"A computing model for distributed processing systems and its application","authors":"H. Okada, Hiromichi Iwata, Haruo Toyama, Yoshitomi Morisawa","doi":"10.1109/APSEC.1998.733735","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733735","url":null,"abstract":"When implementing an application system in distributed computing environment, several architectural questions arise such as, how and where computing resources are distributed and how the communication among computing resources should be implemented. To simplify the process of making these choices, we have developed a distributed computing model. This model classifies distributed processing systems into seven categories based on the location of data storage and the style of processing between client and server. This paper describes our model and its use in planning the infrastructure of a new system for one of our customers.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"571 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114662421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733584
Chulhong Kim, Kangho Kim, Cheoljoo Jeong, Youngbae Oh
Communication systems can be characterized by high reliability requirements, complexity in development, and distribution of processes and resources. In developing these kinds of systems, formal methods can be fruitful in achieving high quality of resulting systems. LOTOS, a formal specification language, allows us to write models of the system in an abstract but rigorous manner. In this paper, we present a "behavior compiler" that supports rapid prototyping by generating C++ code from LOTOS behavioral specifications. Execution of the generated code allows us to detect analysis and design errors at the early stage of system development life cycle.
{"title":"Automatically generating C++ programs from LOTOS behavior specifications","authors":"Chulhong Kim, Kangho Kim, Cheoljoo Jeong, Youngbae Oh","doi":"10.1109/APSEC.1998.733584","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733584","url":null,"abstract":"Communication systems can be characterized by high reliability requirements, complexity in development, and distribution of processes and resources. In developing these kinds of systems, formal methods can be fruitful in achieving high quality of resulting systems. LOTOS, a formal specification language, allows us to write models of the system in an abstract but rigorous manner. In this paper, we present a \"behavior compiler\" that supports rapid prototyping by generating C++ code from LOTOS behavioral specifications. Execution of the generated code allows us to detect analysis and design errors at the early stage of system development life cycle.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126028945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733575
Chaoyu Lin, T. Elrad
To be effective in addressing specific requirements found in the intended computing domains of a given object-oriented language, several researchers have tended to introduce new notation into current existing interface constructs. Current research that provides such interfaces can be classified into two categories: one embedding special purpose interface construct in language syntax and can not be adapted further by end-users; the other provides an open way that programmers can tailor new interface construct to their need. In either way, programmers suffer the inheritance anomaly and the inheritance exclusion. To handle such disadvantages, this paper presents our language adapter++, in which programmers can adapt the object model to different computing environments, and then reify the internal object state into a separated virtual interface, called virtual adapter. The virtual adapter along with traditional interface can be used to define an object as if using the integrated construct.
{"title":"An enhanced reflective architecture for adaptation of the object-oriented language/software","authors":"Chaoyu Lin, T. Elrad","doi":"10.1109/APSEC.1998.733575","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733575","url":null,"abstract":"To be effective in addressing specific requirements found in the intended computing domains of a given object-oriented language, several researchers have tended to introduce new notation into current existing interface constructs. Current research that provides such interfaces can be classified into two categories: one embedding special purpose interface construct in language syntax and can not be adapted further by end-users; the other provides an open way that programmers can tailor new interface construct to their need. In either way, programmers suffer the inheritance anomaly and the inheritance exclusion. To handle such disadvantages, this paper presents our language adapter++, in which programmers can adapt the object model to different computing environments, and then reify the internal object state into a separated virtual interface, called virtual adapter. The virtual adapter along with traditional interface can be used to define an object as if using the integrated construct.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128911935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733727
E. Kazmierczak, M. Winikoff, Philip W. Dart
In this paper we demonstrate how light weight tools can be used to increase the level of confidence in Z specifications. In particular we outline the Pipedream approach to exploring Z specifications through animation, and illustrate the range of analyses that can be performed. We argue that, while a light weight approach does not give the same levels of assurance that an automated reasoning system would, it does give levels of assurance which are adequate for most projects and with significantly less overhead. We illustrate how animation can be used to perform verification using the example of a simple dependency management system.
{"title":"Verifying model oriented specifications through animation","authors":"E. Kazmierczak, M. Winikoff, Philip W. Dart","doi":"10.1109/APSEC.1998.733727","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733727","url":null,"abstract":"In this paper we demonstrate how light weight tools can be used to increase the level of confidence in Z specifications. In particular we outline the Pipedream approach to exploring Z specifications through animation, and illustrate the range of analyses that can be performed. We argue that, while a light weight approach does not give the same levels of assurance that an automated reasoning system would, it does give levels of assurance which are adequate for most projects and with significantly less overhead. We illustrate how animation can be used to perform verification using the example of a simple dependency management system.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122628897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733579
J. Lucas, Jean-Luc Dormoy, Bruno Ginoux, Claudia Jimenez-Dominguez, Laurent Pierre
Much research work in computer science has been carried out in order to facilitate the software development process. Among the numerous research topics, two of them, automatic programming and formal specifications, had rarely been subject to a joint approach. Since 1992, we have developed an automatic programming system called the Descartes system, which, based on formal specifications written in a mathematical language, generates an executable program written in procedural programming language. This system has been used for several industrial applications, among which are a control-command operations scheduler for a fuel-oil based thermal power station, an emergency shut-down system for a nuclear power plant, and a fault-tree processing module. After supplying several items for comparing our work with traditional approaches in the fields of program synthesis and formal specifications, we will describe the Descartes system, the associated specification language, and will then present the results obtained to date.
{"title":"How to reconcile formal specifications and automatic programming: the Descartes system","authors":"J. Lucas, Jean-Luc Dormoy, Bruno Ginoux, Claudia Jimenez-Dominguez, Laurent Pierre","doi":"10.1109/APSEC.1998.733579","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733579","url":null,"abstract":"Much research work in computer science has been carried out in order to facilitate the software development process. Among the numerous research topics, two of them, automatic programming and formal specifications, had rarely been subject to a joint approach. Since 1992, we have developed an automatic programming system called the Descartes system, which, based on formal specifications written in a mathematical language, generates an executable program written in procedural programming language. This system has been used for several industrial applications, among which are a control-command operations scheduler for a fuel-oil based thermal power station, an emergency shut-down system for a nuclear power plant, and a fault-tree processing module. After supplying several items for comparing our work with traditional approaches in the fields of program synthesis and formal specifications, we will describe the Descartes system, the associated specification language, and will then present the results obtained to date.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130952380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733726
San-Yih Hwang, Chi-Ten Yang
Designing a distributed workflow management system (WFMS) has become a topic with tremendous research interests in recent years. Unlike a traditional client-server WFMS that executes only at a single site, a distributed WFMS allows the execution of a workflow instance to be governed by more than one servers so as to achieve availability and efficiency. A consensus has generally been reached that the component-based approach is a promising one to designing a distributed WFMS. The component-based approach divides the functionality of a WFMS into a number of components, each of which follows some well-accepted distributed object standard, e.g. CORBA or DCOM. These components can be distributed transparently to different sites for execution, and cooperatively they achieve the goal of the underlying business process. Following the component-based approach, this paper proposes and discusses several alternatives on how to distribute the components and the data of a distributed WFMS. Specifically, the component distribution problem can be transformed into two combinatorial problems, namely the integer programming problem and the weighted matching problem of a bipartite graph under different conditions. Regarding the data distribution, we recommend the full replication of workflow definition data and suggest different strategies in placing different types of instance data.
{"title":"Component and data distribution in a distributed workflow","authors":"San-Yih Hwang, Chi-Ten Yang","doi":"10.1109/APSEC.1998.733726","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733726","url":null,"abstract":"Designing a distributed workflow management system (WFMS) has become a topic with tremendous research interests in recent years. Unlike a traditional client-server WFMS that executes only at a single site, a distributed WFMS allows the execution of a workflow instance to be governed by more than one servers so as to achieve availability and efficiency. A consensus has generally been reached that the component-based approach is a promising one to designing a distributed WFMS. The component-based approach divides the functionality of a WFMS into a number of components, each of which follows some well-accepted distributed object standard, e.g. CORBA or DCOM. These components can be distributed transparently to different sites for execution, and cooperatively they achieve the goal of the underlying business process. Following the component-based approach, this paper proposes and discusses several alternatives on how to distribute the components and the data of a distributed WFMS. Specifically, the component distribution problem can be transformed into two combinatorial problems, namely the integer programming problem and the weighted matching problem of a bipartite graph under different conditions. Regarding the data distribution, we recommend the full replication of workflow definition data and suggest different strategies in placing different types of instance data.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114487068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733740
Chung-Hua Hu, Ji-Tzay Yang, Feng-Jian Wang, W. Chu
This paper presents a model called object-oriented attribute grammar (OOAG) that can be used to construct a toolset for software maintenance. The kernel of OOAG consists of two inter-related parts: a model-view-shape (MVS) application framework and an AG++, an object-oriented extension to traditional AGs. By combining compositional and generative techniques seamlessly, OOAG preserves both advantages introduced by respective OO and AG models, such as rapid prototyping, reusability, extensibility, and incrementality. So far, a toolset prototype consisting of a number of programming and maintenance tools were implemented using OOAG on the Windows environment. The editors developed can be used to construct programs by specifying the associated flow information in explicit (visual) or implicit (textual) ways, while the (incremental) maintenance tools, such as DU/UD tools and a program slicer, can help analyze incomplete program fragments to locate and inform the user of useful information.
{"title":"Constructing a toolset for software maintenance with OOAG","authors":"Chung-Hua Hu, Ji-Tzay Yang, Feng-Jian Wang, W. Chu","doi":"10.1109/APSEC.1998.733740","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733740","url":null,"abstract":"This paper presents a model called object-oriented attribute grammar (OOAG) that can be used to construct a toolset for software maintenance. The kernel of OOAG consists of two inter-related parts: a model-view-shape (MVS) application framework and an AG++, an object-oriented extension to traditional AGs. By combining compositional and generative techniques seamlessly, OOAG preserves both advantages introduced by respective OO and AG models, such as rapid prototyping, reusability, extensibility, and incrementality. So far, a toolset prototype consisting of a number of programming and maintenance tools were implemented using OOAG on the Windows environment. The editors developed can be used to construct programs by specifying the associated flow information in explicit (visual) or implicit (textual) ways, while the (incremental) maintenance tools, such as DU/UD tools and a program slicer, can help analyze incomplete program fragments to locate and inform the user of useful information.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116923665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733742
Junko Shirogane, Y. Fukazawa
The demand for Graphical User Interface (GUI) applications has witnessed an increase. However, it is difficult to develop such GUI applications, because their structures are complicated. Therefore, we propose an approach for the automatic generation of GUIs for the purpose of facilitating GUI applications' development from dialog description. These dialogs are described using a Petri net which includes GUI information. A special-purpose Petri net editor is developed for this purpose, so system designers can work in an environment which is suitable for developing GUI applications. The most important feature of this system is as follows: after generating GUI application, users can customize the detailed size and arrangement of widgets to suit the user's needs. This customization does not require the use of any special software tools. In this research, we assumed that GUI application development is divided into three roles, system designers who are in charge of dialog description, graphic designers who are in charge of the customization of GUI, and application programmers who are in charge of programming of applications. The system designers describe the dialog, then the graphic designers and application programmers work independently or simultaneously.
{"title":"Method of user-customizable GUI generation and its evaluation","authors":"Junko Shirogane, Y. Fukazawa","doi":"10.1109/APSEC.1998.733742","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733742","url":null,"abstract":"The demand for Graphical User Interface (GUI) applications has witnessed an increase. However, it is difficult to develop such GUI applications, because their structures are complicated. Therefore, we propose an approach for the automatic generation of GUIs for the purpose of facilitating GUI applications' development from dialog description. These dialogs are described using a Petri net which includes GUI information. A special-purpose Petri net editor is developed for this purpose, so system designers can work in an environment which is suitable for developing GUI applications. The most important feature of this system is as follows: after generating GUI application, users can customize the detailed size and arrangement of widgets to suit the user's needs. This customization does not require the use of any special software tools. In this research, we assumed that GUI application development is divided into three roles, system designers who are in charge of dialog description, graphic designers who are in charge of the customization of GUI, and application programmers who are in charge of programming of applications. The system designers describe the dialog, then the graphic designers and application programmers work independently or simultaneously.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123487377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733591
Eunsook Cho, Chul-Jin Kim, Soo Dong Kim, S. Rhew
In client/server and distributed applications, the quality of object clustering plays a key role in determining the overall performance of the system. Therefore, a set of objects with higher coupling should be grouped into a single cluster so that each cluster can have a higher cohesion. As a result, the overall message traffic among objects can be greatly minimized. In addition, it should also be considered in CORBA-based applications that clusters themselves can evolve due to the dynamic object migration feature of CORBA. Hence, dynamic metrics as well as as static metrics should be developed and used in order to measure the dynamic message traffic and to tune up the system performance effectively. Various object-oriented design metrics proposed mainly deal with static coupling and cohesion, and they only consider the basic class relationships such as association, inheritance, and composition. Therefore, these metrics are not appropriate for measuring the traffic load of object messages which is closely related to the system performance. In this paper, we propose a set of metrics which considers the relevant weights on the various class relationships and estimates the static and dynamic message flow among the objects at the detailed level of member functions. By applying these metrics along with OMT or UML, we believe that clusters can be defined more efficiently and systematically, yielding high performance distributed applications.
{"title":"Static and dynamic metrics for effective object clustering","authors":"Eunsook Cho, Chul-Jin Kim, Soo Dong Kim, S. Rhew","doi":"10.1109/APSEC.1998.733591","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733591","url":null,"abstract":"In client/server and distributed applications, the quality of object clustering plays a key role in determining the overall performance of the system. Therefore, a set of objects with higher coupling should be grouped into a single cluster so that each cluster can have a higher cohesion. As a result, the overall message traffic among objects can be greatly minimized. In addition, it should also be considered in CORBA-based applications that clusters themselves can evolve due to the dynamic object migration feature of CORBA. Hence, dynamic metrics as well as as static metrics should be developed and used in order to measure the dynamic message traffic and to tune up the system performance effectively. Various object-oriented design metrics proposed mainly deal with static coupling and cohesion, and they only consider the basic class relationships such as association, inheritance, and composition. Therefore, these metrics are not appropriate for measuring the traffic load of object messages which is closely related to the system performance. In this paper, we propose a set of metrics which considers the relevant weights on the various class relationships and estimates the static and dynamic message flow among the objects at the detailed level of member functions. By applying these metrics along with OMT or UML, we believe that clusters can be defined more efficiently and systematically, yielding high performance distributed applications.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128622340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：