130 search results - page 18 / 26 » The Language Theory of Bounded Context-Switching |
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
14 years 27 days ago
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
STACS
2001
Springer
13 years 12 months ago
2001
Springer
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...