Lazy initialization

Known as: Lazy instantiation, Lazy initialization pattern, Lazy initialisation 
In computer programming, lazy initialization is the tactic of delaying the creation of an object, the calculation of a value, or some other expensive… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Lazy Initialization (LI) allows symbolic execution to effectively deal with heap-allocated data structures, thanks to a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 5
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Is it possible to maximize a monotone submodular function faster than the widely used lazy greedy algorithm (also known as… (More)
  • figure 1
Is this relevant?
2013
2013
Tight field bounds have been successfully used in the context of bounded-exhaustive bug finding. They allow one to check the… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
2013
2013
Symbolic execution suffers from problems when analyzing programs that handle complex data structures as their inputs and take… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Lazy Initialization Multilayer Modeling (LIMM) is an object oriented modeling language targeted to the declarative definition of… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
In order to make save and restore features practical, saved virtual machines (VMs) must be able to quickly restore to normal… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2010
2010
We present a denotational semantics for a simply typed call-by-need letrec calculus, which distinguishes direct cycles, such as… (More)
Is this relevant?
2007
2007
A lot of attention is now being focused on connectionist mode ls known under the name “reservoir computing”. The most prominent… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Decision tree classifiers perform a greedy search for rules by heuristically selecting the most promising features. Such greedy… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1984
Highly Cited
1984
This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for… (More)
Is this relevant?