Sciweavers

1760 search results - page 133 / 352
» A System to Mark Programs Automatically
Sort
View
PEPM
1993
ACM
15 years 7 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen
ADAEUROPE
2008
Springer
15 years 9 months ago
Operational Semantics of Ada Ravenscar
The Ada programming language has been designed from the ground up for safety-critical real-time systems. This trend has continued with the Ada 2005 language definition which has i...
Irfan Hamid, Elie Najm
PDPTA
1996
15 years 4 months ago
Exploiting Task-Level Parallelism Using pTask
This paper presents pTask-- a system that allows users to automatically exploit dynamic task-level parallelism in sequential array-based C programs. The system employs compiler an...
Tarek S. Abdelrahman, Sum Huynh
CIKM
2008
Springer
15 years 5 months ago
Socialtagger - collaborative tagging for blogs in the long tail
Social bookmarking is the process through which users share tags for online resources like blogs with others. Such collaborative tags provide valuable metadata for retrieval syste...
Shankara B. Subramanya, Huan Liu
ENTCS
2006
109views more  ENTCS 2006»
15 years 3 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone