1472 search results - page 51 / 295 » On Model Checking Infinite-State Systems |
168
click to vote
DALT
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we address the challenges associated with the verification of correctness of communication between agents in MultiAgent Systems. Our approach applies model-checking ...
135
click to vote
ENTCS
2006
15 years 6 months ago
2006
In this paper we investigate how formal software verification systems can be improved by utilising parallel assignment in weakest precondition computations.
166
click to vote
FM
2001
Springer
15 years 10 months ago
2001
Springer
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
158
click to vote
FOSSACS
2005
Springer
15 years 11 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
156
click to vote
ISCIS
2004
Springer
15 years 11 months ago
2004
Springer
Testing is a necessary, but costly process for user-centric quality control. Moreover, testing is not comprehensive enough to completely detect faults. Many formal methods have bee...