Sciweavers

316 search results - page 1 / 64
» paste 2004
Sort
View
ACTA
2004
97views more  ACTA 2004»
13 years 5 months ago
Past is for free: on the complexity of verifying linear temporal properties with past
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
Nicolas Markey
PASTE
2004
ACM
13 years 11 months ago
Importance of heap specialization in pointer analysis
Erik M. Nystrom, Hong-Seok Kim, Wen-mei W. Hwu
FC
2004
Springer
81views Cryptology» more  FC 2004»
13 years 11 months ago
Cryptography and the French Banking Cards: Past, Present, Future
Abstract. This is a brief summary of the invited lecture delivered during the conference. The interested reader is referred to [2] for more information.
Jacques Stern