Sciweavers

1760 search results - page 72 / 352
» A System to Mark Programs Automatically
Sort
View
HASKELL
2006
ACM
15 years 5 months ago
Strongly typed memory areas programming systems-level data structures in a functional language
Modern functional languages offer several attractive features to support development of reliable and secure software. However, in our efforts to use Haskell for systems programmin...
Iavor S. Diatchki, Mark P. Jones
RSP
2007
IEEE
141views Control Systems» more  RSP 2007»
15 years 6 months ago
Rapid Prototyping of Intrusion Detection Systems
Designing security softwares that evolve as quickly as threats is a truthful challenge. In addition, current software becomes increasingly more complex and difficult to handle ev...
Fabrice Kordon, Jean-Baptiste Voron
CSUR
1999
114views more  CSUR 1999»
14 years 11 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
ICSM
2000
IEEE
15 years 4 months ago
ConSIT: A Conditioned Program Slicer
Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including re-use, ree...
Chris Fox, Mark Harman, Robert M. Hierons, Sebasti...
PPDP
2005
Springer
15 years 5 months ago
Program transformation by templates based on term rewriting
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...
Yuki Chiba, Takahito Aoto, Yoshihito Toyama