Titlebook: Hardware and Software: Verification and Testing; Third International Karen Yorav Conference proceedings 2008 Springer-Verlag Berlin Heidel

錯(cuò)

Keratin

幻影

How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparisoncase studies. The study considers the model checkers ETMCC, MRMC, PRISM (sparse and hybrid mode), YMER and VESTA, and focuses on fully probabilistic systems. Several of our experiments show significantly different run times and memory consumptions between the tools—up to various orders of magnitude—

Synovial-Fluid

Constraint Patterns and Search Procedures for CP-Based Random Test Generationting CP methodologies are well tuned for traditional combinatorial applications e.g. logistics or scheduling, the problem domain of functional test generation remains largely unexplored by the CP community and many of its domain specific features and challenges are still unaddressed. In this paper w

任意

Using Virtual Coverage to Hit Hard-To-Reach Eventsssist in the task when the coverage events are part of a structured coverage model, but is a-priori less useful when the target events are singular and not part of a model. We present virtual coverage models as a mean for enabling data-driven CDG to reach singular events. A virtual coverage model is

焦慮

Test Case Generation for Ultimately Periodic Pathsions that either restrict the generality or are heuristic in nature (and do not guarantee to terminate). In this paper, we concentrate on a related problem, that of verifying that a cycle in the flow chart of a program does not terminate. We show some exact and sufficient conditions for cycle nonter

Collected

Dynamic Testing Via Automata Learningrface descriptions, our method successively explores the system under test (SUT), while it at the same time extrapolates a behavioral model. This is in turn used to steer the further exploration process. Due to the applied learning technique, our method is optimal in the sense that the extrapolated

單挑

Deference

Exploiting Shared Structure in Software Verification Conditionsties that depend on complex interprocedural flow of data. An obvious approach to improve performance is to exploit software structure. Although a tremendous amount of work has been done on exploiting structure at various levels of granularity, the fine-grained shared structure among multiple verific

occurrence