11345 search results - page 1671 / 2269 » Foundations of Computer Science |
187
click to vote
LICS
2008
IEEE
16 years 26 days ago
2008
IEEE
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
178
click to vote
LICS
2008
IEEE
16 years 26 days ago
2008
IEEE
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
169
click to vote
LICS
2008
IEEE
16 years 26 days ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
153
click to vote
LICS
2008
IEEE
16 years 26 days ago
2008
IEEE
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
152
click to vote
SSDBM
2008
IEEE
16 years 25 days ago
2008
IEEE
This paper describes a tool for providing transparent access to online meteorological databases by way of local file system. It is realized by FUSE, an implementation of usermode ...