Sciweavers

1073 search results - page 174 / 215
» Formal Program Development with Approximations
Sort
View
WMPI
2004
ACM
14 years 1 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
C5
2004
IEEE
13 years 11 months ago
Scratch: A Sneak Preview
information technologies as "the ability to reformulate knowledge, to express oneself creatively and appropriately, and to produce and generate information (rather than simply...
John Maloney, Leo Burd, Yasmin B. Kafai, Natalie R...
PEPM
2010
ACM
13 years 9 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
POPL
2012
ACM
12 years 3 months ago
Static and user-extensible proof checking
Despite recent successes, large-scale proof development within proof assistants remains an arcane art that is extremely timeconsuming. We argue that this can be attributed to two ...
Antonis Stampoulis, Zhong Shao
SAS
2001
Springer
166views Formal Methods» more  SAS 2001»
14 years 1 days ago
Estimating the Impact of Scalable Pointer Analysis on Optimization
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...
Manuvir Das, Ben Liblit, Manuel Fähndrich, Ja...