We present a method to find static path exclusions in a control flow graph in order to refine the WCET analysis. Using this information, some infeasible paths can be discarded ...
A generalized Peaceman-Rachford (P-R) ADI form based on the regularized finite difference scheme is employed in order to study the interactions of two co-propagating laser beams i...
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...
In order to make more flexible database access the query language SQLf has been previously proposed. One of the SQLf features is the use of Fuzzy Quantifiers in Having Clause. For...
This work presents a formal description of a subset of a C-like language in the form of an operational semantics. We give semantics to the following statements (presented in alpha...