Sciweavers

39 search results - page 4 / 8
» Completeness and Nondeterminism in Model Checking Transactio...
Sort
View
TABLEAUX
2009
Springer
14 years 2 months ago
Tableaux and Model Checking for Memory Logics
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
Carlos Areces, Diego Figueira, Daniel Gorín...
FMCAD
2008
Springer
13 years 9 months ago
Word-Level Sequential Memory Abstraction for Model Checking
el Sequential Memory Abstraction for Model Checking Per Bjesse Advanced Technology Group Synopsys Inc. Many designs intermingle large memories with wide data paths and nontrivial c...
Per Bjesse
DBPL
1993
Springer
89views Database» more  DBPL 1993»
13 years 11 months ago
Database Programming in Transaction Logic
This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion f...
Anthony J. Bonner, Michael Kifer, Mariano P. Conse...
DASFAA
2009
IEEE
123views Database» more  DASFAA 2009»
14 years 2 months ago
A Reprocessing Model Based on Continuous Queries for Writing Data to RFID Tag Memory
This paper investigates the problem of writing data to passive RFID tag memory and proposes a reprocessing model for assuring the atomicity and durability of writing transactions i...
Wooseok Ryu, Bonghee Hong
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening