8,686 research outputs found
Program logics for homogeneous meta-programming.
A meta-program is a program that generates or manipulates another program; in homogeneous meta-programming, a program may generate new parts of, or manipulate, itself. Meta-programming has been used extensively since macros
were introduced to Lisp, yet we have little idea how formally to reason about metaprograms. This paper provides the first program logics for homogeneous metaprogramming
â using a variant of MiniMLe by Davies and Pfenning as underlying meta-programming language.We show the applicability of our approach by reasoning about example meta-programs from the literature. We also demonstrate that our logics are relatively complete in the sense of Cook, enable the inductive derivation of characteristic formulae, and exactly capture the observational properties induced by the operational semantics
Fifty years of Hoare's Logic
We present a history of Hoare's logic.Comment: 79 pages. To appear in Formal Aspects of Computin
Hilbert-Post completeness for the state and the exception effects
In this paper, we present a novel framework for studying the syntactic
completeness of computational effects and we apply it to the exception effect.
When applied to the states effect, our framework can be seen as a
generalization of Pretnar's work on this subject. We first introduce a relative
notion of Hilbert-Post completeness, well-suited to the composition of effects.
Then we prove that the exception effect is relatively Hilbert-Post complete, as
well as the "core" language which may be used for implementing it; these proofs
have been formalized and checked with the proof assistant Coq.Comment: Siegfried Rump (Hamburg University of Technology), Chee Yap (Courant
Institute, NYU). Sixth International Conference on Mathematical Aspects of
Computer and Information Sciences , Nov 2015, Berlin, Germany. 2015, LNC
A General Framework for Sound and Complete Floyd-Hoare Logics
This paper presents an abstraction of Hoare logic to traced symmetric
monoidal categories, a very general framework for the theory of systems. Our
abstraction is based on a traced monoidal functor from an arbitrary traced
monoidal category into the category of pre-orders and monotone relations. We
give several examples of how our theory generalises usual Hoare logics (partial
correctness of while programs, partial correctness of pointer programs), and
provide some case studies on how it can be used to develop new Hoare logics
(run-time analysis of while programs and stream circuits).Comment: 27 page
- âŠ