Sciweavers

3228 search results - page 513 / 646
» Computationally Sound Proofs
Sort
View
POPL
2008
ACM
14 years 9 months ago
The intensional content of Rice's theorem
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
Andrea Asperti
CADE
2005
Springer
14 years 9 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
ICALP
2009
Springer
14 years 9 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
PERCOM
2005
ACM
14 years 8 months ago
Secure context-sensitive authorization
There is a recent trend toward rule-based authorization systems to achieve flexible security policies. Also, new sensing technologies in pervasive computing make it possible to de...
Kazuhiro Minami, David Kotz
MOBIHOC
2008
ACM
14 years 8 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer