285 search results - page 30 / 57 » Model Checking Contracts - A Case Study |
CP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Today's models for propagation-based constraint solvers require propagators as implementations of constraints to be at least contracting and monotonic. These models ...
DAC
2007
ACM
14 years 23 days ago
2007
ACM
It has long been the practice to create models in C or C++ for architectural studies, software prototyping and RTL verification in the design of Systems-on-Chip (SoC). It is often...
OOPSLA
2007
Springer
14 years 3 months ago
2007
Springer
Objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and i...
RTSS
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
HVC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. This paper studies the efficiency of several probabilistic model checkers by comparing verification times and peak memory usage for a set of standard case studies. The s...