We address the problem of preserving non-interference across compiler transformations
under speculative semantics. We develop a proof method that ensures the preservation …

Temporal logics for hyperproperties have recently emerged as an expressive specification
technique for relational properties of reactive systems. While the model checking problem for …

One successful approach to verifying programs is refinement, where one establishes that the
implementation (eg, in C) behaves as specified in its mathematical specification. In this …

Effectful programs can be given denotational semantics using expressive enough domains.
With applications to formally verified compilation in mind, I mechanise an axiomatization of …

Abstract This paper introduces Choice Trees (CTrees), a monad for modeling
nondeterministic, recursive, and impure programs in Coq. Inspired by **a et al.'s ITrees, this …

시스템 프로그래밍에서 포인터는 매우 중요한 요소이며, 정수-포인터 변환 (Integer-Pointer
Casting) 을 포함한 프로그램에 정형 검증을 적용하는 것은 중요한 과제이다. 정수-포인터 …

Abstract [BGMW20, BCE+23, BGG+20, Cou24, EDM23, GFV23, KEH23, Lem23, MZB24,
MFSV23, PWD24, YLY23, BCD22, CDG22, Cra19, FSSW22, FS22, JTD21, KMD+22 …