Sciweavers

608 search results - page 26 / 122
» Tests, Proofs and Refinements
Sort
View
ICST
2009
IEEE
14 years 2 months ago
Transforming and Selecting Functional Test Cases for Security Policy Testing
In this paper, we consider typical applications in which the business logic is separated from the access control logic, implemented in an independent component, called the Policy ...
Tejeddine Mouelhi, Yves Le Traon, Benoit Baudry
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
SIAMSC
2011
85views more  SIAMSC 2011»
12 years 10 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
ISTCS
1995
Springer
13 years 11 months ago
Some Improvements to Total Degree Tests
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
Katalin Friedl, Madhu Sudan
CSFW
2010
IEEE
13 years 11 months ago
Towards Quantitative Analysis of Proofs of Authorization: Applications, Framework, and Techniques
—Although policy compliance testing is generally treated as a binary decision problem, the evidence gathered during the trust management process can actually be used to examine t...
Adam J. Lee, Ting Yu