Justification logic and audited computation

@article{Bavera2018JustificationLA,
  title={Justification logic and audited computation},
  author={Francisco Bavera and Eduardo Bonelli},
  journal={J. Log. Comput.},
  year={2018},
  volume={28},
  pages={909-934}
}
Justification Logic (JL) is a refinement of modal logic in which assertions of knowledge and belief are accompanied by justifications: the formula s A states that s is a ‘reason’ for knowing/believing A. We study the computational interpretation of JL via the Curry–Howard isomorphism in which the modality s A is interpreted as: s is a type derivation justifying the validity of A. The resulting lambda calculus is such that its terms are aware of the reduction sequence that gave rise to them… 

Figures from this paper

Rewrites as Terms through Justification Logic

A new propositions-as-types interpretation for Justification Logic is explored, based on the principle that terms of type are proof terms encoding reductions (with source s), which provides a logical language to reason about rewrites.

The first-order hypothetical logic of proofs

The Propositional Logic of Proofs (LP) is a modal logic in which the modality A is revisited as [[t]]A, t being an expression that bears witness to the validity of A. It enjoys arithmetical soundness

Explicit Auditing

This paper studies how to reduce terms more efficiently in an untyped variant of CAU by means of explicit substitutions and explicit auditing operations, finally deriving a call-by-value abstract machine.

A Curry-Howard View of Basic Justification Logic

This paper utilizes justification logic to axiomatize the notion of validity-under-interpretation and treats a "semantical" notion in a purely proof-theoretic manner and provides standard metatheoretic results.

Edinburgh Research Explorer Explicit Auditing

This paper studies how to reduce terms more efficiently in an untyped variant of CAU by means of explicit substitutions and explicit auditing operations, deriving a call-by-value abstract machine.

XX : 2 Strongly Normalizing Audited Computation

A new calculus λ is introduced that is simpler than λ, consistent, and strongly normalizing, and the proof of strong normalization is formalized in Nominal Isabelle.

Strongly Normalizing Audited Computation

A new calculus lambda^hc is introduced that is simpler than lambda^ hc, consistent, and strongly normalizing, and the proof of strong normalization is formalized in Nominal Isabelle.

Explorer Strongly Normalizing Audited Computation

A new calculus λ is introduced that is simpler than λ, consistent, and strongly normalizing, and the proof of strong normalization is formalized in Nominal Isabelle.

Correct Audit Logging in Concurrent Systems

Towards Concurrent Audit Logging in Microservices

This paper studies the deployment of an instrumentation tool based on this implementation model, aiming at microservices-based applications that are built by Java Spring framework, and instruments these applications according to a given logging specification, described in JSON.

References

SHOWING 1-10 OF 25 REFERENCES

Justification Logic and History Based Computation

The computational interpretation of JL is studied via the Curry-de Bruijn-Howard isomorphism in which the modality [t]A is interpreted as: t is a type derivation justifying the validity of A, such that its terms are aware of the reduction sequence that gave rise to them.

The Intensional Lambda Calculus

We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion ? A is replaced by [[s]]Awhose intended reading is "s is a proof of A". A

Hypothetical Logic of Proofs

The Hypothetical Logic of Proofs is developed, a reformulation of LP based on judgemental reasoning that enjoys arithmetical soundness and completeness and is capable of reflecting its own proofs.

A judgmental reconstruction of modal logic

This work reconsiders the foundations of modal logic, following Martin-Löf's methodology of distinguishing judgments from propositions, and gives a new presentation of lax logic, finding that the lax modality is already expressible using possibility and necessity.

On a Modal -calculus for S4 ?

It is shown that, with respect to provability, this formulation of a proof term calculus for the intuitionistic modal logic S4 is equivalent to other formulations in the literature, sketch a simple type checking algorithm, and prove subject reduction and the existence of canonical forms for well-typed terms.

Explicit provability and constructive semantics

This paper finds the logic LP of propositions and proofs and shows that Godel's provability calculus is nothing but the forgetful projection of LP, which achievesGodel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which resisted formalization since the early 1930s.

Operational Modal Logic

Modal logic S4, which was informally speciied by GG odel in 1933 as a logic for provability, meets its exact provability interpretation and is shown to be arithmetically complete with respect to the intended provability semantics.

Reflective lambda-Calculus

We introduce a general purpose typed ?-calculus ? ? which contains intuitionistic logic, is capable of internalizing its own derivations as ?-terms and yet enjoys strong normalization with respect to

Modal Proofs as Distributed Programs (Extended Abstract)

This work develops a new foundation for distributed programming languages by defining an intuitionistic, modal logic and then interpreting the modal proofs as distributed programs, and proves some simple meta-theoretic results about the logic.

Contextual modal type theory

The consequences of relativizing contextual modal logic and its type-theoretic analogue to explicitly specified contexts are investigated.