13383 search results - page 285 / 2677 » Abstractions from proofs |
154
click to vote
COCO
2005
Springer
16 years 7 days ago
2005
Springer
A property tester with high probability accepts inputs satisfying a given property and rejects inputs that are far from satisfying it. A tolerant property tester, as defined by P...
166
click to vote
FORMATS
2003
Springer
15 years 12 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
198
click to vote
ECOOPW
1999
Springer
15 years 11 months ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
166
click to vote
EKAW
1994
Springer
15 years 10 months ago
1994
Springer
Formal knowledge modelling languages have a number of advantages over informal languages, such as their precise meaning and the possibility to derive propertiesthrough formal proof...
171
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we show the optimality of a certain class of disturbance-affine control policies in the context of one-dimensional, constrained, multi-stage robust optimization. Ou...