Sciweavers

2335 search results - page 149 / 467
» Type Checking Type Classes
Sort
View
ACSAC
2003
IEEE
14 years 23 days ago
Defending Embedded Systems Against Buffer Overflow via Hardware/Software
Buffer overflow attacks have been causing serious security problems for decades. With more embedded systems networked, it becomes an important research problem to defend embedded ...
Zili Shao, Qingfeng Zhuge, Yi He, Edwin Hsing-Mean...
VISUALIZATION
1992
IEEE
14 years 1 months ago
Display of Scientific Data Structures for Algorithm Visualization
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
POPL
2010
ACM
14 years 6 months ago
Contracts Made Manifest
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
Benjamin C. Pierce, Michael Greenberg, Stephanie W...
FOSSACS
2006
Springer
14 years 23 days ago
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
Abstract. We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the de...
Petr Jancar, Jirí Srba
MOC
2002
92views more  MOC 2002»
13 years 8 months ago
Error indicators for the mortar finite element discretization of the Laplace equation
The mortar technique turns out to be well adapted to handle mesh adaptivity in finite elements, since it allows for working with nonnecessarily compatible discretizations on the el...
Christine Bernardi, Frédéric Hecht