Sciweavers

8132 search results - page 70 / 1627
» Dependability, Abstraction, and Programming
Sort
View
CONCUR
1991
Springer
15 years 9 months ago
A Method for the Development of Totally Correct Shared-State Parallel Programs
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
Ketil Stølen
TPHOL
2008
IEEE
16 years 19 days ago
First-Class Type Classes
Abstract. Type Classes have met a large success in Haskell and Isabelle, as a solution for sharing notations by overloading and for specith abstract structures by quantification o...
Matthieu Sozeau, Nicolas Oury
ESOP
1990
Springer
15 years 10 months ago
From Interpreting to Compiling Binding Times
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...
Charles Consel, Olivier Danvy
ICALP
2010
Springer
15 years 11 months ago
Dynamic Programming for Graphs on Surfaces
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
COMPSAC
2000
IEEE
15 years 10 months ago
Dependence Analysis of Java Bytecode
Understanding program dependencies in a computer program is essential for many software engineering tasks such as program understanding, testing, debugging, reverse engineering, a...
Jianjun Zhao