Early detection of timing constraint violation at runtime

Mok, Aloysius K.; Liu, G.

doi:10.1109/real.1997.641280

Cited by 31 publications

(26 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When we consider a subset of LOC suitable for formal verification, we restrict LOC to Presburger arithmetic. Similarly, Mok and Liu have proposed a subset of RTL suitable for simulation monitoring [27], [28], and that subset indeed resembles LOC. However, they have not proposed any automatic formal verification technique for that subset.…”

Section: A Related Workmentioning

confidence: 96%

Logic of Constraints: A Quantitative Performance and Functional Constraint Formalism

Chen

Hsieh

Balarin

et al. 2004

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

Abstract-In the era of billion-transistor design, it is critical to establish effective verification methodologies from the system level all the way down to the implementations. In this paper, we introduce Logic of Constraints (LOC), a logic that is particularly suited to express quantitative performance constraints as well as functional constraints. We analyze the expressiveness of LOC and show that it is important and different from Linear Temporal Logic (LTL), on which traditional hardware assertion languages (e.g. PSL and OpenVera) are based. We propose an automatic simulation trace checking/runtime monitoring methodology that can be used to verify system designs very efficiently. Since a subset of LOC is decidable, we also discuss the formal verification approach for LOC formulas. Through several industrial case studies, we demonstrate the usefulness of the LOC formalism and the corresponding simulation and verification approach at the higher, transaction level of abstraction.

show abstract

Section: A Related Workmentioning

confidence: 96%

Logic of Constraints: A Quantitative Performance and Functional Constraint Formalism

Chen

Hsieh

Balarin

et al. 2004

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

show abstract

“…They showed that the minimization of the number of messages to be forwarded among processors for detecting violations in timing constraints as early as possible is an NP-hard problem. In [15,14], Mok and Liu presented a timing constraint monitoring algorithm which uncovers most hidden information required to detect violations of timing constraints as early as possible at event compilation time.…”

Section: Related Workmentioning

confidence: 99%

“…Recently, we introduced an algorithm for monitoring timing constraints in [13] which extended the algorithm in [15,14] to process events whose timestamps are time intervals. We proposed two new modalities, certain and possible to allow a user to specify his desired degree of certainty whether a timing violation has occurred.…”

Section: Related Workmentioning

confidence: 99%

“…For early detection, we need to derive implicit constraints from the given timing constraint set. Various derivation algorithms for implicit constraints from a set of timing constraint on time points were discussed in [2,14]. A derivation algorithm where the timestamps of events are time intervals was presented in [13].…”

Section: Deriving Implicit Constraintsmentioning

confidence: 99%

“…In order to facilitate the derivation of the shortest implicit constraints from a set of timing constraints, an efficient technique is to use an all-pairs shortest-path algorithms as the core engine, e.g., [14,15,13]. Those solutions are based on the Floyd-Warshall algorithm because of its simplicity of implementation and the efficiency benefits from matrix-based operations.…”

Section: Using All-pairs Shortest Path Algorithmmentioning

confidence: 99%

See 2 more Smart Citations