1175 search results - page 53 / 235 » Abstract computability and algebraic specification |
128
click to vote
EUROCAST
2007
Springer
15 years 7 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
120
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
110
click to vote
TSD
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. In this paper we introduce two ideas for phoneme classification: First, we derive the necessary steps to integrate linear transform into the computation of reproducing ke...
226
click to vote
POPL
2009
ACM
16 years 3 months ago
2009
ACM
We develop a model of concurrent imperative programming with threads. We focus on a small imperative language with cooperative threads which execute without interruption until the...
117
click to vote
SIGSOFT
2004
ACM
15 years 8 months ago
2004
ACM
A type system for object models is described that supports subtypes and allows overloading of relation names. No special features need be added to the modelling language; in parti...