Tools and Techniques for Model Checking Networked Programs

Artho, Cyrille; Leungwattanakit, Watcharin; Hagiya, Masami; Tanabe, Yoshinori

doi:10.1109/snpd.2008.36

Cited by 3 publications

(4 citation statements)

References 28 publications

(64 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A large search frontier implies a potentially large number of physical connections. 3 After the entire state space has been explored, the number of all physical connections ever used corresponds to the number of all distinct communication traces ever generated, which is a lower bound if the entire state space of the SUT is to be explored. For a deterministic SUT, the number of physical connections corresponds to the number of logical connections.…”

Section: Complexitymentioning

confidence: 99%

“…Backtracking may cause a repetition of previously executed operations. This requires special treatment of communication operations, as described in the introduction, and more in depth in a recent survey [3]. Peer processes may be included in the resulting system [11], [20] or modeled by a (possibly abstracted) environment process or stub [7], [10], [14].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Cache-Based Model Checking of Networked Applications: From Linear to Branching Time

Artho

Leungwattanakit

Hagiya

et al. 2009

2009 IEEE/ACM International Conference on Automated Software Engineering

Self Cite

View full text Add to dashboard Cite

Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such systems. However, a simple state space exploration scheme is not applicable, as backtracking results in repeated communication operations. A cache-based approach solves this problem by hiding redundant communication operations from the environment. In this work, we propose a change from a linear-time to a branching-time cache, allowing us to relax restrictions in previous work regarding communication traces that differ between schedules. We successfully applied the new algorithm to real-life programs where a previous solution is not applicable.

show abstract

Section: Complexitymentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Cache-Based Model Checking of Networked Applications: From Linear to Branching Time

Artho

Leungwattanakit

Hagiya

et al. 2009

2009 IEEE/ACM International Conference on Automated Software Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…e.g. (Artho, 2008) The BET approach was recently popularized as an automated class testing method, e.g. (Sullivan, 2004).…”

Section: Exhaustive Testingmentioning

confidence: 99%

Applicability of Bet to Elusive Bugs in Diverse Application Areas

Chaudhary¹,

Chen

Desai³

et al. 2009

Proceedings of the 4th International Conference on Software and Data Technologies

View full text Add to dashboard Cite

Abstract:The basic principles of Bounded Exhaustive Testing (BET) are reviewed, as well as the concept of an Elusive Bug (EB). Initial work on the application of BET to EB's previously indicated that it provides a new and promising approach to this problem. A four-part BET/EB oriented test framework involving: fault model development, BET test generation design, failure model identification and automated oracle design is introduced. The framework provides a systematic approach to BET/EB. It was applied to three very different areas of application. The research indicated the general applicability of BET and the BET/EB framework. It resulted in increased insight into BET/EB including the development of new techniques, such as the BET/EB "inverse oracle". The research illustrated how fault models can be used to put BET application bounding on a systematic basis. It also illustrated how failure models can be used to facilitate the development of automated oracles, and how they can be used, along with fault models, to systematically define the effectiveness scope of a BET testing strategy.

show abstract

“…Networked applications are very complex, since they exchange data and interoperate with other entities. Several techniques have been established to verify such applications with a model checker [2]. The aim of our research is to offer another technique together with a tool, which relaxes restrictions of previous approaches.…”

Section: Introductionmentioning

confidence: 99%