article

Free access

Rooting UNITY

Authors:

R. Gerth,

A. PnueliAuthors Info & Claims

ACM SIGSOFT Software Engineering Notes, Volume 14, Issue 3

Pages 11 - 19

https://doi.org/10.1145/75200.75202

Published: 01 April 1989 Publication History

PDF eReader

References

[1]

R.J.R. BACK (1980), Correctness preserving program refinements: proof theory and applications, Mathematical Center Tracts, no. 131, Center for Mathematics and Computer Science (C'WI), Amsterdam.

Google Scholar

[2]

H. BARRINGER, R. KWIPER, A. PNUELI (1984), "Now You May Compose Temporal Logic Specifications", in Proceedings 16th Annual Symposium on Theory of Computing (STOC), pp. 51-64, ACM.

Digital Library

Google Scholar

[3]

K.M. CHANDY, J. MISRA (1988), P arallel Program Design, Addison-Wesley.

Digital Library

Google Scholar

[4]

E.W. DIJKSTRA (1976), A Discipline of Programming, Prentice-Hall.

Digital Library

Google Scholar

[5]

R.W. FLOYD (1976), "A:ssigning Meaning to Programs", in Proceedings Symposium in Applied Mathematics, Vol. 19, pp. 19-32, AMS.

Google Scholar

[6]

R. GERTH (1984), "Transition Logic", in Proceedings 16th Annual Symposium on Theory of Computing (STOC), pp. 39-51, ACM.

Digital Library

Google Scholar

[7]

D. HAREL (1980), On Folk Theorems, in Communications of the ACM, Vol. 23, No. 7.

Digital Library

Google Scholar

[8]

C.A.R. HOARE (1969), A.n Axiomatic Basis for computer programming, Communications of the ACM, Vol. 12, No. 10, pp. 576-580.

Digital Library

Google Scholar

[9]

B. JONSSON "Compositional Verification of Distributed Systems", Ph.D. dissertation, Uppsala University, Sweden.

Google Scholar

[10]

L. LAMPORT (1980), The "Hoare logic" of concurrent programs, Acta Informatica, Vol. 14, pp.21-37.

Digital Library

Google Scholar

[11]

G. MIRKOWSKA (1970), "Alg on 'th mic logic and its applications", Doctoral dissertation, University of Warsaw (in Polish).

Google Scholar

[12]

Z. MANNA, A. PNUELI (1983), "H ow to cook a temporal proof system for your pet language", in Proceedings 10th Annual Symposium on Principles of Programming Languages(POPL), ACM.

Digital Library

Google Scholar

[13]

K. WEIHRAUCH (1987), Computability, EATCS Monographs on Theoretical Computer Science, Vol. 9, Springer Verlag.

Digital Library

Google Scholar

[14]

J. WIDDOM (1987) "Trace-Based Network Proof Systems: Expressiveness and Completeness", Ph.D. dissertation, Cornell University.

Digital Library

Google Scholar

[15]

J. ZWIERS (1988), Compositionality, Concurrency and Partial Correctness: Proof theories for networks of processes and their connection, Ph.D. dissertation, University of Eindhoven, The Netherlands. To appear in the LNCS-series, Springer Verlag.

Digital Library

Google Scholar

Cited By

View all

Charpentier MFilali MMauran PPadiou GQuéinnec P(2005)Abstracting communication to reason about distributed algorithmsDistributed Algorithms10.1007/3-540-61769-8_7(89-104)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-61769-8_7
Brown NMokkedem A(2005)On mechanizing proofs within a complete proof system for UnityAlgebraic Methodology and Software Technology10.1007/3-540-60043-4_67(400-415)Online publication date: 25-Jul-2005
https://doi.org/10.1007/3-540-60043-4_67
Peled D(2004)Rob Tristan Gerth: 1956–2003Computer Aided Verification10.1007/978-3-540-27813-9_1(1-14)Online publication date: 2004
https://doi.org/10.1007/978-3-540-27813-9_1
Show More Cited By

Recommendations

Rooting Gene Trees via Phylogenetic Networks
Computing and Combinatorics
Abstract
Gene trees inferred from alignments of molecular sequences are usually unrooted. Since the root of a gene tree is often the desired property, one of the most classical problems in computational biology is gene tree rooting, where the goal is to ...
Phylogenetic network-assisted rooting of unrooted gene trees
Abstract
Gene trees inferred from molecular sequence alignments are typically unrooted, and determining the most credible rooting edge is a classical problem in computational biology. One approach to solve this problem is unrooted reconciliation, where the ...
Statistically Consistent Rooting of Species Trees Under the Multispecies Coalescent Model
Research in Computational Molecular Biology
Abstract
Rooted species trees are used in several downstream applications of phylogenetics. Most species tree estimation methods produce unrooted trees and additional methods are then used to root these unrooted trees. Recently, Quintet Rooting (QR) (...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSOFT Software Engineering Notes

ACM SIGSOFT Software Engineering Notes Volume 14, Issue 3

May 1989

288 pages

ISSN:0163-5948

DOI:10.1145/75200

Editor:
Sol J. Greenspan

Issue’s Table of Contents

IWSSD '89: Proceedings of the 5th international workshop on Software specification and design
April 1989
295 pages
ISBN:0897913051
DOI:10.1145/75199
Chairman:
Sol J. Greenspan

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1989

Published in SIGSOFT Volume 14, Issue 3

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
389
Total Downloads

Downloads (Last 12 months)142
Downloads (Last 6 weeks)30

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Charpentier MFilali MMauran PPadiou GQuéinnec P(2005)Abstracting communication to reason about distributed algorithmsDistributed Algorithms10.1007/3-540-61769-8_7(89-104)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-61769-8_7
Brown NMokkedem A(2005)On mechanizing proofs within a complete proof system for UnityAlgebraic Methodology and Software Technology10.1007/3-540-60043-4_67(400-415)Online publication date: 25-Jul-2005
https://doi.org/10.1007/3-540-60043-4_67
Peled D(2004)Rob Tristan Gerth: 1956–2003Computer Aided Verification10.1007/978-3-540-27813-9_1(1-14)Online publication date: 2004
https://doi.org/10.1007/978-3-540-27813-9_1
Goldschlag D(1999)A Mechanization of Unity in PC-NQTHM-92Journal of Automated Reasoning10.1023/A:100626260912723:3(445-498)Online publication date: 1-Nov-1999
https://dl.acm.org/doi/10.1023/A%3A1006262609127
Päppinghaus P(1995)On the logic of UNITYTheoretical Computer Science10.1016/0304-3975(94)00043-I139:1-2(27-67)Online publication date: Mar-1995
https://doi.org/10.1016/0304-3975(94)00043-I
Kindler E(1995)Invariants, composition, and substitutionActa Informatica10.1007/BF0117838132:4(299-312)Online publication date: Apr-1995
https://doi.org/10.1007/BF01178381
Stehr M(2008)Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types InterpretationFundamenta Informaticae10.5555/2365256.236525882:4(311-340)Online publication date: 1-Dec-2008
https://dl.acm.org/doi/10.5555/2365256.2365258
Stehr M(2008)Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types InterpretationFundamenta Informaticae10.5555/1366982.136698482:4(311-340)Online publication date: 1-Feb-2008
https://dl.acm.org/doi/10.5555/1366982.1366984
Dongol BGoldson D(2006)Extending the theory of Owicki and Gries with a logic of progressLogical Methods in Computer Science10.2168/LMCS-2(1:6)20062:1Online publication date: 10-Mar-2006
https://doi.org/10.2168/LMCS-2(1:6)2006
Sanders B(2005)On the UNITY design decisionsReasearch Directions in High-Level Parallel Programming Languages10.1007/3-540-55160-3_33(50-63)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-55160-3_33
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Rooting Gene Trees via Phylogenetic Networks

Phylogenetic network-assisted rooting of unrooted gene trees

Statistically Consistent Rooting of Species Trees Under the Multispecies Coalescent Model