Sciweavers

1941 search results - page 351 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
14 years 12 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
LPAR
2005
Springer
15 years 5 months ago
The Four Sons of Penrose
Abstract. We distill Penrose’s argument against the “artificial intelligence premiss”, and analyze its logical alternatives. We then clarify the different positions one can...
Nachum Dershowitz
SIGSOFT
2005
ACM
16 years 17 days ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
15 years 6 months ago
Short and Stateless Signatures from the RSA Assumption
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
Susan Hohenberger, Brent Waters
ICRA
2008
IEEE
123views Robotics» more  ICRA 2008»
15 years 6 months ago
Target-directed attention: Sequential decision-making for gaze planning
— It is widely agreed that efficient visual search requires the integration of target-driven top-down information and image-driven bottom-up information. Yet the problem of gaze...
Julia Vogel, Nando de Freitas