Sciweavers

1073 search results - page 27 / 215
» Formal Program Development with Approximations
Sort
View
ERSHOV
1993
Springer
14 years 22 days ago
Formal Derivation of an Error-Detecting Distributed Data Scheduler Using Changeling
Distributed database applications are a wide use of distributed systems. One of the major advantages of distributed database systems is the potential for achieving high availabili...
Hanan Lutfiyya, Bruce M. McMillin, Alan Su 0002
ENTCS
2008
94views more  ENTCS 2008»
13 years 8 months ago
A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code
This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems t...
Hendrik Tews, Tjark Weber, Marcus Völp
FMCAD
2004
Springer
14 years 2 months ago
Approximate Symbolic Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
Tobias Nopper, Christoph Scholl
LOGCOM
1998
126views more  LOGCOM 1998»
13 years 8 months ago
Engineering AgentSpeak(L): A Formal Computational Model
Perhaps the most successful agent architectures, and certainly the best known, are those based on the Belief-Desire-Intention (BDI) framework. Despite the wealth of research that ...
Mark d'Inverno, Michael Luck
FORMATS
2007
Springer
14 years 2 months ago
Hypervolume Approximation in Timed Automata Model Checking
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
Víctor A. Braberman, Jorge Lucángeli...