3319 search results - page 195 / 664 » Subshifts, Languages and Logic |
277
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
150
click to vote
ICFCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finit...
186
click to vote
LICS
2005
IEEE
16 years 5 days ago
2005
IEEE
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heap...
187
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...
176
click to vote
ICWE
2010
Springer
15 years 8 months ago
2010
Springer
Model-based approaches for interactive Web applications have neglected vocal interaction. However, ubiquitous multi-device environments call for better support for such modality. I...