Sciweavers

798 search results - page 4 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
ENTCS
2006
96views more  ENTCS 2006»
13 years 5 months ago
Verification of AMBA Using a Combination of Model Checking and Theorem Proving
The Advanced Microcontroller Bus Architecture (AMBA) is an open System-onChip bus protocol for high-performance buses on low-power devices. We demonstrate the combined use of mode...
Hasan Amjad
MEMOCODE
2006
IEEE
13 years 11 months ago
Specifying and proving properties of timed I/O automata in the TIOA toolkit
Timed I/O Automata (TIOA) is a mathematical framework for modeling and verification of distributed systems that involve discrete and continuous dynamics. TIOA can be used for exa...
Myla Archer, Hongping Lim, Nancy A. Lynch, Sayan M...
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 5 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
SIGSOFT
2007
ACM
14 years 6 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...
TASE
2007
IEEE
14 years 10 hour ago
Evaluation of SAT-based Bounded Model Checking of ACTL Properties
Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDD-based symbolic model checking of LTL and ACTL properties in recent years. For genera...
Yanyan Xu, Wei Chen, Liang Xu, Wenhui Zhang