2291 search results - page 202 / 459 » Representational Reasoning and Verification |
105
Voted
ICFEM
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective t...
104
click to vote
CAV
2006
Springer
15 years 4 months ago
2006
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
113
Voted
FTDCS
2004
IEEE
15 years 4 months ago
2004
IEEE
Web services are essentially black box components from a composer's or a mediator's perspective. The behavioural description of any service can be asserted by the compos...
110
Voted
FORMATS
2006
Springer
15 years 4 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
128
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Adaptive Random Testing subsumes a class of algorithms that detect the first failure with less test cases than Random Testing. The present paper shows that a "reference metho...