Sciweavers

2000 search results - page 204 / 400
» Program Transformation and Proof Transformation
Sort
View
TCS
2010
15 years 2 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
MOMPES
2006
IEEE
15 years 10 months ago
Model-Driven Development of Real-Time Systems with UML 2.0 and C
In this era of intense liking to automation in almost all time-critical fields, real-time systems have got widespread utilization in industrial, commercial, medical, space and mil...
Mohammad Ullah Khan, Kurt Geihs, Felix Gutbrodt, P...
HASKELL
2006
ACM
15 years 10 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
135
Voted
LOPSTR
2001
Springer
15 years 8 months ago
On Deforesting Parameters of Accumulating Maps
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
Kazuhiko Kakehi, Robert Glück, Yoshihiko Futa...
170
Voted
ICS
1999
Tsinghua U.
15 years 8 months ago
An experimental evaluation of tiling and shackling for memory hierarchy management
On modern computers, the performance of programs is often limited by memory latency rather than by processor cycle time. To reduce the impact of memory latency, the restructuring ...
Induprakas Kodukula, Keshav Pingali, Robert Cox, D...