61 search results - page 9 / 13 » Boolean and Cartesian Abstraction for Model Checking C Progr... |
TACAS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
FMCAD
2009
Springer
14 years 3 months ago
2009
Springer
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
TOOLS
2009
IEEE
14 years 3 months ago
2009
IEEE
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...
JAIR
2010
13 years 7 months ago
2010
We present DCL-PC: a logic for reasoning about how the abilities of agents and coalitions of agents are altered by transferring control from one agent to another. The logical foun...
TSE
2011
13 years 3 months ago
2011
—Conventional testing methods often fail to detect hidden flaws in complex embedded software such as device drivers or file systems. This deficiency incurs significant developmen...