1454 search results - page 190 / 291 » Stateful traits and their formalization |
188
click to vote
JMLR
2012
13 years 8 months ago
2012
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
142
click to vote
SIGSOFT
2005
ACM
16 years 7 months ago
2005
ACM
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
181
click to vote
CHI
2007
ACM
16 years 6 months ago
2007
ACM
For years the HCI community has struggled to integrate design in research and practice. While design has gained a strong foothold in practice, it has had much less impact on the H...
302
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
154
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...