Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Substructural logic and partial correctness

Substructural logic and partial correctness 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Substructural logic and partial correctness

Loading next page...
 
/lp/association-for-computing-machinery/substructural-logic-and-partial-correctness-IMPFbn6cq7

References (38)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2003 by ACM Inc.
ISSN
1529-3785
DOI
10.1145/772062.772066
Publisher site
See Article on Publisher Site

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.

Journal

ACM Transactions on Computational Logic (TOCL)Association for Computing Machinery

Published: Jul 1, 2003

There are no references for this article.