Sciweavers

8132 search results - page 101 / 1627
» Dependability, Abstraction, and Programming
Sort
View
SPLC
2008
14 years 11 months ago
Feature Descriptions for Context-oriented Programming
In Context-oriented Programming (COP), programs can be partitioned into behavioral variations expressed as sets of partial program definitions. Such layers can be activated and de...
Pascal Costanza, Theo D'Hondt
ICFP
2002
ACM
15 years 10 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
FAC
2007
170views more  FAC 2007»
14 years 10 months ago
Are the Logical Foundations of Verifying Compiler Prototypes Matching user Expectations?
Abstract. The Verifying Compiler (VC) project proposals suggest that mainstream software developers are its targeted end-users. Like other software engineering efforts, the VC proj...
Patrice Chalin
IPPS
2010
IEEE
14 years 8 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
IPL
2008
118views more  IPL 2008»
14 years 10 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft