| Geoffrey Clemm and Leon Osterweil. A mechanism for environment integration. ACM Transactions on Programming Languages and Systems, 12(1):1--25, January 1990. |
....denotes the probability that execution will follow edge v w once it reaches edge u v. Consequently, the sum of the probabilities for all outgoing edges of edge u v must be either one or zero 1 . Path profiling techniques necessary to compute occurs( u,v,w] r ) are discussed in detail in [19]. p(u; v; w) occurs( u,v,w] r ) occurs(u v;r ) if occurs(u v; r ) 6= 0; 0 otherwise. 2) Next we introduce a function In to determine the set of preceding ingoing edges of an edge. The function is derived from the exploded CFG. Fig. 3 depicts the relation between an edge v w with ....
C. Young and M.D. Smith. Static correlated branch prediction. ACM Transactions on Programming Languages and Systems, 21(5):1028--1075, September 1999.
....a service database, and whose free combination and communication is used to obtain the performance of various complex, full fledged applications and to carry out all the tasks in the environment. Tool fragmentation is the basic integration principle of several systems, like RPDE [23] 37] Odin [7] and IDL [47] 48] RPDE maintains tables that represent its tool fragments as the cross product of objects (i.e. structural components that can be manipulated by applications) and roles and methods (i.e. procedural components used to act upon objects) Odin has a very similar concept of objects ....
Geoffrey Clemm and Leon Osterweil. A mechanism for environment integration. ACM Transactions on Programming Languages and Systems, 12(1):1--25, January 1990.
....message bus products, such as Sun Tooltalk, DEC FUSE and HP SoftBench, combine ideas introduced in Field and Polylith. Tool fragmentation (usually in larger pieces than for the language based editors above) is the basic integration principle of several systems, including RPDE [31] 48] Odin [14] and IDL [57] 58] RPDE maintains tables that represent its tool fragments as the cross product of objects (i.e. structural components that can be manipulated by applications) and roles and methods (i.e. procedural components used to act upon objects) Odin has a very similar concept of objects ....
Geoffrey Clemm and Leon Osterweil. A mechanism for environment integration. ACM Transactions on Programming Languages and Systems, 12(1):1--25, January 1990.
....and while it is not necessarily the case that requirement documents will be written before designs, there is certainly a logical relationship between them that makes design depend on requirements. Ordered relationships like these have been used for many years to automate efficient compilation [7, 9]. However, these techniques have yet to be applied to informal software documents. 3 The Software Concordance Research Plan The Software Concordance project has an ambitious research plan that involves research on fundamentals concepts and representations as well as involving the construction of ....
Geoffrey Clemm and Leon Osterweil. A mechanism for environment integration. ACM Transactions of Programming Languages and Systems, 12(1):1--25, January 1990.
....operator symbols for the address and dereferencing operators from C. C and Modula 2 are among the few surviving languages which have an address operator; even Limbo, Lucent s intended successor to C [20] only supports references as boxes. Smith and Volpano describe a novel typing framework for ML [26] which introduces mutable bindings into the language. Their proposal is largely orthogonal to ours, as using a mutable binding instead of a ref cell sometimes avoids typing problems. Their framework is also able to type an operator. However, their work makes no effort to address the ....
Geoffrey Smith and Dennis Volpano. Polymorphic typing of variables and references. ACM Transactions on Programming Languages and Systems, 18(3):254--267, May 1996.
....which invokes all components according to the rule system. Examples for this scenario is make. Here the components are programs that have to be invoked according to the set of dependencies in a Makefile. They communicate via the shared file system. Odin is another, more sophisticated example [CO90] Odin does not maintain explicit dependency files, but calculates the dependency graph from a predefined rule base and a control flow plan. without connector defined control flow Composite connectors may not specify a linking, but turn the parameter components into active processes, which ....
Geoffrey Clemm and Leon Osterweil. A mechanism for environment integration. ACM Transactions on Programming Languages and Systems, 12(1):1--25, January 1990.
No context found.
C. Young and M. D. Smith. Static correlated branch prediction. ACM Transactions on Programming Languages and Systems, May 1999.
....is the large body of To appear in Science of Computer Programming, vol. 32, nos. 2 3, 1998. This material is based upon work supported by the National Science Foundation under Grants No. CCR 9414421 and CCR 9400592. Preprint submitted to Elsevier Preprint 31 March 1997 work surrounding ML [4,21,14,5,11,24,22,19]. However, none of these e orts addresses the polymorphic typing of a language that combines variables, arrays and pointers ( rst class references) which are key ingredients of traditional imperative languages. As a result, they cannot be directly applied to get MLstyle polymorphic extensions of ....
....as a list; here [ denotes the empty list and : denotes cons. In this case, the type system must not allow type variables that occur in the type of stk to be generalized, or else the list would not be kept homogeneous. Di erent mechanisms have been proposed for dealing with this problem [4,22,19] In the context of Polymorphic C, however, we can adopt an especially simple approach. Because Polymorphic C does not have rst class functions, it is not possible to compute a polymorphic value in an interesting way; for example, we cannot write curried functions. For this reason, we su er ....
Georey Smith and Dennis Volpano. Polymorphic typing of variables and references. ACM Transactions on Programming Languages and Systems, 18(3):254-267, May 1996.
....table of counters. Other techniques use the compiler to help with branch prediction without changing the prediction mechanism. For instance, branch alignment [8, 27] increases instruction fetch bandwidth by minimizing the number of taken branches in a program. Static correlated branch prediction [28] is another optimization that introduces duplicate basic blocks, encoding in the program counter information about the path taken to reach a particular static branch and increasing the accuracy of static prediction. 2.4 Wire Delay and Branch Predictors As clock rates increase and feature sizes ....
C. Young and M. D. Smith. Static correlated branch prediction. ACM Transactions on Programming Languages and Systems, May 1999. 10
....features. Most notable is the large body of To appear in Science of Computer Programming, 1998. This material is based upon work supported by the National Science Foundation under Grants No. CCR9414421 and CCR 9400592. Preprint submitted to Elsevier Preprint 31 March work surrounding ML [4,21,14,5,11,24,22,19]. However, none of these efforts addresses the polymorphic typing of a language that combines variables, arrays and pointers (first class references) which are key ingredients of traditional imperative languages. As a result, they cannot be directly applied to get MLstyle polymorphic extensions ....
....as a list; here [ denotes the empty list and : denotes cons. In this case, the type system must not allow type variables that occur in the type of stk to be generalized, or else the list would not be kept homogeneous. Different mechanisms have been proposed for dealing with this problem [4,22,19] In the context of Polymorphic C, however, we can adopt an especially simple approach. Because Polymorphic C does not have first class functions, it is not possible to compute a polymorphic value in an interesting way; for example, we cannot write curried functions. For this reason, we suffer ....
Geoffrey Smith and Dennis Volpano. Polymorphic typing of variables and references. ACM Transactions on Programming Languages and Systems, 18(3):254--267, May 1996.
No context found.
Geoffrey Clemm and Leon Osterweil. A mechanism for environment integration. ACM Transactions on Programming Languages and Systems, 12(1):1--25, January 1990.
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