1071 search results - page 110 / 215 » Programming with enumerable sets of structures |
117
click to vote
CICLING
2003
Springer
15 years 8 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
153
click to vote
CARDIS
2000
Springer
15 years 7 months ago
2000
Springer
This article describes a Java Card programming environment which to a large extent is generated from formal specifications of the syntax and semantics of Java Card, the JCRE (Jav...
166
click to vote
TSE
2010
14 years 9 months ago
2010
Statistical testing has been shown to be more efficient at detecting faults in software than other methods of dynamic testing such as random and structural testing. Test data are g...
142
click to vote
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
121
click to vote
CC
2010
Springer
15 years 9 months ago
2010
Springer
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...