Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
Increasingly, companies recognize that most of their important information does not exist in relational stores but in documents. For a long time, textual information has been rela...
This paper proposes a bio-inspired approach tailored to the construction of a Grid information system in which content, specifically metadata descriptors that specify the characte...
Agostino Forestiero, Carlo Mastroianni, Giandomeni...
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
The presence of "unwanted" (or background) traffic in the Internet is a well-known fact. In principle any network that has been engineered without taking its presence in...