Sciweavers

1796 search results - page 233 / 360
» An Approach to Compositional Model Checking
Sort
View
PTS
2008
98views Hardware» more  PTS 2008»
13 years 9 months ago
Modular System Verification by Inference, Testing and Reachability Analysis
Verification of a modular system composed of communicating components is a difficult problem, especially when the models of the components are not available. Conventional testing t...
Roland Groz, Keqin Li 0002, Alexandre Petrenko, Mu...
WCE
2007
13 years 9 months ago
Simulation of Transformer With Aging Insulation and Incipient Faults
Abstract—The development of the transformer insulation failure undergoes three stages: insulation aging, incipient faults and a short circuit. This paper presents a complete sche...
X. Wang, Mark Sumner, D. W. P. Thomas
SPIN
2010
Springer
13 years 6 months ago
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
Naghmeh Ghafari, Alan J. Hu, Zvonimir Rakamaric
CAV
2006
Springer
133views Hardware» more  CAV 2006»
13 years 12 months ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...
ICFP
2004
ACM
14 years 8 months ago
A sound (and complete) model of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
Matthias Blume, David A. McAllester