Frank Yellin. Private communication, August 2002. 9  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Type System for Java Bytecode Subroutines - Stata, Abadi (1998) (168 citations) (Correct)
....be helpful in extending our work to the full JVML. In summary, there has not been much work closely related to ours. We do not find this surprising, given that the handling of subroutines is one of the most original parts of the bytecode verifier; it was not derived from prior papers or systems [Yel97] However, interest in the formal treat ment of bytecode verification seems to be mounting; several approaches are currently being pursued [Qia97, Sar97] 10 Conclusions The bytecode verifier is an important part of the Java VM; through static checks, it helps reconcile safety with e# ciency. ....
Frank Yellin. Private communication. March 1997.
Approximation Techniques for the Set of Efficient Points - Fliege (2001) (Correct)
....i t a i x) a self concordant barrier for the epigraph of with self concordancy parameter # B = k . 2 Example 4.5.3 (Skewed Gauges) Let be a gauge, A 2 IR n n be a regular matrix and c 2 IR n be a vector with (A c) 1 . Then (x) Ax) h c; x i defines a gauge [71]. Gauges defined like this have important applications in location science, see, e.g. 72, 36] and are called skewed gauges. It is easy to see that the unit ball of is given by (c A (B ) However, finding a barrier for this unit ball does not seem to be so easy. On the other ....
Frank Plastria. Private communication, May 7 1993.
A Type System for Java Bytecode Subroutines - Stata, Abadi (1998) (168 citations) (Correct)
....helpful in extending our work to the full JVML. In summary, there has not been much work closely related to ours. We do not 27 find this surprising, given that the handling of subroutines is one of the most original parts of the bytecode verifier; it was not derived from prior papers or systems [Yel97] However, interest in the formal treatment of bytecode verification is mounting; several approaches are currently being pursued [FM98, Gol97, HT98, Qia98, Sar97] Goldberg, Qian, and Saraswat all develop other formal frameworks for bytecode verification, basing them on constraints and dataflow ....
Frank Yellin. Private communication. March 1997. 62
AGS Letter of Intent-Search for an Electric Dipole Moment of.. - Gamma Cm (Correct)
....electrons and muons might acquire an EDM, it is important to improve the EDM limits of both particles. 14] In various models, the EDM value goes as the second or third power of the ratio of the muon mass to that of the electron mass as, for example, is the case with various multi Higgs models. [15] The muon g 2 experiment underway at BNL will probe a wide range of non standard physics, in particular SUSY models [16, 17, 18] with large tan fi ( 10) The muon EDM experiment is also sensitive to some of those models and together they explore a larger parameter range. 19] 3 Experimental ....
Frank Paige, private communication.
High-Order Computation And Normal Form Analysis Of Repetitive.. - Berz (1991) (3 citations) (Correct)
....type into calls to subroutines. This precompiler is particularly helpful for the conversion of existing numerical integration codes to DA map extraction. The precompiler has been used for a variety of codes including TEAPOT [36] THINTRACK [29] and a descendent of THINTRACK by the name of SIXTRACK [37]. Usually the modifications required to allow the extraction of arbitrary order maps were limited, and in the above cases the task could be finished within a few hours. Furthermore, this precompiler has been used to create an integrator to compute fringe field transfer maps [27] for COSY 5.0 [10] ....
Frank Schmidt. Private communication.
A Type System for Java Bytecode Subroutines - Stata, Abadi (1998) (168 citations) (Correct)
....be helpful in extending our work to the full JVML. In summary, there has not been much work closely related to ours. We do not find this surprising, given that the handling of subroutines is one of the most original parts of the bytecode verifier; it was not derived from prior papers or systems [Yel97] However, interest in the formal treat ment of bytecode verification seems to be mounting; several approaches are currently being pursued [Qia97, Sar97] 10 Conclusions The bytecode verifier is an important part of the Java VM; through static checks, it helps reconcile safety with ....
Frank Yellin. Private communication. March 1997.
A Framework for Managing Models in Nonlinear Optimization of.. - Serafini (1999) (3 citations) (Correct)
....a particularly good value, presumably in the same basin as the initial point or in a nearby one. The performance of BLGS on this problem is not necessarily indicative of its performance in general. The initial 59 point model is smaller than Paul Frank, the author of BLGS, would normally recommend [27]. He would prefer to build the initial 133 model for this problem using around 200 function values. Also, the BLGS method is concerned with the problem of global optimization more than the model management algorithm used for these tests. Thus the model management algorithm can tolerate less ....
P. D. Frank. Private communication. February 1998. 173
The Next 700 Slicing Criteria - Harman, Danicic, Sivagurunathan.. (1996) (Correct)
....slicing allows equality and relational operators in constraints . Constraints play an identical role to conditions in conditioned slicing. However, this is an implementation decision the definition of constrained slicing, can, in theory, allow for an arbitrary set of initial states [33]. 8 To be precise, Canfora et al. [6] introduce conditioned slicing in terms of a condition from the programming language notation, whereas De Lucia [11] generalises this condition to be an arbitrary, universally quantified, formula of first order predicate logic. 9 De Lucia [11] uses ....
Frank Tip. Private communication, 1996.
Some New Coincidence Conditions In Minisum Multifacility Location .. - Fliege (Correct)
....let W 1 = fgg and let E(g; w) 6= hold for all w 2 W 2 . Then W 2 is the leaf set of an attraction tree (cf. 4] of height 1 with root g. The suppressed edges are the edges in E(W 2 ; W 2 ) If W 2 = ffg, then (5) simplifies to the attraction condition of [4] The next example (due to Plastria [8]) uses only one norm instead of several different ones. Example 3.4 Let A = fa; b; c; dg, V = ft; u; v; wg, E = f(u; a) u; b) u; t) v; a) v; d) v; t) w; a) w; c) w; t)g. All fl e are equal to a norm fl. The weights are ua = va = wa = ut = wt = vt = 3 and ub = vd = ....
Frank Plastria. Private communication, May 7, 1993.
Checking Access to Protected Members in the Java Virtual Machine - Coglio (2004) (Correct)
No context found.
Frank Yellin. Private communication, August 2002. 9
Managing Code Complexity in a Portable Microkernel - Dannowski (2004) (Correct)
No context found.
Frank Mehnert. private communication. April 2004.
Checking Access to Protected Members in the Java Virtual Machine - Coglio (2004) (Correct)
No context found.
Frank Yellin. Private communication, August 2002. 16
Checking Access to Protected Members in the Java Virtual Machine - Coglio (2004) (Correct)
No context found.
Frank Yellin. Private communication, August 2002. 16
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