3044 search results - page 266 / 609 » Linear logical approximations |
193
Voted
CADE
2009
Springer
16 years 7 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
177
Voted
ICTAC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
168
Voted
DBPL
1999
Springer
15 years 11 months ago
1999
Springer
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
194
click to vote
TII
2010
15 years 1 months ago
2010
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
184
click to vote
CTRSA
2009
Springer
16 years 1 months ago
2009
Springer
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed...