In grid workflow systems, existing typical checkpoint selection strategies, which are used to select checkpoints for verifying fixed-time constraints at run-time execution stage, are not effective and/or efficient for fixed-time constraint verification because they often ignore some necessary checkpoints and select some unnecessary checkpoints. To improve such status, in this paper, we develop ...

Run-time monitoring of temporal properties and assertions is used for testing and as a component of execution-based model checking techniques. Traditional run-time monitoring however, is limited to observing sequences of pure Boolean propositions. This paper describes tools, which observe temporal properties over time series, namely, sequences of propositions with constraints on data value chan...

For performance reasons, it is desirable for Java just-in-time (JIT) compilers to statically identify array element accesses that can never cause an out of bounds exception, but the most precise analyses are too expensive to run in JIT compilers. We present verifiable annotations that can be added to Java programs to capture the results of range analyses as claimed linear inequalities and proof...

Verification of parameterized systems for an arbitrary number of instances is generally undecidable. Existing approaches resort to non-trivial restrictions on the system or lack automation. In practice, applications can often provide a suitable bound on the parameter size. We propose a new technique toward the bounded formulation of parameterized reasoning: how to efficiently verify properties ...

Assuring correctness of digital designs is one of the major tasks in the system design flow. Formal methods have been proposed to accompany commonly used simulation approaches. In this paper we describe a new technique of property checking using symbolic simulation which can be applied to larger designs. This technique seamlessly integrate formal verification and standard simulation. The propos...

Two-Stage Programming (2SP) is an experimental mixed-paradigm (functional/imperative) programming language with strong support for fault prevention and removal [3] through automatic verification of computation results with respect to a given specification. 2SP combines ideas of program verification, run-time checking, and result-checking [4]. The 2SP approach is to coordinate a functional speci...

We study the safety verification problem for business-process orchestration languages with respect to regular properties. Business transactions involve long-running distributed interactions between multiple partners which must appear as a single atomic action. This illusion of atomicity is maintained through programmer-specified compensation actions that get run to undo previous actions when ce...

Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. When WCET analysis tools are used to estimate the WCET, the tool is a critical part of the system design and must be correct. In this paper we present a methodology for systematically testing WCET analysis tools. The methodology is based on a decomposition of WCET analysis into...

Many tasks in safety-critical embedded systems have hard real-time characteristics. AbsInt’s worst-case execution time analyzer aiT can estimate precise and safe upper bounds for the WCETs of program tasks, thus providing the basic input for verifying the real-time behavior of embedded applications.