Pub Date : 1996-08-19DOI: 10.1109/CMPSAC.1996.541419
A. Hazeyama, S. Komiya
Workers in software projects are usually engaged in main development and other work, concurrently. Other work might put pressure on the schedule of the whole project. Therefore an order to manage the whole project appropriately, not only the main development work but also other work should be dealt with as management objects. The paper clarifies a framework to support various types of work and different granularity of processes in an integrated manner and shows the behavior of the system using an example. This framework enables appropriate process management of the whole project by taking into consideration workers' workloads (who is doing what activity at what workload at what time).
{"title":"A software process management system considering workers' workload","authors":"A. Hazeyama, S. Komiya","doi":"10.1109/CMPSAC.1996.541419","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.541419","url":null,"abstract":"Workers in software projects are usually engaged in main development and other work, concurrently. Other work might put pressure on the schedule of the whole project. Therefore an order to manage the whole project appropriately, not only the main development work but also other work should be dealt with as management objects. The paper clarifies a framework to support various types of work and different granularity of processes in an integrated manner and shows the behavior of the system using an example. This framework enables appropriate process management of the whole project by taking into consideration workers' workloads (who is doing what activity at what workload at what time).","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123167161","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544155
J. B. Thompson
A recurring theme within the software industry since its inception has been the problem of poor quality software. Over the last few years object-orientated (OO) approaches have been promoted as a major panacea to these ills and it is claimed that already they are widely adopted. This may be true in education where a recent survey of 27 UK universities reported that all were teaching OO technology to some degree. However, the same is not necessarily true of industry and one must question whether or not they are really addressing fundamental problems or are simply yet another technological fad.
{"title":"OO is NOT the silver bullet","authors":"J. B. Thompson","doi":"10.1109/CMPSAC.1996.544155","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544155","url":null,"abstract":"A recurring theme within the software industry since its inception has been the problem of poor quality software. Over the last few years object-orientated (OO) approaches have been promoted as a major panacea to these ills and it is claimed that already they are widely adopted. This may be true in education where a recent survey of 27 UK universities reported that all were teaching OO technology to some degree. However, the same is not necessarily true of industry and one must question whether or not they are really addressing fundamental problems or are simply yet another technological fad.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115921811","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.542428
Weili Yao, Xudong He
Petri nets have been widely used as a tool for modeling and analyzing concurrent and distributed system for many years but their applications have been limited to the earlier activities of software system development. To make Petri nets a full fledged software development methodology, systematic (eventually automatic) code generation techniques are needed. We present an approach to derive parallel program skeletons from Petri nets which establishes a link between Petri nets and OO parallel programming and forms a foundation for a Petri net based transformational software development methodology.
{"title":"Mapping Petri nets to parallel programs in CC++","authors":"Weili Yao, Xudong He","doi":"10.1109/CMPSAC.1996.542428","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.542428","url":null,"abstract":"Petri nets have been widely used as a tool for modeling and analyzing concurrent and distributed system for many years but their applications have been limited to the earlier activities of software system development. To make Petri nets a full fledged software development methodology, systematic (eventually automatic) code generation techniques are needed. We present an approach to derive parallel program skeletons from Petri nets which establishes a link between Petri nets and OO parallel programming and forms a foundation for a Petri net based transformational software development methodology.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116023361","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.545879
M. Matsumoto
Software engineering education at higher education has to play at least two roles as showing software engineering researches the right direction along with which they must carry out their works in a non-trivial way. Today's gap forces us to do this role which is thought beyond education. The other role is educating students whatever useful technology for their developing systems. The author's experiences show that playing these two roles brings great advantages.
{"title":"Emerging software engineering education","authors":"M. Matsumoto","doi":"10.1109/CMPSAC.1996.545879","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.545879","url":null,"abstract":"Software engineering education at higher education has to play at least two roles as showing software engineering researches the right direction along with which they must carry out their works in a non-trivial way. Today's gap forces us to do this role which is thought beyond education. The other role is educating students whatever useful technology for their developing systems. The author's experiences show that playing these two roles brings great advantages.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116061270","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.542422
M. Makungu, R. St.-Denis, M. Barbeau
Several formal methods model reactive systems as discrete-event systems (DES). This makes mathematical reasoning about their properties easier and controller synthesis possible. We investigate the forbidden state control problem in which a DES is represented as a colored Petri net with a symmetry specification. More specifically, we provide an efficient formal method for synthesizing a controller which, when combined with the original system, will avoid reaching forbidden states. This problem is decidable if the colored Petri net has finite color sets and bounded places. Unlike conventional methods that explore the entire reachable set of states, our method avoids an exhaustive search of the state space by exploiting a symmetry specification. Furthermore, this abstraction technique allows a compact representation for the controller. Therefore, our method performs particularly well when applied to large but structured processes with similar components.
{"title":"A colored Petri net-based formal method for the design of control systems","authors":"M. Makungu, R. St.-Denis, M. Barbeau","doi":"10.1109/CMPSAC.1996.542422","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.542422","url":null,"abstract":"Several formal methods model reactive systems as discrete-event systems (DES). This makes mathematical reasoning about their properties easier and controller synthesis possible. We investigate the forbidden state control problem in which a DES is represented as a colored Petri net with a symmetry specification. More specifically, we provide an efficient formal method for synthesizing a controller which, when combined with the original system, will avoid reaching forbidden states. This problem is decidable if the colored Petri net has finite color sets and bounded places. Unlike conventional methods that explore the entire reachable set of states, our method avoids an exhaustive search of the state space by exploiting a symmetry specification. Furthermore, this abstraction technique allows a compact representation for the controller. Therefore, our method performs particularly well when applied to large but structured processes with similar components.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123872676","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.542423
J. Tsai, S. J. Yang, Yao-Hsiung Chang, Eric Y. T. Juan
Timing analysis is essential to the development of valid computer systems especially for a distributed real-time system. We present both static and dynamic analysis procedures to verify timing properties of distributed real-time systems using timing constraint Petri nets (TCPNs). With both derived static information and collected dynamic data, we can locate a faulty task in a distributed real-time system using a timing behavior cross reference task. After a faulty task has been pinpointed the causes of a timing constraint violation in a faulty task can be identified.
{"title":"Verifying timing properties for distributed real-time systems using timing constraint Petri nets","authors":"J. Tsai, S. J. Yang, Yao-Hsiung Chang, Eric Y. T. Juan","doi":"10.1109/CMPSAC.1996.542423","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.542423","url":null,"abstract":"Timing analysis is essential to the development of valid computer systems especially for a distributed real-time system. We present both static and dynamic analysis procedures to verify timing properties of distributed real-time systems using timing constraint Petri nets (TCPNs). With both derived static information and collected dynamic data, we can locate a faulty task in a distributed real-time system using a timing behavior cross reference task. After a faulty task has been pinpointed the causes of a timing constraint violation in a faulty task can be identified.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115453483","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544165
Ying Lu, Ee-Peng Lim
It is widely accepted that future digital library applications have to be built upon different kinds of database servers to draw different forms of data from them. These data include bibliographic data, text data, multimedia data, and structured data. We address the problem of integrating existing bibliographic and structured databases which reside at different locations in the network. To integrate bibliographic data and structured data, we extended the well-known SQL model to represent bibliographic related attributes and queries. In particular, we have added a new data type to model attributes in the bibliographic database. We have also designed specialized predicates and functions that can be used to formulate queries on bibliographic data alone as well as queries on both bibliographic and structured data. By combining our SQL extensions with the other SQL extensions that model general text data, we believe that a versatile query language layer can be made available to our future digital library application development.
{"title":"On integrating existing bibliographic databases and structured databases","authors":"Ying Lu, Ee-Peng Lim","doi":"10.1109/CMPSAC.1996.544165","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544165","url":null,"abstract":"It is widely accepted that future digital library applications have to be built upon different kinds of database servers to draw different forms of data from them. These data include bibliographic data, text data, multimedia data, and structured data. We address the problem of integrating existing bibliographic and structured databases which reside at different locations in the network. To integrate bibliographic data and structured data, we extended the well-known SQL model to represent bibliographic related attributes and queries. In particular, we have added a new data type to model attributes in the bibliographic database. We have also designed specialized predicates and functions that can be used to formulate queries on bibliographic data alone as well as queries on both bibliographic and structured data. By combining our SQL extensions with the other SQL extensions that model general text data, we believe that a versatile query language layer can be made available to our future digital library application development.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130071795","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544167
K. Chon
Conference proceedings like many other documents are increasingly converted from hardcopy to online. This trend is being accelerated by the recent development of the World Wide Web. The article summarizes the online, hypermedia proceedings of the recent conference, INET'95. The online document, called hypermedia proceedings was developed in the very short time of three months with a multi national collaborative effort. The hypermedia proceedings were made available for access two months prior to the conference date. This allowed people to read the papers and comment on them before they came to the conference. The hypermedia proceedings server even read the abstracts for the user using natural or artificial voices.
{"title":"Hypermedia conference proceedings","authors":"K. Chon","doi":"10.1109/CMPSAC.1996.544167","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544167","url":null,"abstract":"Conference proceedings like many other documents are increasingly converted from hardcopy to online. This trend is being accelerated by the recent development of the World Wide Web. The article summarizes the online, hypermedia proceedings of the recent conference, INET'95. The online document, called hypermedia proceedings was developed in the very short time of three months with a multi national collaborative effort. The hypermedia proceedings were made available for access two months prior to the conference date. This allowed people to read the papers and comment on them before they came to the conference. The hypermedia proceedings server even read the abstracts for the user using natural or artificial voices.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126411806","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544614
Kuniaki Naoi, N. Takahashi
Detecting infeasible paths (IFPs) allows accurate computation of various kinds of program slices, and accurate detection of semantic errors that may occur when two variants of a program are merged. We propose a method of efficiently determining the truth of a prenex normal form Presburger sentence (P-sentence) bounded only by existential quantifiers, which is suitable for detecting IFPs. In this method, a coefficients matrix is converted into a triangular matrix based on the method proposed by Cooper (1972). If the rank of the matrix is lower than the degree of the matrix, the matrix is triangulated by using a method for solving one linear equation with three or more unknowns, so that the matrix can be back-substituted. This paper shows that an implementation of our method provides a slower increase in computation time than the previous method and reduces computation time by up to 3,000,000 times.
{"title":"Detection of infeasible paths using Presburger arithmetic","authors":"Kuniaki Naoi, N. Takahashi","doi":"10.1109/CMPSAC.1996.544614","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544614","url":null,"abstract":"Detecting infeasible paths (IFPs) allows accurate computation of various kinds of program slices, and accurate detection of semantic errors that may occur when two variants of a program are merged. We propose a method of efficiently determining the truth of a prenex normal form Presburger sentence (P-sentence) bounded only by existential quantifiers, which is suitable for detecting IFPs. In this method, a coefficients matrix is converted into a triangular matrix based on the method proposed by Cooper (1972). If the rank of the matrix is lower than the degree of the matrix, the matrix is triangulated by using a method for solving one linear equation with three or more unknowns, so that the matrix can be back-substituted. This paper shows that an implementation of our method provides a slower increase in computation time than the previous method and reduces computation time by up to 3,000,000 times.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125839898","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544597
J. Ning
Most existing software development processes, methods, and tools are weak in supporting architecture modeling and component reuse. This paper introduces concepts and principles behind Component-Based Software Engineering (CBSE), the style of system construction by component assembly. A process model and supporting technologies are described. Central to this model is explicit representation of software components and component-based architectures.
{"title":"A Component-Based Software Development Model","authors":"J. Ning","doi":"10.1109/CMPSAC.1996.544597","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544597","url":null,"abstract":"Most existing software development processes, methods, and tools are weak in supporting architecture modeling and component reuse. This paper introduces concepts and principles behind Component-Based Software Engineering (CBSE), the style of system construction by component assembly. A process model and supporting technologies are described. Central to this model is explicit representation of software components and component-based architectures.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127485763","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
扫码关注我们
求助内容：
应助结果提醒方式：