• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 657
Next 10 →

Formalizing testing for asynchronous communication ⋆

by Puneet Bhateja, Paul Gastin, Madhavan Mukund
"... Abstract. Testing is used to verify whether a computing system con-forms to its specification. Developing an efficient and exhaustive test suite is a challenging problem, especially in the setting of distributed systems. Formal theories of testing have been proposed and studied for systems that comm ..."
Abstract - Add to MetaCart
that communicate synchronously. However, in the setting of asynchronous systems, little progress has been made since the work of Tretmans, in which asynchrony is modelled using synchronous commu-nication by augmenting the state space of the system with queues. We develop a theory of testing for asynchronous

communication

by Puneet Bhateja, Paul Gastin, Madhavan Mukund
"... fresh look at testing for asynchronous ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
fresh look at testing for asynchronous

Decentralized Sequential Hypothesis Testing using Asynchronous Communication

by Georgios Fellouris, George V. Moustakides, Senior Member , 908
"... Abstract—We present a test for the problem of decentralized sequential hypothesis testing, which is asymptotically optimum. By selecting a suitable sampling mechanism at each sensor, communication between sensors and fusion center is asynchronous and limited to 1-bit data. The proposed SPRT-like tes ..."
Abstract - Cited by 26 (5 self) - Add to MetaCart
Abstract—We present a test for the problem of decentralized sequential hypothesis testing, which is asymptotically optimum. By selecting a suitable sampling mechanism at each sensor, communication between sensors and fusion center is asynchronous and limited to 1-bit data. The proposed SPRT

Trace and Testing Equivalence on Asynchronous Processes

by Michele Boreale, Rocco De Nicola, Rosario Pugliese - Information and Computation , 1999
"... We study trace and may-testing equivalences in the asynchronous versions of CCS and -calculus. We start from the operational definition of the may-testing preorder and provide for it finitary and fully abstract trace-based characterizations, along with a complete in-equational proof system. We also ..."
Abstract - Cited by 34 (5 self) - Add to MetaCart
touch upon two variants of this theory, by first considering a more demanding equivalence notion (must-testing) and then a richer version of asynchronous CCS. The results throw light on the difference between synchronous and asynchronous communication and on the weaker testing power of asynchronous

On Synchronous and Asynchronous Communication Paradigms

by Diletta Cacciagrano, Flavio Corradini - Proc. of ICTCS ’01, LNCS , 2000
"... The π-calculus, its asynchronous version and Boudol’s mapping from the former language to the latter one are well-known mathematical objects in theoretical computer science. It is also well-known that the mapping is not fully-abstract w.r.t. most of the semantics defined over these two languages. In ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
The π-calculus, its asynchronous version and Boudol’s mapping from the former language to the latter one are well-known mathematical objects in theoretical computer science. It is also well-known that the mapping is not fully-abstract w.r.t. most of the semantics defined over these two languages

Separation of Synchronous and Asynchronous Communication via Testing

by Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi - on line in http://portalcs.unicam.it/flavio.corradini , University of Camerino, 2005. D. Cacciagrano et al. / Electronic Notes in Theoretical Computer Science 154 (2006) 95–108 107
"... One of the early results about the asynchronous π-calculus which significantly contributed to its popularity is the capability of encoding the output prefix of the (choiceless) π-calculus in a natural and elegant way. Encodings of this kind were proposed by Honda and Tokoro, by Nestmann and (indepen ..."
Abstract - Cited by 14 (5 self) - Add to MetaCart
of the sequences of steps which are necessary in the asynchronous π-calculus to mimic synchronous communication, and (b) testing semantics’s sensitivity to divergence.

Synchronizing Asynchronous Conformance Testing

by Neda Noroozi, Ramtin Khosravi, Mohammad Reza Mousavi, Tim A. C. Willemse - In Proc. of SEFM 2011, volume 7041 of LNCS , 2011
"... Abstract. We present several theorems and their proofs which enable using synchronous testing techniques such as input output conformance testing (ioco) in order to test implementations only accessible through asynchronous communication channels. These theorems define when the synchronous test-cases ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract. We present several theorems and their proofs which enable using synchronous testing techniques such as input output conformance testing (ioco) in order to test implementations only accessible through asynchronous communication channels. These theorems define when the synchronous test

Asynchronous multiparty computation: Theory and implementation

by Martin Geisler, Mikkel Krøigaard, Jesper Buus Nielsen - In PKC’09, volume 5443 of LNCS , 2009
"... Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n 2 |C|k) where n is the number of parties, |C | is the size of the arithmetic circuit being computed, and k is the size of elements in the underlying field. The prot ..."
Abstract - Cited by 51 (0 self) - Add to MetaCart
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n 2 |C|k) where n is the number of parties, |C | is the size of the arithmetic circuit being computed, and k is the size of elements in the underlying field

A fresh look at testing for asynchronous communication ⋆

by Puneet Bhateja, Paul Gastin, Madhavan Mukund
"... Abstract. Testing is one of the fundamental techniques for verifying if a computing system conforms to its specification. We take a fresh look at the theory of testing for message-passing systems based on a natural notion of observability in terms of input-output relations. We propose two notions of ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
Abstract. Testing is one of the fundamental techniques for verifying if a computing system conforms to its specification. We take a fresh look at the theory of testing for message-passing systems based on a natural notion of observability in terms of input-output relations. We propose two notions

Testing the Data Freshness Properties of Asynchronous Communication Mechanisms

by F. Xia, A. Yakovlev, I.G. Clark , 1999
"... Data freshness properties of asynchronous communication mechanisms (ACMs) are related to the relative timing of reader and writer statements. When a hardware implementation of an ACM is tested at the highest operating speed, such relative timing is difficult to measure if the observing hardware is n ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
Data freshness properties of asynchronous communication mechanisms (ACMs) are related to the relative timing of reader and writer statements. When a hardware implementation of an ACM is tested at the highest operating speed, such relative timing is difficult to measure if the observing hardware
Next 10 →
Results 1 - 10 of 657
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University