2661 search results - page 86 / 533 » Model Checking Performability Properties |
165
click to vote
LMCS
2007
15 years 6 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
196
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
The need of formal verification is a problem that involves all the fields in which sensible data are managed. In this context the verification of data streams became a fundamental...
165
click to vote
IGPL
2006
15 years 6 months ago
2006
Abstract. We consider the case where inconsistencies are present between a system and its corresponding model, used for automatic verification. Such inconsistencies can be the resu...
194
click to vote
LICS
2006
IEEE
16 years 22 days ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
186
click to vote
CONCUR
1999
Springer
15 years 11 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...