Sciweavers

6740 search results - page 186 / 1348
» Using Classification as a Programming Language
Sort
View
106
Voted
ICFP
2006
ACM
16 years 1 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
15 years 6 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
109
Voted
FDL
2008
IEEE
15 years 8 months ago
Towards Compilation of Streaming Programs into FPGA Hardware
There is an increasing need for automated conversion of high-level design descriptions into hardware. We present a flow that converts a software application written in the Brook ...
Franjo Plavec, Zvonko G. Vranesic, Stephen Dean Br...
ENTCS
2007
104views more  ENTCS 2007»
15 years 1 months ago
Algorithmic Debugging of Java Programs
In this paper we propose applying the ideas of declarative debugging to the object-oriented language Java as an alternative to traditional trace debuggers used in imperative langu...
Rafael Caballero, Christian Hermanns, Herbert Kuch...
223
Voted
POPL
2006
ACM
16 years 2 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy