Sciweavers

1069 search results - page 55 / 214
» Automatic Generation of Language-based Tools
Sort
View
ENTCS
2006
153views more  ENTCS 2006»
14 years 11 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
APLAS
2006
ACM
15 years 5 months ago
Automatic Testing of Higher Order Functions
This paper tackles a problem often overlooked in functional programming community: that of testing. Fully automatic test tools like Quickcheck and G∀ST can test first order func...
Pieter W. M. Koopman, Rinus Plasmeijer
LCTRTS
2004
Springer
15 years 5 months ago
Flattening statecharts without explosions
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
Andrzej Wasowski
IPPS
2007
IEEE
15 years 6 months ago
A Study of Design Efficiency with a High-Level Language for FPGAs
Over the years reconfigurable computing devices such as FPGAs have evolved from gate-level glue logic to complex reprogrammable processing architectures. However, the tools used f...
Zain-ul-Abdin, Bertil Svensson
BALT
2010
14 years 6 months ago
Grammatical Aspects: Coping with Duplication and Tangling in Language Specifications
For the purposes of tool development, computer languages are usually described using context-free grammars with annotations such as semantic actions or pretty-printing instructions...
Andrey Breslav