Sciweavers

10575 search results - page 2097 / 2115
» Programming Languages
Sort
View
SIGSOFT
2007
ACM
15 years 10 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
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...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
76
Voted
SIGSOFT
2001
ACM
15 years 10 months ago
WREN---an environment for component-based development
Prior research in software environments focused on three important problems-- tool integration, artifact management, and process guidance. The context for that research, and hence...
Chris Lüer, David S. Rosenblum
WWW
2007
ACM
15 years 10 months ago
Preference-based selection of highly configurable web services
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...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...
88
Voted
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
15 years 10 months ago
Weak Verifiable Random Functions
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...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
CADE
2001
Springer
15 years 10 months ago
More On Implicit Syntax
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...
Marko Luther
« Prev « First page 2097 / 2115 Last » Next »