Sciweavers

333 search results - page 33 / 67
» On the complexity of partial order trace model checking
Sort
View
FAC
2007
128views more  FAC 2007»
13 years 7 months ago
Verifying a signature architecture: a comparative case study
Abstract. We report on a case study in applying different formal methods to model and verify an architecture for administrating digital signatures. The architecture comprises seve...
David A. Basin, Hironobu Kuruma, Kunihiko Miyazaki...
KBSE
2008
IEEE
14 years 2 months ago
Unit Testing of Flash Memory Device Driver through a SAT-Based Model Checker
Flash memory has become virtually indispensable in most mobile devices. In order for mobile devices to successfully provide services to users, it is essential that flash memory b...
Moonzoo Kim, Yunho Kim, Hotae Kim
PODS
2004
ACM
158views Database» more  PODS 2004»
14 years 7 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
ITA
2008
119views Communications» more  ITA 2008»
13 years 7 months ago
Some Algebraic Properties of Machine Poset of Infinite Words
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...
Aleksandrs Belovs
QSIC
2007
IEEE
14 years 1 months ago
Verifying Noninterference in a Cyber-Physical System The Advanced Electric Power Grid
The advanced electric power grid is a complex real-time system having both Cyber and Physical components. While each component may function correctly, independently, their composi...
Yan Sun, Bruce M. McMillin, Xiaoqing Frank Liu, Da...