187 search results - page 28 / 38 » On Expressive and Model Checking Power of Propositional Prog... |
CHARME
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
92
Voted
PPDP
2005
Springer
15 years 5 months ago
2005
Springer
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
129
click to vote
POPL
2011
ACM
14 years 2 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
88
Voted
ENTCS
2007
14 years 11 months ago
2007
An access control system regulates the rights of users to gain access to resources in accordance with a specified policy. The rules in this policy may interact in a way that is n...