We describe a simple analysis for tracking properties such as may-aliasing, memory leaks, and disjointness for programs manipulating singly-linked lists. We restrict the set of programs we consider to ones that manipulate acyclic and unshared lists. We benefit from these restrictions in terms of simplicity and efficiency of the algorithm. We demonstrate that most common list-manipulating progra...

Magic tricks usually remain a mystery to the observer. For the sake of science, we offered participants the opportunity to discover the magician's secret method by repeatedly presenting the same trick and asking them to find out how the trick worked. In the context of insightful problem solving, the present work investigated the emotions that participants experience upon solving a magic trick. ...

Abstract Linial’s famous color reduction algorithm reduces a given m -coloring of graph with maximum degree $$\varDelta $$ ? to an $$O(\varDelta ^2\log m)$$ O ( 2 log m ) </m...

Recently, Dag Normann and the author have established a connection between higher-order computability theory and Nonstandard Analysis; new results in both fields are obtained by exploiting this connection ([28]). Now, on the side of computability theory, the technique known as Grilliot’s trick constitutes a template for explicitly defining the Turing jump functional (∃) in terms of a given effe...