Test adequacy criteria serve as rules to determine whether a test set adequately tests a program. The e ectiveness of a test adequacy criterion is determined by its ability to detect faults. For a test case to detect a speci c fault, it should execute the fault, cause the fault to generate an erroneous state and propagate the error to the output. Analysis of previously proposed code-based testi...

Introduction. Community orientation is a concept that nowadays seems necessary for medicine related services. Although our country has some degree of progress in this policy but we are still far from ideal condition. There are some problems affecting our improvement in this policy such as lack of budget and deficiency of proper health care centers for COME. So, the investigator has...

We propose a domain independent execution monitoring technique for a class of restartable logic-based temporal programs. The execution of a temporal program is interleaved with monitoring. Given a remaining part of a program, an execution trace, and the current time, if at this time no plan satisfying temporal constraints can be generated from the remaining program, the monitor backtracks (if p...

This tutorial deals with runtime enforcement and advocates its use as an extension of runtime verification. While research efforts in runtime verification have been mainly concerned with detection of misbehaviors and acknowledgement of desired behaviors, runtime enforcement aims mainly to circumvent misbehaviors of systems and to guarantee desired behaviors. First, we propose a comparison betwe...

Data Flow Analysis (DFA for short) is a basic technique to collect statical information on run-time behaviors of programs: it is essential in optimizing compilers and is also used in type inference problems [1]. When performing a DFA, the program to be analyzed is modeled by its Control Flow Graph (CFG) and by a set of transformation functions, one for each node in the graph. The set of program...

Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical realizability Realizability game Zoology Gender equality Introduction Curry-Howard Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical ...

Security abstractions in programming languages benefit from the ability to base access control decisions on the temporal context of program execution. In this paper we formalize the notion of a history as a sequence of program events produced during program execution, and which allows execution contexts to be precisely characterized. We define a language λhist to model the incorporation of hist...

civil procedure code in articles 424 and 437 has laid down deferenteffects for rehearing and objection to judgment by a third party aboutexecution of judgment. on base of these articles effect of rehearing isstronger, so with rendering of writ of acceptance of rehearing, execution ofjudgment stops, except about condemnation connected with property, whenobtaining of security with compensation is...

Numerical applications require large amounts of computing power. Although shared memory multiprocessors provide a cost-e ective platform for parallel execution of numerical programs, parallel processing has not delivered the expected performance on these machines. There are two crucial steps in parallel execution of numerical applications: (1) e ective parallelization of an application and (2) ...