13306 search results - page 351 / 2662 » Theoretical Computer Science |
192
click to vote
TCS
2011
15 years 1 months ago
2011
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
178
click to vote
TCS
2011
15 years 1 months ago
2011
A new complete characterization of β-strong normalization is given, both in the classical and in the lazy λ-calculus, through the notion of potential valuability inside two suit...
160
click to vote
TCS
2011
15 years 1 months ago
2011
The notion of repetition threshold, which is the object of Dejean’s conjecture (1972), was generalized by Ilie, Ochem, and Shallit in 2005, to include the lengths of the avoided ...
233
click to vote
TDSC
2011
15 years 1 months ago
2011
Recently, Chien proposed an ultralightweight RFID authentication protocol to prevent all possible attacks. However, we find two de-synchronization attacks to break the protocol. K...
139
click to vote
TCS
2010
15 years 1 months ago
2010
This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed -calculus based on IO-typing. The respective incremental constraints,...