222 search results - page 12 / 45 » Efficient assertion based verification using TLM |
SIGSOFT
2003
ACM
16 years 17 days ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
136
click to vote
CHARME
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
101
click to vote
ISSTA
2010
ACM
15 years 1 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
109
click to vote
ASE
2005
14 years 11 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
ENTCS
2002
14 years 11 months ago
2002
We present a new approach to the modelling of time constrained systems. It is based on untimed high-level Petri nets using the concept of causal time. With this concept, the progr...