Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
We propose a fully sequential indifference-zone selection procedure that is specifically for use within an optimization-via-simulation algorithm when simulation is costly, and par...
Nowadays there are many tools for the extraction of data objects [SWGDE] from SIM cards; unfortunately, most of them are proprietary, or their use is restricted to law enforcement...
: Despite all the advance brought by LALR parsing method by DeRemer in the late 60's, conflicts continue to be removed in a non-productive way, by means of analysis of a huge ...
Leonardo Teixeira Passos, Mariza Andrade da Silva ...