### Table 1. Result of abstract interpretation for example flowchart.

2003

"... In PAGE 14: ... Note also that since many of the asserted functions are common to various tasks, inaccuracies in assumptions are propagated among tasks. As an example, let us present results concerning task Mil_Bus_Manager ( Table1 ). This task manages the bus that connects the different satellite payloads, and is the largest and most complex task of the CDMU application.... In PAGE 14: ... This task manages the bus that connects the different satellite payloads, and is the largest and most complex task of the CDMU application. Table1 . WCET calculation results Task WCET given by Bound-T (ms) WCET reported in design documents (ms) Mil_Bus_Manager 15.... In PAGE 14: ... WCET calculation results Task WCET given by Bound-T (ms) WCET reported in design documents (ms) Mil_Bus_Manager 15.79 20 Table1 reports two different values: the WCET estimated by Bound-T, and the WCET reported in the design documents of the CDMU application. The latter value is mainly based on in-service history information of previous missions of similar applications.... In PAGE 14: ... The latter value is mainly based on in-service history information of previous missions of similar applications. As shown in Table1 , the WCET given by Bound-T (about 16 ms) was slightly under the value reported in the design documents (20 ms). 5.... In PAGE 59: ...#Variables #Constraints CFG/TGs 67 114 ECFG 43 32 Table1 : ILP formulations of matsum (branch pre- diction modeling) with the two approaches as always miss, then the self loop edge e1 of A, which results in cache hit, is trimed off from the CCG. This results in the flow increase of e2 and consequently more cache misses for B.... In PAGE 59: ...06s Table 2: Impact of ILP problem size and nature on solving time (results of the CFG/TGs approach) graphs) and the other one using single ECFG. In Table1 , the numbers of variables and constraints of the matsum benchmark (modeling branch predic- tion) are presented. Obviously, the ECFG has less variables and constraints than the CFG/TGs.... In PAGE 67: ... We propose to collect an agreed set of requirements from the WCET Community on the information needed to perform WCET analysis with the aim of producing a white paper to influence compiler manufacturers and vendors to make such information available. Table1 , below, lists the items we have collected so far. ordered by requirement category.... In PAGE 67: ... Other future work includes finding collateral benefits, prioritizing the requirements, and defining the data formats and other interfaces for implementing the requirements. Table1 . Compiler and linker support for timing analysis Requirement category Property, mapping or control Examples Supported analyses Properties on source-code level Tree structure of the code Intra-procedural control structures: sequence, conditional, switch/case, loop, exception.... In PAGE 89: ...ending code). # insts crc CRC computation 54 790 fft1 FFT using Cooly-Turkey algorithm 3163 jfdctint JPEG slow-but-accurate integer implementation of the forward DCT 5828 lms LMS adaptive signal enhancement 535 985 ludcmp LU decomposition 7 797 Table1 . Benchmark applications (from the SNU suite) 4.... In PAGE 100: ... The system is solved by fixed-point iteration for the simplified system, which converges in nine iterations. The result is shown in Table1 . (BQ stands for the universal set: CB BC BP BQ thus means that we allow any starting state in the analysis.... ..."

### Table 3.2: The Abstract Functions and their Types for the Generic Interpreter Model.

1993

### Table 1: Polymorphic Type Assignment

1994

"... In PAGE 3: ... Polymorphic type assignment is de ned by a set of rules for deriving judgements of the form ; ` e : , with the intended meaning that the expression e has type under the assumption that the locations in e have the monotypes ascribed by , and the free variables in e have the polytypes ascribed by . The rules of inference are given in Table1 . These rules make use of two auxiliary notions.... ..."

Cited by 59

### Table 1: Polymorphic Type Assignment

1994

"... In PAGE 2: ... Polymorphic type assignment is de ned by a set of rules for deriving judgements of the form ;; ` e : , with the intended meaning that the expression e has type under the assumption that the locations in e have the monotypes ascribed by , and the free variables in e have the polytypes ascribed by . The rules of inference are given in Table1 . These rules make use of two auxiliary notions.... ..."

Cited by 1

### Table 1: Polymorphic Type Assignment

1993

"... In PAGE 7: ... We shall work with a syntax-directed formulation of the Damas-Milner polymorphic type assignment system inspired by the static semantics of Standard ML [25]. The rules given in Table1 de ne a formal system for deriving judgements of the form ; ` e : , expressing that the expression e may be assigned the monotype in context ;. The rules are parametric in a signature , whichweleave implicit.... In PAGE 7: ... The rules are parametric in a signature , whichweleave implicit. We often write ; ` e : ,orjuste : when ; is empty, to mean that this typing judgement is derivable in accordance with the rules of Table1 . An expression e is said to be well-typed in a context ; i there exists a suchthat ; ` e : .... In PAGE 7: ... An expression e is said to be well-typed in a context ; i there exists a suchthat ; ` e : . Some of the rules given in Table1 make use of auxiliary notions that merit further explanation. Rule var makes use of the polymorphic instance relation whichisde nedtoholdi is a polytype of the form 8t 1 : .... In PAGE 7: ...We sometimes abbreviate Close ; ( ) to just Close( ) when ; is the empty context. The formal system of Table1 is clearly a subsystem of the system given by Damas and Milner [4] in the sense that if ; ` e : is derivable in the system of Table 1, then it is derivable in Damas and Milner apos;s system. Conversely,if;` e : is derivable in Damas and Milner apos;s system, then ; ` e : is derivable in the system of Table 1 whenever .... In PAGE 7: ...We sometimes abbreviate Close ; ( ) to just Close( ) when ; is the empty context. The formal system of Table 1 is clearly a subsystem of the system given by Damas and Milner [4] in the sense that if ; ` e : is derivable in the system of Table1 , then it is derivable in Damas and Milner apos;s system. Conversely,if;` e : is derivable in Damas and Milner apos;s system, then ; ` e : is derivable in the system of Table 1 whenever .... In PAGE 7: ... The formal system of Table 1 is clearly a subsystem of the system given by Damas and Milner [4] in the sense that if ; ` e : is derivable in the system of Table 1, then it is derivable in Damas and Milner apos;s system. Conversely,if;` e : is derivable in Damas and Milner apos;s system, then ; ` e : is derivable in the system of Table1 whenever .Thus all and only the monotypes derivable for a given term in Damas and Milner apos;s system are derivable in the system considered here.... ..."

### TABLE 1. Levels of Abstraction and their interpretation.

### Table 5: Concerning the Second Attempt Selected Coefficients

2004

"... In PAGE 20: ... This finding limits the validity of models which seek to explain the choice of list price as a signal that is consistent with some equilibrium inference by buyers since it may be difficult to extract the signal that the seller is trying to send from the noise created by changing external conditions. coefficients describing the house were statistically significant in explaining the selling process during the first attempt; fewer of these coefficients were statistically significant in explaining the process during the second attempt, the expiry process discussed with Table 4 or the decision to try again discussed in Table5 . In Tables 3 and 4, except for F and 2 which have particular interpretations, a positive coefficient implies that an increase in that variable increased the instantaneous probability of sale (decreased the expected time for that process if that process were allowed to continue to its natural conclusion).... In PAGE 20: ... In Tables 3 and 4, except for F and 2 which have particular interpretations, a positive coefficient implies that an increase in that variable increased the instantaneous probability of sale (decreased the expected time for that process if that process were allowed to continue to its natural conclusion). Table5 reports on the estimates of two logit model and the signs of the coefficients have their usual interpretation. Insert Table 3 As expected, the left hand pair of columns on Table 3 show that an increase in the Degree of Over-Pricing decreased the probability of sale at any point in time during the first attempt.... In PAGE 23: ... To be more specifically, if I compare two second attempts having equal DOP, the attempt with the higher DOP on the first attempt would have a lower the probability of sale and a lower probability of expiry at any given point in time. Insert Table 5 Table5 reports selected coefficients on the decision to try again after a first attempt failed. At the micro-level, an increase in DOP decreased the probability of a second attempt and a seller with the highest DOP was less likely to try quickly.... ..."

### Table 3: Type Rules for Linear Polymorphic Calculus

2000

Cited by 51

### Table 1: Results of abstract interpretation for the quicksort program

1992

Cited by 110

### Table 3: Polymorphic checking with type substitution

Cited by 2