Sciweavers

566 search results - page 71 / 114
» Array Abstractions from Proofs
Sort
View
CORR
2007
Springer
75views Education» more  CORR 2007»
13 years 7 months ago
On Undetected Error Probability of Binary Matrix Ensembles
Abstract— In this paper, analysis on undetected error probability of ensembles of m × n binary matricies is presented. Two ensembles are considered: One is an ensemble of dense ...
Tadashi Wadayama
JLP
2008
108views more  JLP 2008»
13 years 7 months ago
Composition mechanisms for retrenchment
Abstract. Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imposed by refinement, and for which the proof obligations feature additi...
Richard Banach, Czeslaw Jeske, Michael Poppleton
JUCS
2006
124views more  JUCS 2006»
13 years 7 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
Wan Fokkink, Jun Pang
ICTAC
2010
Springer
13 years 6 months ago
Formal Modelling of Separation Kernel Components
Abstract. Separation kernels are key components in embedded applications. Their small size and widespread use in high-integrity environments make them good targets for formal model...
Andrius Velykis, Leo Freitas
PRICAI
2010
Springer
13 years 6 months ago
Partial Weighted MaxSAT for Optimal Planning
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...