4460 search results - page 475 / 892 » Formal methods for interactive systems |
203
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
191
click to vote
LRE
2006
15 years 6 months ago
2006
When building a new spoken dialogue application, large amounts of domain specific data are required. This paper addresses the issue of generating in-domain training data when litt...
235
click to vote
CAV
1998
Springer
15 years 11 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
168
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
Programming technologies have improved continuously during the last decades, but from an Information Systems perspective, some well-known problems associated to the design and impl...
204
Voted
TLDI
2010
ACM
15 years 7 months ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...