Sciweavers

1018 search results - page 176 / 204
» Abstraction and Refinement in Model Checking
Sort
View
KI
2008
Springer
13 years 7 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
FM
2006
Springer
153views Formal Methods» more  FM 2006»
13 years 11 months ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
CSFW
2009
IEEE
14 years 2 months ago
ASPIER: An Automated Framework for Verifying Security Protocol Implementations
Abstract. We present aspier – the first framework that combines software model checking with a standard protocol security model to analyze authentication and secrecy properties ...
Sagar Chaki, Anupam Datta
SBMF
2009
Springer
105views Formal Methods» more  SBMF 2009»
14 years 2 months ago
Verifying Compiled File System Code
Abstract. This paper presents a case study on retrospective verication of the Linux Virtual File System (VFS), which is aimed at checking for violations of API usage rules and mem...
Jan Tobias Mühlberg, Gerald Lüttgen