Sciweavers

3319 search results - page 567 / 664
» Subshifts, Languages and Logic
Sort
View
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
13 years 10 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
LDTA
2010
13 years 9 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
GLOBECOM
2008
IEEE
13 years 9 months ago
Security Rules Specification and Analysis Based on Passive Testing
Security is a critical issue in dynamic and open distributed environments such as network-based services or wireless networks. To ensure that a certain level of security is maintai...
Wissam Mallouli, Fayçal Bessayah, Ana R. Ca...
ASE
2008
135views more  ASE 2008»
13 years 9 months ago
Deriving event-based transition systems from goal-oriented requirements models
Goal-oriented methods are increasingly popular for elaborating software requirements. They offer systematic support for incrementally building intentional, structural, and operati...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
ENTCS
2008
92views more  ENTCS 2008»
13 years 9 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed