Sciweavers

3547 search results - page 380 / 710
» Pseudo-Exhaustive Testing for Software
Sort
View
NETWORK
2010
119views more  NETWORK 2010»
15 years 1 months ago
A multiple failure propagation model in GMPLS-based networks
In this article, a new model to simulate different failure propagation scenarios in GMPLS-based networks is proposed. Several types of failures and malfunctions may spread along t...
Eusebi Calle, J. Ripoll, J. Segovia, Pere Vil&agra...
STTT
2010
116views more  STTT 2010»
15 years 1 months ago
LTL satisfiability checking
Abstract. We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-...
Kristin Y. Rozier, Moshe Y. Vardi
NFM
2011
335views Formal Methods» more  NFM 2011»
15 years 1 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
PERVASIVE
2011
Springer
14 years 9 months ago
Hybrid Prototyping by Using Virtual and Miniature Simulation for Designing Spatial Interactive Information Systems
Abstract. In this paper, we introduce CityCompiler, an integrated environment for the iteration-based development of spatial interactive systems. CityCompiler visualizes interactiv...
Yasuto Nakanishi, Koji Sekiguchi, Takuro Ohmori, S...
SIAMCOMP
2011
14 years 9 months ago
An Expansion Tester for Bounded Degree Graphs
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
Satyen Kale, C. Seshadhri