6167 search results - page 1078 / 1234 » Can Refinement be Automated |
108
click to vote
SIGSOFT
2002
ACM
16 years 4 months ago
2002
ACM
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
139
click to vote
CADE
2006
Springer
16 years 3 months ago
2006
Springer
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
116
click to vote
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
127
click to vote
ICST
2008
IEEE
15 years 9 months ago
2008
IEEE
–Abstract for conference - preliminary Model-Based Testing: Models for Test Cases Jan Tretmans, Embedded Systems Institute, Eindhoven : Systematic testing of software plays an im...
154
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
— Frequent failure occurrences are becoming a serious concern to the community of high-end computing, especially when the applications and the underlying systems rapidly grow in ...