Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such problem is the balancedness problem which decides whether or not the language of a given contextfree grammar (CFG) over a paired alphabet is balanced. Another important problem is the validation problem which decides whether or...

The test scheduling problem for built-in self-tested embedded SRAMs (e-SRAMs) when data retention faults (DRFs) are considered is addressed here. We proposed a ‘retention-aware’ test power model by taking advantage of the fact that there is near-zero test power during the pause time for testing DRFs. The proposed test scheduling algorithm then utilises this new test power model to minimise the ...

Equality constraints (a.k.a. unification constraints) have widespread use in static program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow more accurate analyses and more expressive type systems. In this paper, we present a complete complexity characterization of the various entailmen...

An important security problem is to protect software against malicious host attacks. Since the malicious hosts are responsible for the program’s execution, there seems little the program can do to protect itself from disclosure, tampering and incorrect execution [7]. This paper will review some existing code obfuscation techniques for protecting software against those attacks. We will focus our...

This paper proposes a fully-dynamic 6-bit 3-bit/cycle SAR ADC. Unlike the prior multi-bit/cycle ADCs that require several differential DACs or consume static power, proposed ADC needs only one DAC and is fully-dynamic. helps reduce circuit complexity, input capacitance, power consumption. Furthermore, its comparator outputs are directly fed back to array, without any complicated logics, which f...

The main goal of this paper is to compare recursive algorithms such as Turing machines with such super-recursive algorithms as inductive Turing machines. This comparison is made in a general setting of dual complexity measures such as Kolmogorov or algorithmic complexity. To make adequate comparison, we reconsider the standard axiomatic approach to complexity of algorithms. The new approach all...

The aim of the paper is to propose a method for evaluation of logical database models in the context of transaction performance. Logical database models can be regarded as PSM models within MDA architecture. The logical database models are driven from a given conceptual database model (a part of PIM model within MDA) by applying different transformations rules. The evaluation method takes into ...

Policy inconsistencies may arise between safety and utility policies due to their opposite objectives. In this work we provide a formal examination of policy inconsistencies resolution for the coexistence of static separation-of-duty (SSoD) policies and strict availability (SA) policies. Firstly, we reduce the complexity of reasoning about policy inconsistencies by static pruning technique and ...

We consider static and dynamic approaches to the specification of probability distributions on graphs, consistent with desired statistical properties such as degree distributions, for use in modeling biological networks. In the static approach we develop analytical approximations to the Hamiltonian and partition functions. In the dynamic approach, we use a stochastic parameterized grammar to co...