Sciweavers

4340 search results - page 610 / 868
» Formal Methods and Cryptography
Sort
View
CAV
2003
Springer
107views Hardware» more  CAV 2003»
15 years 11 months ago
Theorem Proving Using Lazy Proof Explication
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
Cormac Flanagan, Rajeev Joshi, Xinming Ou, James B...
CAV
2003
Springer
156views Hardware» more  CAV 2003»
15 years 11 months ago
Abstraction and BDDs Complement SAT-Based BMC in DiVer
ion and BDDs Complement SAT-based BMC in DiVer Aarti Gupta1, Malay Ganai1 , Chao Wang2, Zijiang Yang1, Pranav Ashar1 1 NEC Laboratories America, Princeton, NJ, U.S.A. 2 University ...
Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Ya...
CAV
2003
Springer
160views Hardware» more  CAV 2003»
15 years 11 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
ERSHOV
2003
Springer
15 years 11 months ago
Integration of Functional and Timed Testing of Real-Time and Concurrent Systems
The article presents an approach to model based testing of complex systems based on a generalization of finite state machines (FSM) and input output state machines (IOSM). The app...
Victor V. Kuliamin, Alexandre Petrenko, Nick V. Pa...
FM
2003
Springer
92views Formal Methods» more  FM 2003»
15 years 11 months ago
Composing Invariants
We explore the question of the composition of invariance specifications in a context of concurrent and reactive systems. Depending on how compositionality is stated and how invar...
Michel Charpentier