Sciweavers

824 search results - page 8 / 165
» Constructing Functional Programs for Grammar Analysis Proble...
Sort
View
SAC
2000
ACM
13 years 11 months ago
An Approach for Modeling the Name Lookup Problem in the C++ Programming Language
Abstract. Formal grammars are well established for specifying the syntax of programming languages. However, the formal specification of programming language semantics has proven mo...
James F. Power, Brian A. Malloy
CEC
2009
IEEE
14 years 2 days ago
Grammar-based genetic programming for timetabling
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
Mohamed Bahy El Bader-El-Den, Riccardo Poli
CC
1998
Springer
134views System Software» more  CC 1998»
13 years 11 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
MLMTA
2007
13 years 8 months ago
GenInc: An Incremental Context-Free Grammar Learning Algorithm for Domain-Specific Language Development
- While grammar inference (or grammar induction) has found extensive application in the areas of robotics, computational biology, speech and pattern recognition, its application to...
Faizan Javed, Marjan Mernik, Barrett R. Bryant, Al...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 2 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...