Sciweavers

798 search results - page 22 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
FSTTCS
2004
Springer
14 years 2 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
ATVA
2006
Springer
133views Hardware» more  ATVA 2006»
14 years 13 days ago
Branching-Time Property Preservation Between Real-Time Systems
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
Jinfeng Huang, Marc Geilen, Jeroen Voeten, Henk Co...
CAV
2001
Springer
119views Hardware» more  CAV 2001»
14 years 1 months ago
Certifying Model Checkers
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
Kedar S. Namjoshi
IAW
2003
IEEE
14 years 2 months ago
Static Verification of Worm and virus Behavior in binary Executables using Model Checking
- Use offormal methods in any application scenario requires a precise characterization and representation of the properties that need to be verified The target, which is desired ri...
Prabhat K. Singh, Arun Lakhotia
LOGCOM
2002
100views more  LOGCOM 2002»
13 years 8 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling