Sciweavers

149 search results - page 9 / 30
» Model Checking Sum and Product
Sort
View
TOOLS
2009
IEEE
15 years 4 months ago
Guaranteeing Syntactic Correctness for All Product Line Variants: A Language-Independent Approach
A software product line (SPL) is a family of related program variants in a well-defined domain, generated from a set of features. A fundamental difference from classical applicati...
Christian Kästner, Sven Apel, Salvador Trujil...
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
14 years 11 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
FMICS
2007
Springer
15 years 3 months ago
Checking the TWIN Elevator System by Translating Object-Z to SMV
In the context of large scale industrial installations, model checking often fails to tap its full potential because of a missing link between a system’s specification and its f...
Sören Preibusch, Florian Kammüller
TSE
2008
107views more  TSE 2008»
14 years 9 months ago
Interface Grammars for Modular Software Model Checking
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...
Graham Hughes, Tevfik Bultan
CAV
2008
Springer
170views Hardware» more  CAV 2008»
14 years 11 months ago
Local Proofs for Linear-Time Properties of Concurrent Programs
Abstract. This paper develops a local reasoning method to check lineartime temporal properties of concurrent programs. In practice, it is often infeasible to model check over the p...
Ariel Cohen 0002, Kedar S. Namjoshi