A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Some Issues on Testing Theory and its Applications
[chapter]
1995
Protocol Test Systems
Preserved Fulltext
A discussion is presented in a polemical fashion trying to illustrate the problems related to the translation of one model into another, to non deterministic and partially specified systems, to the size ...
of the specifications and test suites and the ways to reduce them. ...
NON DETERMINISTIC VERSUS DETERMINISTIC SPECIFICATIONS Some years ago, it was generally admitted that protocols (or telecommunication systems) should be modelled as deterministic automata. ...
doi:10.1007/978-0-387-34883-4_26
fatcat:dg36d7bd3vbgdkwyvs2glzwa6q
Reasons for a pessimistic or optimistic message logging protocol in MPI uncoordinated failure, recovery
2009
2009 IEEE International Conference on Cluster Computing and Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
According to this new model, deterministic and non-deterministic events are clearly discriminated, reducing the overhead induced by message logging. ...
However, this advantage comes at the expense of a higher overhead on communications, due to latency intrusive logging of events to a stable storage. ...
For four of the six representative benchmarks we tested, there is even no non-deterministic events left to log. ...
doi:10.1109/clustr.2009.5289157
dblp:conf/cluster/BouteillerRBMD09
fatcat:ilb5qdq3ljgzxb3b66gfzsjg5e
Amortized communication complexity of an equality predicate
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
We prove that the probabilistic communication complexity of this problem is equal to O(N); computational complexity of the proposed protocol is polynomial in size of inputs. ...
We study the communication complexity of a direct sum of independent copies of the equality predicate. ...
Model We use three standard models of communication complexity: deterministic communication protocols, randomized communication protocols with public random bits, and randomized communication protocols ...
arXiv:1212.1941v2
fatcat:uwhdilxdw5caxnmwdauawx6e4m
Amortized Communication Complexity of an Equality Predicate
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We prove that the probabilistic communication complexity of this problem is equal to O(N ); computational complexity of the proposed protocol is polynomial in size of inputs. ...
We study the communication complexity of the direct sum of independent copies of the equality predicate. ...
Model We use three standard models of communication complexity: deterministic communication protocols, randomized communication protocols with public random bits, and randomized communication protocols ...
doi:10.1007/978-3-642-38536-0_19
fatcat:cib73wnlozdubhuxausfsokc4q
Model-Based Testing IoT Communication via Active Automata Learning
2017
2017 IEEE International Conference on Software Testing, Verification and Validation (ICST)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1904.07075v1 fatcat:t7c7mlilqbgn3bxwh5w24kbt44
For this case study, we carried out experiments in which we learned models of five implementations of MQTT brokers/servers, a protocol used in the Internet of Things. ...
The technique is based on inferring models of multiple implementations of a common specification which are pair-wise cross-checked for equivalence. ...
Additionally, we would like to thank the developers of LearnLib. ...
doi:10.1109/icst.2017.32
dblp:conf/icst/TapplerAB17
fatcat:ttet5cktmbahfkta3avs3nzq3u
A weighted random walk approach for conformance testing of a system specified as communicating finite state machines
[chapter]
1997
Formal Description Techniques and Protocol Specification, Testing and Verification
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
On the other hand, often a protocol can be specified succinctly and in an understandable way as a collection of communicating finite state machines. ...
In this paper, we propose a test generation scheme called weighted random walk that can be applied to the test generation of communicating finite state machines. ...
Adaptive testing is very useful to cope with the difficulties arising from non-deterministic behaviour of the IUT since for a non-deterministic FSM we cannot know in advance which transition would be exercised ...
doi:10.1007/978-0-387-35271-8_17
fatcat:bsukrprajzco7gmmln3urvlnta
Page 563 of Mathematical Reviews Vol. , Issue 2003A
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Kang [in Testing of communicating systems, Vol. 10 (Cheju Island, 1997), 183-199, Chapman and Hall, London, 1997] for dy- namic testing of deterministic finite state machines for testing non-deterministic ...
The second protocol—an adaptive protocol for multicasting using retransmission buffers (APRB)—employs re- transmission buffers to ensure reliability of communication. ...
The Science of Killing Bugs in a Black Box
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Model-based testing is a black-box testing technique that avoids the labour of manually writing hundreds of test cases, but instead advocates the capturing of the expected behaviour in a model of the system ...
In this talk I will discuss the combination of model-based testing and mutation testing. ...
Communication protocols. More recently, we applied model-based mutation testing to several implementations of communication protocols. ...
doi:10.1007/978-3-642-33182-4_2
fatcat:ybvdfploa5hvpdweyg5sppkcea
Don't panic: reverse debugging of kernel drivers
2015
Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
by the debugger, and non-determinism of multi-threaded environment. ...
We present reverse debugger as a practical tool, which was tested for i386, x86-64, and ARM platforms, for Windows and Linux guest operating systems. ...
There are several types of non-deterministic inputs in communications with external devices. They may be divided into synchronous and asynchronous types. ...
doi:10.1145/2786805.2803179
dblp:conf/sigsoft/DovgalyukDM15
fatcat:zmgnjdifufbppdrglk4ga7uvbe
LaTe, a Non-fully Deterministic Testing Language
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose an operational semantics of these non-deterministic operators. Experimental results of the test of the voice-based service are also included. ...
This paper presents a case study which is the test of a voicebased service. ...
To succeed in testing non deterministic SUT, we have hadded two non deterministic operators in the language. These operators are the non deterministic interleaving and the non deterministic choice. ...
doi:10.1007/11754008_5
fatcat:jrvgeehjkjhphlgjhj6ovskmsy
Debugging and Testing Middleware with Aspect-Based Control-Flow and Causal Patterns
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Furthermore, events often are of interest only if they occur as part of specific execution traces and not all possible non-deterministic interleavings of events in these traces. ...
In this paper, we argue for the use of aspect-based high-level programming abstractions for the definition of relationships between execution events of distributed systems and the control of non-deterministic ...
The definition of reproducible test cases, for instance, frequently requires constraints to be imposed on non-deterministic executions. ...
doi:10.1007/978-3-540-89856-6_10
fatcat:gommxw4karhlnj4moybdunhh7a
Validation, verification and implementation of timed protocols using AORTA
[chapter]
1996
IFIP Advances in Information and Communication Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
bounded delay bounded time-out non-deterministic choice recursion ...
This operator can be used to implement a channel which accepts and delivers two kinds of messages: Channel Validation, verification and implementation of timed protocols communication communication choice ...
draft of this paper. ...
doi:10.1007/978-0-387-34892-6_13
fatcat:u7w2zni7bneltfxrswprbteghq
Replication for send-deterministic MPI HPC applications
2013
Proceedings of the 3rd Workshop on Fault-tolerance for HPC at extreme scale - FTXS '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we evaluate the advantages of adopting a different approach. First, we try to take advantage of a communication property common to many MPI HPC application, namely senddeterminism. ...
The main advantage of our approach is simplicity. ...
Existing protocols adopt a semiactive approach to deal with these non-deterministic events where a leader decides on the non-deterministic outputs and broadcasts the decision to all replicas. ...
doi:10.1145/2465813.2465819
dblp:conf/hpdc/LefrayRS13
fatcat:5yayl2rghjer3bmkr36nrkd6k4
Testing system-in-package wirelessly
2006
International Conference on Design and Test of Integrated Systems in Nanoscale Technology, 2006. DTIS 2006.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The paper shows a new concept for testing a systemin-package (SiP) using a wireless communication. ...
Although this approach is dedicated to an intermediate test of SiP, we explore other potential applications of this technology. ...
This method ensures deterministic medium allocation (each SiP can by itself send its test result) and allows dynamic adapting of the group membership (rejection of failing-SiP). ...
doi:10.1109/dtis.2006.1708683
fatcat:h3a6kba7tfeg7h37gnfuysp2am
Deterministic preparation of superpositions of vacuum plus one photon by adaptive homodyne detection: experimental considerations
2015
New Journal of Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We consider a deterministic protocol for the preparation of qubits as a superposition of vacuum and one photon number states, which has the advantage to reduce the amount of resources required via phase-sensitive ...
We investigate the performances of the protocol using different phase measurement schemes: homodyne, heterodyne, and adaptive dyne detection (involving a feedback loop). ...
But, by virtue of being non-deterministic, those protocols required many resources and had low probability of success. ...
doi:10.1088/1367-2630/17/1/013047
fatcat:2m5qsi2rlnaejb4vmezchi6huy
« Previous
Showing results 1 — 15 out of 40,598 results