Sciweavers

161 search results - page 13 / 33
» Lazy call-by-value evaluation
Sort
View
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
13 years 6 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft
SCAM
2007
IEEE
14 years 1 months ago
Finding Inputs that Reach a Target Expression
We present an automated program analysis, called Reach, to compute program inputs that cause evaluation of explicitly-marked target expressions. Reach has a range of applications ...
Matthew Naylor, Colin Runciman
EDBT
2000
ACM
13 years 11 months ago
Navigation-Driven Evaluation of Virtual Mediated Views
The MIX mediator systems incorporates a novel framework for navigation-driven evaluation of virtual mediated views. Its architecture allows the on-demand computation of views and q...
Bertram Ludäscher, Yannis Papakonstantinou, P...
SAS
1994
Springer
104views Formal Methods» more  SAS 1994»
13 years 11 months ago
Strictness and Totality Analysis
We definea novelinference systemfor strictness andtotality analysisfor the simplytyped lazy lambda-calculus with constants and fixpoints. Strictness information identifies those t...
Kirsten Lackner Solberg
IWIA
2006
IEEE
14 years 1 months ago
The LAIDS/LIDS Framework for Systematic IPS Design
The recent outbreaks of extremely fast spreading worms highlight the inadequacy of the current patching approach. Intrusion prevention systems (IPSs) that automatically generate a...
Simon P. Chung, Aloysius K. Mok