Sciweavers

1171 search results - page 204 / 235
» A Logical Language for Expressing Authorizations
Sort
View
POPL
2003
ACM
16 years 2 days ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
106
Voted
ICALP
2009
Springer
16 years 1 days ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SAC
2008
ACM
14 years 11 months ago
Removing useless variables in cost analysis of Java bytecode
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
FMCO
2003
Springer
121views Formal Methods» more  FMCO 2003»
15 years 5 months ago
TulaFale: A Security Tool for Web Services
Web services security specifications are typically expressed as a mixture of XML schemas, example messages, and narrative explanations. We propose a new specification language fo...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
DEBU
2008
136views more  DEBU 2008»
14 years 12 months ago
Towards a Unified Declarative and Imperative XQuery Processor
Since the birth of XML, the processing of XML query languages like XQuery/XQueryP has been widely researched in the academic and industrial communities. Most of the approaches con...
Zhen Hua Liu, Anguel Novoselsky, Vikas Arora