2000 search results - page 289 / 400 » Program Transformation and Proof Transformation |
161
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
114
Voted
DAC
1998
ACM
16 years 4 months ago
1998
ACM
Successive, formal refinement is a new approach for specification of embedded systems using a general-purpose programming language. Systems are formally modeled as Abstractable Sy...
124
Voted
WWW
2006
ACM
16 years 4 months ago
2006
ACM
We present a paradigm for uniting the diverse strands of XML-based Web technologies by allowing them to be incorporated within a single document. This overcomes the distinction be...
125
click to vote
ICFP
2002
ACM
16 years 3 months ago
2002
ACM
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
123
Voted
DATE
2008
IEEE
15 years 10 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...