103 search results - page 7 / 21 » Computational Interpretations of Classical Linear Logic |
BANFF
1995
13 years 10 months ago
1995
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
MFCS
2001
Springer
13 years 11 months ago
2001
Springer
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead ...
AMAST
2000
Springer
13 years 11 months ago
2000
Springer
The primary objective of this paper is to present the deÿnition of a new dynamic, linear and modal logic for security protocols. The logic is compact, expressive and formal. It a...
VL
2007
IEEE
14 years 29 days ago
2007
IEEE
Interval-valued computation is an unconventional computing paradigm. It is an idealization of classical 16-, 32-, 64- etc. bit based computations. It represents data as specific ...
SAC
2010
ACM
14 years 1 months ago
2010
ACM
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...