This action will delete this post on this instance and on all federated instances, and it cannot be undone. Are you certain you want to delete this post?
This action will delete this post on this instance and on all federated instances, and it cannot be undone. Are you certain you want to delete this post?
This action will block this actor and hide all of their past and future posts. Are you certain you want to block this actor?
This action will block this object. Are you certain you want to block this object?
Should I trust Adobe Acrobat or Latex?
For 12pt Latex article
\documentclass[12pt]{article} \usepackage{times}
This is what Adobe shows (11.96pt).
My student @MaxCamillo (of GDBFuzz fame) passed his PhD exam today and will henceforth be known as Dr. Eisele. Congratulations!
My student Björn Mathis passed his PhD exam today! In his work, he developed new methods for fuzzing and analyzing parsers, mining input grammars, and more: https://scholar.google.com/citations?user=ePl_ZAoAAAAJ&hl=en&oi=ao
My talk "How to Compare Fuzzers" at SAPLING'24 yesterday is available on line here #SoftwareEnginnering #MutationTesting #Fuzzing
I will be giving a talk at SAPLING'24 at ANU Canberra on comparing fuzzers. If you are at Canberra, please do drop in, and say Hi.
How is the participation in Activitpub vs Bluesky these days? Has Bluesky [actually won]? Any one has an insight into what is the status now?
"i'm going to regret asking, but does anyone have a *rigorous* definition of strong/weak typing as orthogonal to static/dynamic? specifically, if your explanation contains the term "type conversions", please explain what that means, especially in dynamically typed languages"
I wonder if a software testers perspective can help here. For me, a strong test suite is the one that finds most bugs. Assuming that the most significant source of error is simply mistyping the intended code while programming, we can leverage mutation analysis to estimate the strength of a test suite. That is, the strongest test suite is the one that identifies a difference between the original program, and the most number of mutants (one token variants), and the weakest one is the one that is unable to distinguish any variant from the original.
Transplanting that to type systems, I wonder if I can say: The strongest type is the type that eliminates (makes it impossible to represent) the most number of variants to the original program.