A.K. Mok and D. Chen. A multiframe model for realtime tasks. IEEE Transactions on Software Engineering, 23(10):635--645, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....than the error incurred for the equivalent optimistic and pessimistic algorithms. The work in this paper leads to polynomial time algorithms for approximate schedulability analysis for various well known task models such as the Sporadic model due to Mok [8] the Multiframe model of Mok and Chen [9], the Generalized Multiframe model of Baruah et al. 3] and the recently proposed Recurring Real Time task model of Baruah [2, 1] The known algorithms for (exact) schedu1 lability analysis for all of these models are either pseudopolynomial or have exponential running time. Besides this, the ....

A. Mok and D. Chen. A multiframe model for realtime tasks. IEEE Transactions on Software Engineering, 23(10):635--645, 1997.

....change [2] among other tasks. Several approaches are available to help software developers locate and manage scattered concern code. Lexical searching tools, such as grep [1] code browsers, such as the Smalltalk integrated development environment [13] cross reference databases, such as CIA [7], and slicers [26] can each help a developer identify relevant points in the code and can help elicit the relationships between the different parts of a program. Alternatively, a developer may be able to leverage the identification of the change from a previous modification using version ....

....information can be specified at any point during a FEAT session: FEAT queries will use the last defined configuration information. 4.2 Implementation Details FEAT version 1.7.1 supports the Java language. In comparison to traditional source code analyzers and cross reference tools, such as CIA [7], or the framework of Canfora and colleagues [5] FEAT does not rely on a program database. Rather, it uses the compiled representation (bytecode) of the program directly, and is thus more similar to browsers for languages such as Smalltalk [13] or Trellis [19] FEAT is implemented in Java. It ....

[Article contains additional citation context not shown here]

Y.-F. Chen, M. Y. Nishimoto, and C. Ramamoorthy. The C information abstraction system. IEEE Transactions on Software Engineering, 16(3):325--334, March 1990.

....using binary relations for data representation. Relational database management systems provide the underlying repository structure for further program comprehension tools. An approach based on relational databases was first introduced by Linton in [18] more recent approaches are described in [5] and [24] Other repository structures are based on logic oriented data representations [3] 12] 4] LISP Images [20] syntax trees [27] or hybrid knowledge bases [11] This paper succeeds [24] which describes the results of applying the CPPANAL source code analyzer to the sources of the ....

Y.-F. Chen, M. Z. Nishimoto, C.V. Ramamoorthy. The C Information Abstraction System. IEEE Transactions on Software Engineering, 16 (3), pp. 325-334, March 1990.

....Many di#erent tools supporting re engineering have been introduced in the literature. Re engineering tools aid in creating a concept about the program to be re engineered. Di#erent re engineering tools have di#erent purposes. They can find certain structures or patterns from the program (e.g. [17, 87]) generate new documents about the program (e.g. 20, 51, 79] or visualize the program and provide special editors to browse the program (e.g. 21, 68, 82, 83, 91] Here, we 23 do not distinguish re engineering and reverse engineering tools. Tools are typically needed in reverse engineering ....

Chen, Y.-F., Nishimoto, M. Y., Ramamoorthy, C. V., The C information abstraction system, IEEE Transactions on Software Engineering 16 (3) 1990, 325--334.

....five tools that each extract a call graph from C [11] source code, applied the extractors to three target software systems, and analyzed the results both quantitatively and qualitatively. The five call graph extractors used in the study were: ffl CIA, the C Information Abstraction System [5], ffl rigiparse, a front end to the Rigi reverse engineering system [14] ffl the Field programming environment [16] ffl cflow, a tool distributed with most Unix systems, and ffl mkfunctmap, a Perl script developed by James Hoagland. We chose these tools because they are readily available, ....

Y.-F. Chen, M.Y. Nishimoto, and C.V. Ramamoorthy. The C Information Abstraction System. IEEE Transactions on Software Engineering, SE-16(3):325-- 334, March 1990.

....reference. Since the code fragment contains the item defined loc=1,3 contained in the desired context, the sequence of tokens 1 through 3 in the database (i.e. int z = 0) is returned as a solution. 3 Discussion and Related Work Current approaches to source code repositories, such as CIA [2], decompose the source code into component entities specified by a predefined model, resulting in a loss of context. By using MultiText, and treating the source as a contiguous sequence of tokens, we have avoided any loss of context. Existing approaches have other limitations which we believe ....

Chen, Y.-F., Nishimoto, M., and Ramamoorthy, C. V. The C information abstraction system. IEEE Transactions on Software Engineering 16, 3 (March 1990), 325--334.

....software maintenance or development task is is often not possible to parse the source code that is the target of the task. As a result, the developer or maintainer may have to resort to ad hoc methods for browsing and searching the code, since the majority of program maintenance tools, such as CIA [3], Rigi [16] and GUPRO [10] rely on traditional parsing techniques to extract information from the code. There are many reasons why an unparseable program would be the target of a maintenance activity. The code may have been written to run under a different operating system or may use language ....

Y.-F. Chen, M. Nishimoto, and C. V. Ramamoorthy. The C information abstraction system. IEEE Transactions on Software Engineering, 16(3):325--334, March 1990.

....understanding as been at either a lexical (token or string matching) or syntactic (parsing) level. Relational code analyzers (e.g. The Dependency Analysis Toolset (Wilde, 1989) MasterScope (Teitelman, 1981) Cscope (Steffen, 1985) AQL (Paul, 1994) and the C Information Abstraction System (Chen, 1990; Grass, 1992) deduce some code level structural relationships (e.g. who calls who, who sets who) from source code and provide a queryable database of these relations. The application of Refine technology in this respect is illustrated by Boeing s maintenance of an on line browser of a 200K LOC ....

Chen, Y. F., Nishimoto, M. Y and Ramamoorthy, C. V. 1990. The C Information Abstraction System. IEEE Transactions on Software Engineering 16 (3) pp. 324-- 334.

....become relevant. On the one hand the representation of software systems is affected by the programming languages used for implementing these software systems. Exchange formats for reengineering tools have to represent source code information for different single language systems (e.g. in C [6, 39] or Cobol [26] and even in multi language systems (e.g. 34] On the other hand reengineering tools cope with various levels of abstraction [29] These range from very fine grained source code representations (e.g. in the fields of detailed data flow and control flow analysis) to ....

Y.-F. Chen, M. Y. Nishimoto, and C. V. Ramamoorthy. The C Information Abstraction System. IEEE Transactions on Software Engineering, 16(3):325--334, March 1990.

....into three rough classes: 1. extractors, which collect information about the software, 2. manipulators, which change the form of this data, and 3. analyzers which determine and display information derived from the data. As an example of an extractor, the ACACIA C frontend from AT T Labs [3] parses C programs and stores the resulting information in a relational data base. GUPRO uses a YACC LEX like parser generator PDL [5] for generating parsers delivering TGraphs. Furthermore, there exist parser front ends providing abstract syntax trees e.g. EDG [13] for C C or ASIS (ADA ....

Y.-F. Chen, M. Y. Nishimoto, and C. V. Ramamoorthy. The C Information Abstraction System. IEEE Transactions on Software Engineering, 16(3):325--334, March 1990.

....the function call relation between functions. In the FIELD environment, FlowView [50] is used to present call graphs which are annotated with information passed by other tools, such as a profiler. In Whorf [13] call graphs are used as the primary navigational aid in a hypertext environment. CIA [22, 23] can produce a range of program dependency relations, amongst which are function call relations which are diagrammatically presented by DAG [33] Function call graphs are even used in functional programming development environments such as MicroScope for Common Lisp [3] which provides call graphs ....

Chen Y. F., Nishimoto M. Y., Ramamoorthy C. V. The C Information Abstraction system. IEEE Transactions on Software Engineering, 16(3):325--34, March 1990.

....disciplines Weighted Fair Queueing (WFQ) belongs to) Saha et al. addresses this issue [18] and propose a new scheduling algorithm and associated analysis. However, for (the commonly occurring) priority scheduled networks we are not aware of any method to analyse multi frame traffic. Mok and Chen [12] present an analysis for CPU scheduling of multi frame applications. Han [7] refines this analysis somewhat. However, these analysis techniques are not applicable to ATM networks since they cannot support traffic shaping that occurs in ATM networks, not are they applicable to distributed systems ....

A. Mok and D. Chen. A Multiframe Model for RealTime Tasks. IEEE Transactions on Software Engineering, 23(10):635--645, October 1997.

....has evolved from the related field of program visualisation. Visualisations of a program s source code are derived from dependencies that exist within and between program source documents. Since the late seventies, much work has gone into the analysis and extraction of program dependencies [9, 10, 17, 28, 31, 34, 39]. This work has paved the way for a wide variety of tools that provide visualisation of program dependencies. A predetermined set of software visualisations will not necessarily meet al..l of the user s comprehension needs. Jackendoff[18] tells us that Perception is the result of interaction ....

....interaction is generally limited to simple navigation. In this section we highlight the requirements for interaction with software visualisations in a software development environment in terms of the navigation and manipulation they provide. 3. 1 Navigation Early code analysis tools such as CIA[10], CIA [9] and Reprise[30] generate abstract representations of programs that can be used by graph drawing tools to present a variety of visualisations. In the simplest case of merely coupling a general graph drawing tool to these tools, no navigation is possible. However navigation between ....

Y.F. Chen, M. Y. Nishimoto, and C. V. Ramamoorthy. The C Information Abstraction system. IEEE Transactions on Software Engineering, 16(3):325--334, March 1990.

.... syntactic categories of the target programming languages, SCRUPLE [20] GENOA [7] by enriching the source with markup (Hypersoft [18] GRASP ML [6] CHIME [8] Jupiter [5] HSML [4] or by incorporating reference to a semantic model (Searchable Bookshelf [25, 21] tksee [15, 27] Rigi [17] CIA [3], Dali [29] SWAGKit [28] In the next subsection we discuss related work in software modeling. Commercial origin tools such as SNiFF (Wind River) and IDE s from Borland, Microsoft, IBM, Sun, etc. often combine these strategies with successful results: we applaud the trend which Sun and IBM have ....

Y. Chen, M. Nishimoto, and C. Ramamoorthy. The C Information Abstraction System. IEEE Transactions on Software Engineering, pages 3:325--334, 1990.

.... rate monotonic algorithm which allows deferred deadlines is considered in [19] The basic utilization based schedulability test has also been extended to the multiframe periodic task model in which successive invocations of a task alternate among multiple frames with different execution times [15]. Improvements of the basic multiframe schedulability test are proposed in [6] Utilization bounds for multiprocessors have received recent attention. The authors of [16] derive the worst case achievable utilization of a critically schedulable task set using rate monotonic scheduling on a ....

A. K. Mok and D. Chen. A multiframe model for realtime tasks. IEEE Transactions on Software Engineering, 23(10):635--645, October 1997.

....CIAO [6] a user interface can be generated to graph relationships in a Java program. CIAO takes a specification for a language and generates a set of supporting tools for querying and visualizing databases for that language. Instantiations of CIAO exist for a variety of languages including C [9], C [7] HTML [8] and ksh. Going back to our example in the previous section, we can use the Java instance of CIAO to show its class inheritance graph as seen in Figure 4. Another query can be made to the database returning all relationships that exist in the application, as shown in Figure 3. ....

Y.-F. Chen, M. Nishimoto, and C. V. Ramamoorthy. The C Information Abstraction System. IEEE Transactions on Software Engineering, 16(3):325-- 334, Mar. 1990.

....for querying and visualizing databases for that language. Instantiations of CIAO exist for a Circle void Circle.Circle(double) double Circle.area( double Circle.circumference( void Circle. clinit ( Circle.r Circle.PI Figure 5: Members of class Circle variety of languages including C [9], C [7] html [8] and ksh. Going back to our example in the previous section, we can use CIAO to show its class inheritance graph as seen in Figure 4. Another query can be made to the database returning all relationships that exist in the application, shown in Figure 3. In the graphs, each ....

Y.-F. Chen, M. Nishimoto, and C. V. Ramamoorthy. The C Information Abstraction System. IEEE Transactions on Software Engineering, 16(3):325-- 334, Mar. 1990.

No context found.

A.K. Mok and D. Chen. A multiframe model for realtime tasks. IEEE Transactions on Software Engineering, 23(10):635--645, 1997.

No context found.

Y.-F. Chen, M. Nishimoto, and C. Ramamoorthy. The C Information Abstraction System. IEEE Transactions on Software Engineering, 16(3):325--334, Mar. 1990.

No context found.

Y.-F. Chen, M. Nishimoto, and C. Ramamoorthy. The C Information Abstraction System. IEEE Transactions on Software Engineering, 16(3):325--334, Mar. 1990.

No context found.

Yih-Farn Chen, Michael Y. Nishimoto, and C.V. Ramamoorthy. The C Information Abstraction System. IEEE Transactions on Software Engineering, Vol. 16, No. 3, Pages 325-334, March 1990.

No context found.

Chen, Y., Nishimoto, M. and Ramamoorthy, C.: The C Information Abstraction System. IEEE Transaction on Software Engineering (1990) 325-334.

No context found.

A. K. Mok and D. Chen. A multiframe model for realtime tasks. IEEE transactions on Software Engineering, 23(10):635--645, October 1997.

No context found.

A. Mok and D. Chen. A Multiframe Model for RealTime Tasks. IEEE Transactions on Software Engineering, 23(10):635--645, October 1997.

No context found.

Yih-Farn Chen, Michael Y. Nishimoto, and C.V. Ramamoorthy. The C in- formation abstraction system. IEEE Transactions on Software Engineering, 16(3):325 333, March 1990.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC