Sciweavers

777 search results - page 29 / 156
» Model Checking with Formula-Dependent Abstract Models
Sort
View
ACSD
2003
IEEE
159views Hardware» more  ACSD 2003»
15 years 3 months ago
Case Studies of Model Checking for Embedded System Designs
As modern embedded systems become more integrated and complex, it is crucial to be able to represent systems ple levels of abstraction, so that the design space can be effectively...
Xi Chen, Harry Hsieh, Felice Balarin, Yosinori Wat...
CORR
2008
Springer
154views Education» more  CORR 2008»
14 years 9 months ago
A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
Rohit Chadha, Mahesh Viswanathan
ICFEM
2009
Springer
15 years 4 months ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
TACAS
2005
Springer
113views Algorithms» more  TACAS 2005»
15 years 3 months ago
Applications of Craig Interpolants in Model Checking
Abstract. A Craig interpolant for a mutually inconsistent pair of formulas (A, B) is a formula that is (1) implied by A, (2) inconsistent with B, and (3) expressed over the common ...
Kenneth L. McMillan
FMCAD
2008
Springer
14 years 11 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham