Pub Date : 1992-05-04DOI: 10.1109/CMPEUR.1992.218507
B. Vergauwen, J. Lewi
By means of the mu PABX example, the adequacy of temporal logic was demonstrated for the specification and formal verification of industrial reactive systems. The aim of the mu PABX system is to provide services that are issued by phone-users of the mu PABX. In contrast to a real PABX, the mu PABX offers only one type of service to its subscribers: two-party voice calls. Formal verification avoids the deficiencies of testing by proving mathematically that the system behaves according to the specification. For this to be possible, the system behavior must be defined with mathematical precision. The focus is on the formal verification of the mu PABX. It is demonstrated that, if temporal logic is used, the task of proof construction can be 100% automated. An implementation of the mu PABX system is discussed.<>
{"title":"Formal verifications: an industrial case study","authors":"B. Vergauwen, J. Lewi","doi":"10.1109/CMPEUR.1992.218507","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218507","url":null,"abstract":"By means of the mu PABX example, the adequacy of temporal logic was demonstrated for the specification and formal verification of industrial reactive systems. The aim of the mu PABX system is to provide services that are issued by phone-users of the mu PABX. In contrast to a real PABX, the mu PABX offers only one type of service to its subscribers: two-party voice calls. Formal verification avoids the deficiencies of testing by proving mathematically that the system behaves according to the specification. For this to be possible, the system behavior must be defined with mathematical precision. The focus is on the formal verification of the mu PABX. It is demonstrated that, if temporal logic is used, the task of proof construction can be 100% automated. An implementation of the mu PABX system is discussed.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123039599","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 : 1992-05-04DOI: 10.1109/CMPEUR.1992.218444
I. Stahl, B. Tausend, R. Wirth
The authors describe a method for learning disjunctive concepts represented as Horn clauses in a general-to-specific manner. They have identified a restricted class of Horn clauses for which positive examples are sufficient to detect overgeneral clauses. The method, developed and implemented in a system called INDICO, extracts as much constraining information as possible from the examples, such that the space of possible solutions can be searched efficiently. INDICO works in three steps. First, the argument types of the target predicate are determined. Second, the example set is partitioned and for each partition a clause head is determined which covers all the examples in the partition. Third, the clauses are specialized by adding literals, including newly invented ones, to their body until the definition is correct. Some experimental results are presented.<>
{"title":"General-to-specific learning of Horn clauses from positive examples","authors":"I. Stahl, B. Tausend, R. Wirth","doi":"10.1109/CMPEUR.1992.218444","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218444","url":null,"abstract":"The authors describe a method for learning disjunctive concepts represented as Horn clauses in a general-to-specific manner. They have identified a restricted class of Horn clauses for which positive examples are sufficient to detect overgeneral clauses. The method, developed and implemented in a system called INDICO, extracts as much constraining information as possible from the examples, such that the space of possible solutions can be searched efficiently. INDICO works in three steps. First, the argument types of the target predicate are determined. Second, the example set is partitioned and for each partition a clause head is determined which covers all the examples in the partition. Third, the clauses are specialized by adding literals, including newly invented ones, to their body until the definition is correct. Some experimental results are presented.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"30 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114381317","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 : 1992-05-04DOI: 10.1109/CMPEUR.1992.218502
L. Shen, M.F.A. Deprettere
The authors earlier proposed a new space partitioning for mapping computations of the radiosity method onto a highly pipelined parallel architecture (L.S. Shen et al., 1990; 1991). This shelling technique can alleviate the communication load between the host and the processors in a shared-memory architecture, but the system performance might deteriorate when increasing the number of processors. A memory structure which is a hierarchy of resident set, cache, and main memory is presented. It can reduce the average access time of a patch and thus provide better balancing between processing throughput and memory bandwidth, to enhance the pipelinability of computations. A method of selecting the resident set is described, and different policies in the cache design are investigated.<>
{"title":"A hierarchical memory structure for the 3D shelling technique","authors":"L. Shen, M.F.A. Deprettere","doi":"10.1109/CMPEUR.1992.218502","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218502","url":null,"abstract":"The authors earlier proposed a new space partitioning for mapping computations of the radiosity method onto a highly pipelined parallel architecture (L.S. Shen et al., 1990; 1991). This shelling technique can alleviate the communication load between the host and the processors in a shared-memory architecture, but the system performance might deteriorate when increasing the number of processors. A memory structure which is a hierarchy of resident set, cache, and main memory is presented. It can reduce the average access time of a patch and thus provide better balancing between processing throughput and memory bandwidth, to enhance the pipelinability of computations. A method of selecting the resident set is described, and different policies in the cache design are investigated.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127339312","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 : 1992-05-04DOI: 10.1109/CMPEUR.1992.218459
J. Barbe, C. Verhoest
Business applications still represent the largest installed software base of the information technology market. The authors identify business applications as those information systems which are, in general, characterized by a relative low level of algorithmic complexity, a large amount of persistent data needing concurrent access, the need for online access within a given delay, and a high degree of security. They present the Business Class project, which foresees a generic object-oriented (OO) model for analysis, several technology related OO models for design, an integrated CASE tool environment to support both phases, and an accompanying methodology, all dedicated to the domain of business applications. The possible benefits of the use of OO technology for business application development are discussed. The solution proposed by the Business Class project is introduced. The generic OO model used for the analysis phase is described.<>
{"title":"Why to go Business Class (IT applications)","authors":"J. Barbe, C. Verhoest","doi":"10.1109/CMPEUR.1992.218459","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218459","url":null,"abstract":"Business applications still represent the largest installed software base of the information technology market. The authors identify business applications as those information systems which are, in general, characterized by a relative low level of algorithmic complexity, a large amount of persistent data needing concurrent access, the need for online access within a given delay, and a high degree of security. They present the Business Class project, which foresees a generic object-oriented (OO) model for analysis, several technology related OO models for design, an integrated CASE tool environment to support both phases, and an accompanying methodology, all dedicated to the domain of business applications. The possible benefits of the use of OO technology for business application development are discussed. The solution proposed by the Business Class project is introduced. The generic OO model used for the analysis phase is described.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127589610","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 : 1992-05-04DOI: 10.1109/CMPEUR.1992.218503
C. D. Kloos, W. Dosch, B. Moller
Transformational development makes it possible to design systems and simultaneously to prove them correct. Transformational developments are presented of multiplier circuits from a common specification. Careful choice of the notation (a functional language with polymorphic and dependent higher-order sub types), and of the foundations for the transformations (some lemmas over the data domains, embeddings of functions into more general ones, and use of the unfold/fold strategy) allows one to highlight the design decisions in a systematic manner. The major design decisions are discussed, and important intermediate versions of the algorithms arising during the derivation are given. One sample development is presented.<>
{"title":"Design and proof of multipliers by correctness-preserving transformation","authors":"C. D. Kloos, W. Dosch, B. Moller","doi":"10.1109/CMPEUR.1992.218503","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218503","url":null,"abstract":"Transformational development makes it possible to design systems and simultaneously to prove them correct. Transformational developments are presented of multiplier circuits from a common specification. Careful choice of the notation (a functional language with polymorphic and dependent higher-order sub types), and of the foundations for the transformations (some lemmas over the data domains, embeddings of functions into more general ones, and use of the unfold/fold strategy) allows one to highlight the design decisions in a systematic manner. The major design decisions are discussed, and important intermediate versions of the algorithms arising during the derivation are given. One sample development is presented.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124138034","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 : 1992-05-04DOI: 10.1109/CMPEUR.1992.218441
S. Neusser, J. Nijhuis, L. Spaanenburg
An approach to autonomous vehicle navigation using neural networks to imitate human driving behavior is presented. The results are based on the measured actions of a real human driver in a real car. The car environment and the information that is recorded during driving are described. The problem that should be solved by the neural network is discussed. The actual learning of the driving task is presented. The quality of the leaned driving behavior is reviewed. The experiments showed that medium-sized neural networks were able to approximate the driving behavior within a maximum error of 5%.<>
{"title":"Developments in autonomous vehicle navigation","authors":"S. Neusser, J. Nijhuis, L. Spaanenburg","doi":"10.1109/CMPEUR.1992.218441","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218441","url":null,"abstract":"An approach to autonomous vehicle navigation using neural networks to imitate human driving behavior is presented. The results are based on the measured actions of a real human driver in a real car. The car environment and the information that is recorded during driving are described. The problem that should be solved by the neural network is discussed. The actual learning of the driving task is presented. The quality of the leaned driving behavior is reviewed. The experiments showed that medium-sized neural networks were able to approximate the driving behavior within a maximum error of 5%.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122296380","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 : 1992-05-04DOI: 10.1109/CMPEUR.1992.218483
J. Opsommer
Task granularity is a critical issue in the partitioning of a parallel program. To adjust automatically the task granularity for the target system, the solution used for the grain-size problem is the bottom-up approach: first the program is partitioned into elementary operations and mathematical functions and then several operations are combined into larger tasks. The conglomeration of tasks is controlled by attraction values: the attraction between two tasks is proportional to the benefit of aggregating the two tasks. The clustering heuristic is embedded in the definition of the attraction between tasks as only tasks with an attraction value higher than a certain threshold are conglomerated. It is assumed that the task graph structure and the task lengths are known at compile time. This information is used by the clustering algorithm. The algorithm defines an attraction between two tasks and then conglomerates the tasks for which the attraction is larger than a given threshold.<>
{"title":"A taskgraph clustering algorithm based on an attraction metric between tasks","authors":"J. Opsommer","doi":"10.1109/CMPEUR.1992.218483","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218483","url":null,"abstract":"Task granularity is a critical issue in the partitioning of a parallel program. To adjust automatically the task granularity for the target system, the solution used for the grain-size problem is the bottom-up approach: first the program is partitioned into elementary operations and mathematical functions and then several operations are combined into larger tasks. The conglomeration of tasks is controlled by attraction values: the attraction between two tasks is proportional to the benefit of aggregating the two tasks. The clustering heuristic is embedded in the definition of the attraction between tasks as only tasks with an attraction value higher than a certain threshold are conglomerated. It is assumed that the task graph structure and the task lengths are known at compile time. This information is used by the clustering algorithm. The algorithm defines an attraction between two tasks and then conglomerates the tasks for which the attraction is larger than a given threshold.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125764691","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 : 1992-05-04DOI: 10.1109/CMPEUR.1992.218467
M. Hamdi
The author discusses the problem of designing high-speed fiber-optic LANs. A brief description of the architecture of a bridge is given, and its conceptual design is provided. Optical logic gates, which are the basic elements in designing optical digital circuits, are introduced. The design of an all-optical storage device, which is the basic component of the buffering system in a bridge, is shown. The design and operation of electronic shift registers and optical shift registers are explained. These optical shift registers constitute the whole buffering system in a bridge. The implementation of an optical lookup table needed for packet processing in a bridge is provided.<>
{"title":"Optical bridges for fiber optic local area networks","authors":"M. Hamdi","doi":"10.1109/CMPEUR.1992.218467","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218467","url":null,"abstract":"The author discusses the problem of designing high-speed fiber-optic LANs. A brief description of the architecture of a bridge is given, and its conceptual design is provided. Optical logic gates, which are the basic elements in designing optical digital circuits, are introduced. The design of an all-optical storage device, which is the basic component of the buffering system in a bridge, is shown. The design and operation of electronic shift registers and optical shift registers are explained. These optical shift registers constitute the whole buffering system in a bridge. The implementation of an optical lookup table needed for packet processing in a bridge is provided.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129494443","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 : 1992-05-04DOI: 10.1109/CMPEUR.1992.218519
A. Oláh, S. H. Gerez, S.M.H. de Groot
A scheduling and allocation method is given for the high-level synthesis of DSP algorithms described by iterative data flow graphs. The method is based on the concept of scheduling ranges. It generates overlapped schedules, while performing retiming and loop folding implicitly. The scheduler operates on the input and output data transfers of the operations in the graph, allowing a trade-off of functional units against buses. For each transfer a scheduling range is computed and the optimal position within this range is found by modified force-directed scheduling. The method has obtained optimal results for well-known benchmark examples.<>
{"title":"Scheduling and allocation for the high-level synthesis of DSP algorithms by exploitation of data transfer mobility","authors":"A. Oláh, S. H. Gerez, S.M.H. de Groot","doi":"10.1109/CMPEUR.1992.218519","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218519","url":null,"abstract":"A scheduling and allocation method is given for the high-level synthesis of DSP algorithms described by iterative data flow graphs. The method is based on the concept of scheduling ranges. It generates overlapped schedules, while performing retiming and loop folding implicitly. The scheduler operates on the input and output data transfers of the operations in the graph, allowing a trade-off of functional units against buses. For each transfer a scheduling range is computed and the optimal position within this range is found by modified force-directed scheduling. The method has obtained optimal results for well-known benchmark examples.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134218511","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 : 1992-05-04DOI: 10.1109/CMPEUR.1992.218477
R. Bergmann
A new approach for software reuse is presented which allows for the efficient preparation of already available programs, so that they can be automatically reused for novel programming tasks. Explanation-based learning from programs, guided by a domain theory of the semantics of the programming language, was used to acquire skeletal programs. For that purpose, a symbolic trace is constructed as an explanation of the functioning of a program, which may contain different types of control constructs such as sequential execution, conditional execution, and recursion. Explanation-based generalization was extended to explicitly handle these different kinds of execution control which are most essential for computer programs.<>
{"title":"Explanation-based learning for the automated reuse of programs","authors":"R. Bergmann","doi":"10.1109/CMPEUR.1992.218477","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218477","url":null,"abstract":"A new approach for software reuse is presented which allows for the efficient preparation of already available programs, so that they can be automatically reused for novel programming tasks. Explanation-based learning from programs, guided by a domain theory of the semantics of the programming language, was used to acquire skeletal programs. For that purpose, a symbolic trace is constructed as an explanation of the functioning of a program, which may contain different types of control constructs such as sequential execution, conditional execution, and recursion. Explanation-based generalization was extended to explicitly handle these different kinds of execution control which are most essential for computer programs.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130117797","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
扫码关注我们
求助内容：
应助结果提醒方式：