Substructural logic and partial correctness

Authors:
Dexter Kozen;Jerzy Tiuryn
Affiliations:
Cornell University, Ithaca, NY;Warsaw University, Warsaw, Poland
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2003

Citing 10
Cited 4

Linear logic

Theoretical Computer Science
Notes on logic and set theory

Notes on logic and set theory
Action logic and pure induction

JELIA '90 Proceedings of the European workshop on Logics in AI
Complete systems of B -rational identities

Theoretical Computer Science
On action algebras

Logic and information flow
Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
On Hoare logic and Kleene algebra with tests

ACM Transactions on Computational Logic (TOCL)
Dynamic Logic

Dynamic Logic
Kleene Algebra with Tests: Completeness and Decidability

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Automata on Guarded Strings and Applications

Automata on Guarded Strings and Applications

Dynamic Non-Commutative Logic

Journal of Logic, Language and Information
On the representation of kleene algebras with tests

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Sequential Dynamic Logic

Journal of Logic, Language and Information
Left-Handed completeness

RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formulate a noncommutative sequent calculus for partial correctness that subsumes propositional Hoare Logic. Partial correctness assertions are represented by intuitionistic linear implication. We prove soundness and completeness over relational and trace models. As a corollary, we obtain a complete sequent calculus for inclusion and equivalence of regular expressions.