Sciweavers

138 search results - page 9 / 28
» Linear Encodings of Bounded LTL Model Checking
Sort
View
ICFEM
2007
Springer
14 years 1 months ago
Model Checking with SAT-Based Characterization of ACTL Formulas
Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties ...
Wenhui Zhang
ICECCS
2007
IEEE
118views Hardware» more  ICECCS 2007»
14 years 1 months ago
Parallel Model Checking and the FMICS-jETI Platform
In this paper we summarize parallel algorithms for enumerative model checking of properties formulated in linear time temporal logic (LTL) as well as a fragment of the µcalculus ...
Jiri Barnat, Lubos Brim, Martin Leucker
FMICS
2006
Springer
13 years 11 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
SIGSOFT
2007
ACM
14 years 8 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
VMCAI
2010
Springer
14 years 2 months ago
Regular Linear Temporal Logic with Past
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
César Sánchez, Martin Leucker