Sciweavers

493 search results - page 65 / 99
» Bounded LTL Model Checking with Stable Models
Sort
View
SCP
2010
155views more  SCP 2010»
14 years 8 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
CAV
2008
Springer
108views Hardware» more  CAV 2008»
14 years 12 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
15 years 3 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
TSE
2011
214views more  TSE 2011»
14 years 4 months ago
A Comparative Study of Software Model Checkers as Unit Testing Tools: An Industrial Case Study
—Conventional testing methods often fail to detect hidden flaws in complex embedded software such as device drivers or file systems. This deficiency incurs significant developmen...
Moonzoo Kim, Yunho Kim, Hotae Kim
ICCAD
2004
IEEE
191views Hardware» more  ICCAD 2004»
15 years 6 months ago
Checking consistency of C and Verilog using predicate abstraction and induction
edicate Abstraction and Induction Edmund Clarke Daniel Kroening June 25, 2004 CMU-CS-04-131 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 It is common...
Daniel Kroening, Edmund M. Clarke