Sciweavers

2019 search results - page 346 / 404
» Programming with Shared Data Abstractions
Sort
View
FOSSACS
2009
Springer
14 years 4 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
CEC
2008
IEEE
14 years 4 months ago
DCA for bot detection
Abstract— Ensuring the security of computers is a nontrivial task, with many techniques used by malicious users to compromise these systems. In recent years a new threat has emer...
Yousof Al-Hammadi, Uwe Aickelin, Julie Greensmith
ICALP
2007
Springer
14 years 3 months ago
Succinct Ordinal Trees Based on Tree Covering
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
Meng He, J. Ian Munro, S. Srinivasa Rao
COMPSAC
1999
IEEE
14 years 1 months ago
Dynamic Software Architecture Slicing
As the complexity of software systems increases, so need for a good mechanism of abstraction. architecture design is an abstraction, hiding an immense amount of details about the ...
Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T....
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
14 years 1 months ago
Higher Order Demand Propagation
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
Dirk Pape