Sciweavers

3025 search results - page 295 / 605
» Automatic Programming of Robots Using Genetic Programming
Sort
View
PADL
2007
Springer
15 years 10 months ago
Rewriting Haskell Strings
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
Duncan Coutts, Don Stewart, Roman Leshchinskiy
PADL
2007
Springer
15 years 10 months ago
From Zinc to Design Model
We describe a preliminary implementation of the high-level modelling language Zinc. This language supports a modelling methodology in which the same Zinc model can be automatically...
Reza Rafeh, Maria J. García de la Banda, Ki...
CSUR
1999
114views more  CSUR 1999»
15 years 3 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
APLAS
2010
ACM
15 years 1 months ago
Metric Spaces and Termination Analyses
We present a framework for defining abstract interpreters for liveness properties, in particular program termination. The framework makes use of the theory of metric spaces to defi...
Aziem Chawdhary, Hongseok Yang
POPL
2006
ACM
16 years 4 months ago
Simplifying reductions
We present optimization techniques for high level equational programs that are generalizations of affine control loops (ACLs). Significant parts of the SpecFP and PerfectClub benc...
Gautam Gupta, Sanjay V. Rajopadhye