Sciweavers

72 search results - page 8 / 15
» PtYasm: Software Model Checking with Proof Templates
Sort
View
FOSSACS
2005
Springer
14 years 2 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
FSTTCS
2004
Springer
14 years 1 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
AMAST
2010
Springer
13 years 3 months ago
Integrating Maude into Hets
Maude modules can be understood as models that can be formally analyzed and verified with respect to different properties expressing various formal requirements. However, Maude lac...
Mihai Codescu, Till Mossakowski, Adrián Rie...
NJC
2006
88views more  NJC 2006»
13 years 8 months ago
Optimizing Slicing of Formal Specifications by Deductive Verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
Ingo Brückner, Björn Metzler, Heike Wehr...
PASTE
2004
ACM
14 years 2 months ago
Dynamically inferring temporal properties
Model checking requires a specification of the target system’s desirable properties, some of which are temporal. Formulating a property of the system based on either its abstrac...
Jinlin Yang, David Evans