Charanjit S. Jutla
Skip Abstract Section
Abstract
Abstract
We propose a methodology for designing sound and complete proof systems for proving progress properties of parallel programs under various fairness assumptions. Our methodology begins with a branching time temporal logic formula (CTL*) formula that expresses progress under a fairness assumption. The next step obtains an equivalent fixpoint characterization of this CTL* formula in theμ-calculus. The final step uses the fixpoint characterizations to extract proof systems for proving progress under the fairness constraint. The methodology guarantees that the proof rules so obtained are sound and relatively complete in the sense of Cook.
- [ApP86] Countable nondeterminism and random assignmentJournal of the ACM1986334724767Google Scholar
Digital Library
- [APS84] Fair termination revisited with delayTheoretical Computer Science1984336584Google ScholarCross Ref
- [Apt81] Ten years of Hoare logic — part 1ACM Transactions on Programming Languages and Systems198134431483Google ScholarDigital Library
- [AlS85] Defining livenessInf. Process. Lett.1985244181185Google Scholar
- [ChM88] Parallel Program Design: A Foundation1988Reading, MassachusettsAddisonWesleyGoogle Scholar
- [Coo78] Soundness and completeness of an axiom system for program verificationSIAM Journal of Computing1978717090Google ScholarDigital Library
- [Dij75] Guarded commands, nondeterminacy and the formal derivation of programsCommun. of the ACM1975188453457Google ScholarDigital Library
- [DiS90] Predicate Calculus and Program Semantics1990New YorkSpringerVerlagGoogle ScholarCross Ref
- [EmC81] Characterizing correctness properties of parallel programs using fixpointsLecture Notes in Computer Science 85: Proceedings of the Seventh ICALP1981New YorkSpringer-VerlagGoogle Scholar
- [EmL85] Allen Emerson, E. and Lei, D. L.: Modalities for model checking: Branching time strikes back. InProceedings of the 12th Annual ACM Symposium on the Principles of Programming Languages, New Orleans, LA, January 1985.Google Scholar
- [EmL86] Allen Emerson, E. and Lei, D. L.: Model-checking in the propositionalμ-calculus. InProceedings of the Fist Annual IEEE Symposium on Logic in Computer Science, 1986.Google Scholar
- [Flo67] Assigning meanings to programsProceedings of the American Mathematical Society's Symposia in Applied Mathematics1967191931Google ScholarCross Ref
- [Fra86] Fairness1986New YorkSpringer-VerlagGoogle Scholar
- [GFM81] Grumberg, O., Francez, N., Makowsky, J. A. and De Roever, W-P.: A proof rule for the fair termination of guarded commands. InProceedings of the International Symposium on Algorithmic Languages, Amsterdam, The Netherlands, October 1981.Google Scholar
- [GPS80] Gabbay, D., Pnueli, A., Shelah, S. and Stavi, J.: On the temporal analysis of fairness. InProceedings of the Seventh Annual ACM Symposium on the Principles of Programming Languages, Las Vegas, Nevada, January 1980.Google Scholar
- [Hoa69] An axiomatic basis for computer programmingCommunications of the ACM19691210576580Google ScholarDigital Library
- [HoU79] Hopcroft, J. E. and Ullman, J. D.:Intoduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.Google Scholar
- [JKR89] Jutla, C. S., Knapp, E. and Rao, J. R.: A predicate transformer approach to the semantics of parallel programs. InProceedings of the Eighth Annual ACM Symposium on the Principles of Distributed Computing, pages 249–263, 1989.Google Scholar
- [JuR92] On a fixpoint semantics and the design of proof rules for fair parallel programsTechnical Report TR-92-231992AustinThe University of TexasGoogle Scholar
- [Kel76] Formal verification of parallel programsCommunications of the ACM1976197371384Google ScholarDigital Library
- [Kna88] A comparison of theled-from andleads-toTechnical Report TR-88-351988AustinThe University of TexasGoogle Scholar
- [Koz82] Results on the propositional mu-calculusLecture Notes in Computer Science 140: Proceedings of the Ninth ICALP1982New YorkSpringer-Verlag348359Google Scholar
- [Lam77] Proving the correctness of multiprocess programsIEEE Transactions on Software Engineering197732125143Google ScholarDigital Library
- [LPS81] Impartiality, justice and fairness: The ethics of concurrent terminationLecture Notes in Computer Science 115: Proceedings of the Eighth ICALP1981New YorkSpringer-VerlagGoogle Scholar
- [MaP83] Manna, Z. and Pnueli, A.: How to cook a temporal proof system for your pet language. InProceedings of the Tenth Annual ACM Symposium on the Principles of Programming Languages, pages 141–154, 1983.Google Scholar
- [MaP84] Adequate proof principles for invariance and liveness properties of concurrent programsScience of Computer Programming19844257289Google ScholarDigital Library
- [Niw88] Niwinski, D.: Fixed points versus infinite generation. InProceedings of the Third Annual IEEE Symposium on Logic in Computer Science, pages 402–409, 1988.Google Scholar
- [OwG76a] An axiomatic proof technique for parallel programsActa Informatica19765319339Google Scholar
- [OwG76b] Verifying properties of parallel programs: An axiomatic approachCommunications of the ACM1976195279286Google ScholarDigital Library
- [OwL82] Proving liveness properties of concurrent programsACM Transactions on Programming Languages and Systems198243455495Google ScholarDigital Library
- [Pac90] Pachl, J.: Three definitions ofleads-to for unity. Notes on UNITY 23-90, 1990.Google Scholar
- [Par80] Park, D.: On the semantics of fair parallelism. In D. Biorner, editor,Lecture Notes in Computer Science 86: Proceedings of the Winter School on Formal Software Specification. Springer-Verlag, 1980.Google Scholar
- [Par81] A predicate transformer for weak fair iterationProceedings of the Sixth IBM Symposium on Mathematical Foundations of Computer Science (Hakone)1981New YorkIBMGoogle Scholar
- [Pnu83] On the extremely fair treatment of probabilistic algorithms1983New YorkACM278290Google Scholar
- [QuS83] Fairness and related properties in transition systems — a temporal logic to deal with fairnessActa Informatica198319195220Google ScholarDigital Library
- [Rao95] Rao, J. R.:Extensions of the UNITY Methodology: Compositionality, Fairness And Probability In Parallelism, volume 908 ofLecture Notes in Computer Science. Springer-Verlag, 1995.Google Scholar
- [Ros82] Rosenstein, J. G.:Linear Orderings. Academic Press, 1982.Google Scholar
- [SdR89] Theμ-calculus as an assertion language for fairness argumentsInformation and Computation1989823278322Google ScholarDigital Library
- [Wal93] Walukiewicz, I.: On completeness of theμ-calculus. InProceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, 1993.Google Scholar
- [Wan78] A new incompleteness result for Hoare's systemJournal of the ACM1978251168175Google ScholarDigital Library
Index Terms
- A methodology for designing proof rules for fair parallel programs
Index terms have been assigned to the content through auto-classification.
Recommendations
Strong equivalence of logic programs under the infinite-valued semantics
We consider the notion of strong equivalence [V. Lifschitz, D. Pearce, A. Valverde, Strongly equivalent logic programs, ACM Transactions on Computational Logic 2 (4) (2001) 526-541] of normal propositional logic programs under the infinite-valued ...
Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory
Automated Reasoning with Analytic Tableaux and Related MethodsAbstractLogics based on the -calculus are used to model inductive and coinductive reasoning and to verify reactive systems. A well-structured proof-theory is needed in order to apply such logics to the study of programming languages with (co)inductive ...
A complete proof system for propositional projection temporal logic
The paper presents a proof system for Propositional Projection Temporal Logic (PPTL) with projection-plus. The syntax, semantics, and logical laws of PPTL are introduced together with an axiom system consisting of axioms and inference rules. To ...
Comments