Browsing by Subject "Computer Programming Languages"

Now showing 1 - 3 of 3

Unknown
Estelle-based test generation tool
(Elsevier, 1991) Sarikaya, B.; Forghani, B.; Eswara, S.
A test design tool for functional analysis and test derivation of protocols formally specified using an extended finitestate machine model is presented. The formal description language supported is Estelle. The tool's main components include a compiler, a normalizer, a multiple module transition tour generator and several interactive programs. The tool is based on a static analysis of Estelle called normalization, which is explained in detail with various examples. The normalized specification facilitates graphical displays of the control and data flow in the specification by the interactive tools. Next discussed is test generation, which is based on verifying the control and data flow. First the data flow graph must be decomposed into blocks where each block represents the data flow in a protocol function. From the control graph the tool generates transition tours, and then test sequences are derived from the transition tour to test each function. The performance of the tool on various applications is also included. © 1991.
Unknown
Experience using a project-based approach in an introductory programming course
(IEEE, 2000) Davenport, D.
This paper describes how and why our department chose to integrate a sophisticated visual programming environment (DELPHI) into the introductory programming course (CS101/2) of the first-year undergraduate engineering curriculum. It also reports on the outcome of this venture, which involved a switch from a conventional lecture-based approach to teaching CS102 to a project-based approach. While it meant more work for both students and teachers the overall response from both parties was very positive. Indeed, the resulting designs and subsequent survey results seem to confirm that students achieved a better appreciation and understanding of the course's objectives.
Unknown
Learning translation templates for closely related languages
(Springer, Berlin, Heidelberg, 2003) Altıntaş, Kemal; Güvenir, H. Altay
Many researchers have worked on example-based machine translation and different techniques have been investigated in the area. In literature, a method of using translation templates learned from bilingual example pairs was proposed. The paper investigates the possibility of applying the same idea for close languages where word order is preserved. In addition to applying the original algorithm for example pairs, we believe that the similarities between the translated sentences may always be learned as atomic translations. Since the word order is almost always preserved, there is no need to have any previous knowledge to identify the corresponding differences. The paper concludes that applying this method for close languages may improve the performance of the system.