Sciweavers

1304 search results - page 63 / 261
» Model Checking C Programs Using F-SOFT
Sort
View
146
Voted
ECAI
2010
Springer
15 years 3 months ago
On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs
Abstract. The agent programming language GOLOG and the underlying Situation Calculus have become popular means for the modelling and control of autonomous agents such as mobile rob...
Jens Claßen, Gerhard Lakemeyer
137
Voted
PLDI
2009
ACM
15 years 9 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...
150
Voted
ESORICS
2002
Springer
16 years 2 months ago
TINMAN: A Resource Bound Security Checking System for Mobile Code
Resource security pertains to the prevention of unauthorized usage of system resources that may not directly cause corruption or leakage of information. A common breach of resource...
Aloysius K. Mok, Weijiang Yu
109
Voted
LMCS
2007
132views more  LMCS 2007»
15 years 2 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
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...
Roland Axelsson, Martin Lange, Rafal Somla
236
Voted
POPL
2005
ACM
16 years 2 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko