181 search results - page 9 / 37 » Model checking Duration Calculus: a practical approach |
KBSE
1998
IEEE
15 years 1 months ago
1998
IEEE
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
ICFEM
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
SPIN
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present an approach for the veri cation of spatial properties with Spin. We rst extend one of Spin's main property speci cation mechanisms, i.e., the linear-time...
81
Voted
ENTCS
2010
14 years 9 months ago
2010
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
ENTCS
2007
14 years 9 months ago
2007
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...