Analyzing energy friendly steady state phases of dynamic application execution in terms of sparse data structures. - Edgar G. Daylight; Sven Wuytack; Chantal Ykman-Couvreur; Francky Catthoor (ISLPED, 2002)

Incorporating energy efficient data structures into modular software implementations for internet-based embedded systems. - Edgar G. Daylight; T. Fermentel; Chantal Ykman-Couvreur; Francky Catthoor (Workshop on Software and Performance, 2002)

Formally Specifying Dynamic Data Structures for Embedded Software Design: an Initial Approach. - Edgar G. Daylight; Bart Demoen; Francky Catthoor (FESCA@ETAPS, 2004)

Memory-access-aware data structure transformations for embedded software with dynamic data accesses. - Edgar G. Daylight; David Atienza; Arnout Vandecappelle; Francky Catthoor; José M. Mendías (IEEE Trans. Very Large Scale Integr. Syst., 2004)

Moving Up to the Modeling Level for the Transformation of Data Structures in Embedded Multimedia Applications. - Marijn Temmerman; Edgar G. Daylight; Francky Catthoor; Serge Demeyer; Tom Dhaene (SAMOS, 2005)

Local Causal Reasoning of a Safety-Critical Subway System. - Edgar G. Daylight; Sandeep K. Shukla (MEMOCODE, 2007)

Optimizing data structures at the modeling level in embedded multimedia. - Marijn Temmerman; Edgar G. Daylight; Francky Catthoor; Serge Demeyer; Tom Dhaene (J. Syst. Archit., 2007)

On Time-Bounded Incompressibility of Compressible Strings - Edgar G. Daylight; Wouter M. Koolen; Paul M. B. Vitányi (CoRR, 2008)

The formalism underlying EASYMAP. - Edgar G. Daylight; Arnout Vandecappelle; Francky Catthoor (Sci. Comput. Program., 2008)

On the Difficulties of Concurrent-System Design, Illustrated with a 2×2 Switch Case Study. - Edgar G. Daylight; Sandeep K. Shukla (FM, 2009)

Expressing the Behavior of Three Very Different Concurrent Systems by Using Natural Extensions of Separation Logic - Edgar G. Daylight; Sandeep K. Shukla; Davide Sergio (EXPRESS, 2009)

Time-bounded incompressibility of compressible strings and sequences. - Edgar G. Daylight; Wouter M. Koolen; Paul M. B. Vitányi (Inf. Process. Lett., 2009)

Dijkstra's Rallying Cry for Generalization: The Advent of the Recursive Procedure, Late 1950s-Early 1960s. - Edgar G. Daylight (Comput. J., 2011)

Turing's Influence on Programming. - Edgar G. Daylight (Turing-100, 2012)

Universality versus Locality: The Amsterdam Style of Algol Implementation. - Gerard Alberts; Edgar G. Daylight (IEEE Ann. Hist. Comput., 2014)

A Turing tale. - Edgar G. Daylight (Commun. ACM, 2014)

Why did computer science make a hero out of Turing? - Maarten Bullynck; Edgar G. Daylight; Liesbeth De Mol (Commun. ACM, 2015)

From mathematical logic to programming-language semantics: a discussion with Tony Hoare. - Edgar G. Daylight (J. Log. Comput., 2015)

Less Is More in the Fifties: Encounters between Logical Minimalism and Computer Design during the 1950s. - Liesbeth De Mol; Maarten Bullynck; Edgar G. Daylight (IEEE Ann. Hist. Comput., 2018)

Addressing the Question "What is a Program Text?" via Turing Scholarship. - Edgar G. Daylight (IEEE Ann. Hist. Comput., 2021)

The halting problem and security's language-theoretic approach: Praise and criticism from a technical historian. - Edgar G. Daylight (Comput., 2021)

True Turing: A Bird's-Eye View. - Edgar G. Daylight (Minds Mach., 2024)