### Table 1 summarizes the results on the (un-)decidability status of code properties for various language classes.

2000

"... In PAGE 13: ... Table1 : D stands for determinism, N for nondeterminism, d for decidable, u for undecidable and t for trivial; arrows indicate how (un)decidability results trivially propagate.... ..."

Cited by 3

### Table V reports some decidability results, depending on the structure of the considered program. For IACMIs satisfying these properties, reachability is decidable. For example, reachability is decidable in the Bell and La Padula and NIST models, as stated by the following proposition.

2003

Cited by 58

### Table 1 Code properties.

"... In PAGE 4: ...ode design criteria if the diversity order of the system (i.e. product of number of transmit and receive antennas) is equal or greater than 4. The codes chosen for our simulation are reported in Table1 . In all the simulations a minimum FER of 10 3 is considered as the acceptable performance threshold, and 5 iterations are considered suf cient to achieve an opti- mal detection.... ..."

### Table 1: Comparison of Parametric Model Checking Methods proposed by model property decidable? time complexity

1998

"... In PAGE 1: ... One of the considerable approaches to such problems is restricting the expressing power of Timed Automata. Comparison between existing parametric model checking methods are summarized in Table1 . For example, [6] proposed a parametric model checking algorithm in that both a model and a property are written in finite parametric timed automata (PTA) with one integer clock variable.... In PAGE 3: ... Finally, we perform the extension of DDFS to derive the weakest parameter condition in order that the given model never executes invalid runs specified by the given property. Class hierarchies for models and properties in Table1 are shown in Figs. 1, 2, and 3.... ..."

Cited by 2

### Table 7: Key fractions for use in deciding whether to adopt automatic code inspection

### Table 2: Decidability of the model property for timed automata with behavioural restrictions wrt. speci cations from di erent fragments of Duration Calculus

1998

"... In PAGE 8: ... The particular restrictions adopted are motivated by physical properties of practical veri cation problems, namely band-limitedness of reactive systems and synchronic- ity of clocked systems. Table2 provides an overview over the decidability results for model- checking timed automata against various fragments of dense-time Duration Calculus. Some of these decidability results have been further elaborated towards certain target technologies, e.... ..."

Cited by 7

### Table 2. Decidability of the model property for timed automata with behavioural restrictions with respect to speci cations from di erent fragments of Duration Calculus

"... In PAGE 11: ... The particular restrictions adopted are motivated by physical properties of practical veri cation problems, namely band- limitation of reactive systems and synchronicity of clocked systems. Table2 provides an overview over the decidability results for model-checking timed automata against various fragments of dense-time Duration Calculus.Note that our results are distinguished from other approaches towards model-checking dense-time DC in that they exploit physically justi able restrictions on model dynamics for obtaining decidability rather than severely restricting expressiveness of the speci cation language.... ..."