Sciweavers

756 search results - page 24 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
SOCO
2005
Springer
14 years 1 months ago
Stateful Aspects in JAsCo
Aspects that trigger on a sequence of join points instead of on a single join point are not explicitly supported in current AspectOriented approaches. Explicit protocols are howeve...
Wim Vanderperren, Davy Suvée, María ...
ICASSP
2010
IEEE
13 years 8 months ago
Language recognition using deep-structured conditional random fields
We present a novel language identification technique using our recently developed deep-structured conditional random fields (CRFs). The deep-structured CRF is a multi-layer CRF mo...
Dong Yu, Shizhen Wang, Zahi Karam, Li Deng
SIGCSE
2004
ACM
100views Education» more  SIGCSE 2004»
14 years 1 months ago
A visual and interactive automata theory course with JFLAP 4.0
We describe the instructional software JFLAP 4.0 and how it can be used to provide a hands-on formal languages and automata theory course. JFLAP 4.0 doubles the number of chapters...
Ryan Cavalcante, Thomas Finley, Susan H. Rodger
ECOOP
2003
Springer
14 years 1 months ago
A Nominal Theory of Objects with Dependent Types
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
Martin Odersky, Vincent Cremet, Christine Röc...
POPL
2006
ACM
14 years 8 months ago
Frame rules from answer types for code pointers
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
Hayo Thielecke