10575 search results - page 2097 / 2115 » Programming Languages |
99
Voted
SIGSOFT
2007
ACM
16 years 11 days ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
88
Voted
SIGSOFT
2001
ACM
16 years 11 days ago
2001
ACM
Prior research in software environments focused on three important problems-- tool integration, artifact management, and process guidance. The context for that research, and hence...
86
Voted
WWW
2007
ACM
16 years 9 days ago
2007
ACM
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
99
Voted
TCC
2009
Springer
16 years 5 days ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
CADE
2001
Springer
15 years 12 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...