Sciweavers

7430 search results - page 628 / 1486
» Programming Applications in CIFF
Sort
View
PLDI
2010
ACM
16 years 4 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
IPPS
2008
IEEE
16 years 1 months ago
A transparent non-invasive file data model for algorithmic skeletons
A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes a...
Denis Caromel, Mario Leyton
VL
2007
IEEE
112views Visual Languages» more  VL 2007»
16 years 1 months ago
Visual Languages: A Matter of Style
This articles submits the thesis that visual data modeling and programming languages are conveniently conceived as rendering, or ‘styling’, of conventional, textual languages....
Sacha Berger, François Bry, Tim Furche, Chr...
ECOOP
2007
Springer
16 years 1 months ago
Exception Handling: A Field Study in Java and .NET
Most modern programming languages rely on exceptions for dealing with abnormal situations. Although exception handling was a significant improvement over other mechanisms like chec...
Bruno Cabral, Paulo Marques
DSN
2005
IEEE
16 years 25 days ago
Defeating Memory Corruption Attacks via Pointer Taintedness Detection
Most malicious attacks compromise system security through memory corruption exploits. Recently proposed techniques attempt to defeat these attacks by protecting program control da...
Shuo Chen, Jun Xu, Nithin Nakka, Zbigniew Kalbarcz...