Sciweavers

1999 search results - page 188 / 400
» Dependently Typed Grammars
Sort
View
PPDP
2007
Springer
16 years 17 days ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
15 years 11 months ago
Optimization of dynamic memory managers for embedded systems using grammatical evolution
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
José L. Risco-Martín, David Atienza,...
ICSE
2001
IEEE-ACM
15 years 11 months ago
Encoding Program Executions
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
Steven P. Reiss, Manos Renieris
KBSE
2000
IEEE
15 years 10 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
RIVF
2007
15 years 7 months ago
Thai Speech Keyword Spotting using Heterogeneous Acoustic Modeling
This paper illustrates the use of acoustic modeling of spoken dialog systems. One major problem with using speech three different structures, including syllables, fillers and recog...
S. Tangruamsub, Proadpran Punyabukkana, Atiwong Su...