Sciweavers

317 search results - page 58 / 64
» Bounded Model Checking with QBF
Sort
View
IANDC
2010
84views more  IANDC 2010»
13 years 6 months ago
Underapproximation for model-checking based on universal circuits
For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit de...
Arie Matsliah, Ofer Strichman
SIGSOFT
2007
ACM
14 years 8 months ago
A specification-based approach to testing software product lines
This paper presents a specification-based approach for systematic testing of products from a software product line. Our approach uses specifications given as formulas in Alloy, a ...
Engin Uzuncaova, Daniel Garcia, Sarfraz Khurshid, ...
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
14 years 2 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
ICSOC
2009
Springer
14 years 2 months ago
An Automatic Approach to Enable Replacement of Conversational Services
Abstract. In Service Oriented Architectures (SOAs) services invoked in a composition can be replaced by other services, which are possibly discovered and bound at runtime. Most of ...
Luca Cavallaro, Elisabetta Di Nitto, Matteo Pradel...
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park