نتایج جستجو برای: black box testing

تعداد نتایج: 545580  

2007
Muzammil Shahbaz Keqin Li Roland Groz

We investigate the use of parameterized state machine models to drive integration testing, in the case where the models of components are not available beforehand. Therefore, observations from tests are used to learn partial models of components, from which further tests can be derived for integration. We have extended previous algorithms to the case of finite state models with predicates on in...

Journal: :CoRR 2013
Marie-Claude Gaudel Richard Lassaigne Frédéric Magniez Michel de Rougemont

Model checking and testing are two areas with a similar goal: to verify that a system satisfies a property. They start with different hypothesis on the systems and develop many techniques with different notions of approximation, when an exact verification may be computationally too hard. We present some notions of approximation with their logic and statistics backgrounds, which yield several te...

2010
Rafael Pass Muthuramakrishnan Venkitasubramaniam

Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “fully black-box” privatecoin protocols based on one-way functions. More precisely, we show that only languages in BPP—where Sam is a “collision-finding” oracle in analogy with Simon (Eurocrypt’98) and Haitner et. al (FOCS’07...

2006
Pierre Innocent

This paper presents our black-box approach (Tsert Method ©®TM) in testing objectoriented programs based on the use of protocol data units to communicate with a test-harness, which are built by processing the methods of a given class. Testing object-oriented programs has always been difficult, especially in handling inheritance and polymorphism. The approach to be presented, allows the tester, t...

2005
Vlad Rusu Hervé Marchand Thierry Jéron

This paper presents a combination of veri cation and conformance testing techniques for the formal validation of reactive systems. A formal speci cation of a system, which may be in nite-state, and a set of safety properties are assumed. Each property is veri ed on the speci cation using automatic techniques based on abstract interpretation, which are sound, but, as a price to pay for automatio...

2009
Michal Rjasko

A (k, l)-robust combiner for collision resistant hash functions is a construction, which takes l hash functions and combines them so that if at least k of the components are collision resistant, then so is the resulting combination. A black-box (k, l)-robust combiner is robust combiner, which takes its components as black-boxes. A trivial black-box combiner is concatenation of any (l−k+1) of th...

1997
I. Dan Melamed Dan Melamed

SABLE is a Scalable Architecture for Bilingual LExicography. It is designed to produce clean broad-coverage translation lexicons from raw, unaligned parallel texts. Its black-box functionality makes it suitable for naive users. The architecture has been implemented for different language pairs, and has been tested on very large and noisy input. SABLE does not rely on language-specific resources...

2014
Alina Huldtgren Cordula Endter

Interdisciplinary design is essential to create new pervasive health applications, in our case those for dementia care, and to innovate our healthcare systems to meet the challenges of ongoing demographic changes. While interdisciplinary design is gaining attention in HCI literature and challenges of managing and executing interdisciplinary design projects are brought to the fore, few guideline...

2016
C. Maria Keet Agnieszka Lawrynowicz

Emerging ontology authoring methods to add knowledge to an ontology focus on ameliorating the validation bottleneck. The verification of the newly added axiom is still one of trying and seeing what the reasoner says, because a systematic testbed for ontology authoring is missing. We sought to address this by introducing the approach of testdriven development for ontology authoring. We specify 3...

Journal: :Inf. Process. Lett. 2007
Emmanuelle Anceaume Roy Friedman Maria Gradinariu Potop-Butucaru

Consensus and Non-Blocking Atomic Commit (NBAC) are two fundamental distributed problems. The specifications of both problems may lead one to think that they are very similar. However, a black-box solution to any of them is not sufficient to solve the other. This paper presents a family of agreement problems called Managed Agreement, which is parameterized by the number of aristocrat nodes in t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید