232 search results - page 20 / 47 » Symbolic Bounded Conformance Checking of Model Programs |
SPIN
2007
Springer
14 years 2 months ago
2007
Springer
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
QEST
2007
IEEE
14 years 2 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
VLSID
2004
IEEE
14 years 9 months ago
2004
IEEE
This paper presents a novel technique for abstracting designs in order to increase the efficiency of formal property checking. Bounded Model Checking (BMC), using Satisfiability (...
ECOOPW
1999
Springer
14 years 27 days ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
ICDCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...