Sciweavers

675 search results - page 80 / 135
» Using Fairness to Make Abstractions Work
Sort
View
123
Voted
CICLING
2009
Springer
15 years 7 months ago
Language Identification on the Web: Extending the Dictionary Method
Abstract. Automated language identification of written text is a wellestablished research domain that has received considerable attention in the past. By now, efficient and effecti...
Radim Rehurek, Milan Kolkus
151
Voted
WOWMOM
2009
ACM
146views Multimedia» more  WOWMOM 2009»
15 years 10 months ago
When opportunity proceeds from autonomy: A tour-based architecture for disconnected mobile sensors
We consider the case of sparse mobile sensors deployed to implement missions in challenging environments. This paper explores a notion of tour networks that is well suited to circ...
Michel Charpentier, Radim Bartos, Swapnil Bhatia
144
Voted
ESOP
2008
Springer
15 years 5 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
161
Voted
ICFP
2004
ACM
16 years 3 months ago
Verification of safety properties for concurrent assembly code
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
Dachuan Yu, Zhong Shao
187
Voted
OOPSLA
1995
Springer
15 years 7 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....