4666 search results - page 384 / 934 » Equations on Timed Languages |
169
click to vote
FDL
2007
IEEE
15 years 10 months ago
2007
IEEE
With the increasing complexity of today's embedded systems, there is a need to formally verify such designs at mixed abstraction levels. This is needed if some compoe describ...
156
Voted
COLING
2008
15 years 8 months ago
2008
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
142
click to vote
LREC
2008
15 years 8 months ago
2008
Patients require access to Electronic Patient Records, however medical language is often too difficult for patients to understand. Explaining records to patients is a time consumi...
151
click to vote
EMNLP
2009
15 years 4 months ago
2009
Machine involvement has the potential to speed up language documentation. We assess this potential with timed annotation experiments that consider annotator expertise, example sel...
300
Voted
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specificationsthey support. Dynamically-chec...