245 search results - page 20 / 49 » Efficient Symbolic Model Checking for Process Algebras |
78
Voted
TACAS
2001
Springer
15 years 1 months ago
2001
Springer
In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complet...
104
click to vote
ATVA
2006
Springer
15 years 1 months ago
2006
Springer
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
100
Voted
ICST
2009
IEEE
14 years 7 months ago
2009
IEEE
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
SIGSOFT
2003
ACM
15 years 10 months ago
2003
ACM
Model checking is emerging as a popular technology for reasoning about behavioral properties of a wide variety of software artifacts including: requirements models, architectural ...
ISSTA
2009
ACM
15 years 2 months ago
2009
ACM
This paper describes an approach for conformance testing of mobile and distributed systems. The approach is based on kiltera — a novel, high-level language supporting the descri...