815 search results - page 81 / 163 » Algebraic Recognizability of Languages |
176
click to vote
TAPSOFT
1995
Springer
15 years 9 months ago
1995
Springer
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...
269
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
157
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
The goal of this paper is to give an overview of the basics of the theory of RDF databases. We provide a formal definition of RDF that includes the features that distinguish this m...
158
click to vote
COORDINATION
2009
Springer
16 years 6 months ago
2009
Springer
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
127
click to vote
ASPDAC
2005
ACM
15 years 11 months ago
2005
ACM
— With the rise in complexity of modern systems, designers are spending a significant time on at the system level of abstraction. This paper introduces Model Algebra, a formalis...