Non-Obfuscated Unprovable Programs & Many Resultant Subtleties
The \emph{International Obfuscated C Code Contest} was a programming contest for the most creatively obfuscated yet succinct C code. By \emph{contrast}, an interest herein is in programs which are, \emph{in a sense}, \emph{easily} seen to be correct, but which can\emph{not} be proved correct in pre-...
Main Authors: | John Case, Michael Ralston |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2016-04-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1634/pdf |
Similar Items
-
EXPTIME Tableaux for the Coalgebraic mu-Calculus
by: Corina Cirstea, et al.
Published: (2011-08-01) -
First-Order and Temporal Logics for Nested Words
by: Rajeev Alur, et al.
Published: (2008-11-01) -
Logic Meets Algebra: the Case of Regular Languages
by: Pascal Tesson, et al.
Published: (2007-02-01) -
Modalities in homotopy type theory
by: Egbert Rijke, et al.
Published: (2020-01-01) -
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
by: Parosh Abdulla, et al.
Published: (2007-02-01)