Sciweavers

1809 search results - page 277 / 362
» Software Model Checking Using Linear Constraints
Sort
View
EMSOFT
2003
Springer
14 years 2 months ago
Resource Interfaces
We present a formalism for specifying component interfaces that expose component requirements on limited resources. The formalism permits an algorithmic check if two or more compon...
Arindam Chakrabarti, Luca de Alfaro, Thomas A. Hen...
AI
2002
Springer
13 years 9 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
EUROMICRO
2007
IEEE
14 years 3 months ago
Compatibility and reuse in component-based systems via type and unit inference
In many branches of industry, the component-based approach to systems design is predominant, e. g., as in embedded control systems which are often modelled using MATLAB/Simulink. ...
Christian Kühnel, Andreas Bauer 0002, Michael...
ISSTA
2010
ACM
13 years 11 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 7 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
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 ...
Alessandro Cimatti, Anders Franzén, Alberto...