default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarroll Morgan
Carroll C. Morgan
Person information
- affiliation: University of New South Wales, Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j44]Brijesh Dongol
, Catherine Dubois, Stefan Hallerstede, Eric C. R. Hehner, Carroll Morgan, Peter Müller, Leila Ribeiro, Alexandra Silva, Graeme Smith, Erik P. de Vink:
On Formal Methods Thinking in Computer Science Education. Formal Aspects Comput. 37(1): 8:1-8:23 (2025)- 2024
- [c57]Chris Chen, Annabelle McIver, Carroll Morgan:
Source-Level Reasoning for Quantifying Information Leaks. Principles of Verification (1) 2024: 98-127 - [c56]Chris Chen, Annabelle McIver, Carroll Morgan:
Probabilistic Datatypes. ICTAC 2024: 3-16 - [i14]Chris Chen, Annabelle McIver, Carroll Morgan:
Source-level reasoning for quantitative information flow. CoRR abs/2405.13416 (2024) - 2023
- [c55]Mário S. Alvim, Natasha Fernandes, Annabelle McIver, Carroll Morgan, Gabriel Henrique Nunes:
A Novel Analysis of Utility in Privacy Pipelines, Using Kronecker Products and Quantitative Information Flow. CCS 2023: 1718-1731 - [i13]Mário S. Alvim, Natasha Fernandes, Annabelle McIver, Carroll Morgan, Gabriel Henrique Nunes:
A novel analysis of utility in privacy pipelines, using Kronecker products and quantitative information flow. CoRR abs/2308.11110 (2023) - 2022
- [j43]Mário S. Alvim, Natasha Fernandes, Annabelle McIver, Carroll Morgan, Gabriel Henrique Nunes:
Flexible and scalable privacy assessment for very large datasets, with an application to official governmental microdata. Proc. Priv. Enhancing Technol. 2022(4): 378-399 (2022) - [c54]Natasha Fernandes, Annabelle McIver, Carroll Morgan:
How to Develop an Intuition for Risk... and Other Invisible Phenomena (Invited Talk). CSL 2022: 2:1-2:14 - [i12]Mário S. Alvim, Natasha Fernandes, Annabelle McIver, Carroll Morgan, Gabriel Henrique Nunes:
Flexible and scalable privacy assessment for very large datasets, with an application to official governmental microdata. CoRR abs/2204.13734 (2022) - 2021
- [c53]Natasha Fernandes, Annabelle McIver, Carroll Morgan:
The Laplace Mechanism has optimal utility for differential privacy over continuous queries. LICS 2021: 1-12 - [p3]Richard S. Bird, Jeremy Gibbons, Ralf Hinze, Peter Höfner, Johan Jeuring, Lambert G. L. T. Meertens, Bernhard Möller, Carroll Morgan, Tom Schrijvers, Wouter Swierstra, Nicolas Wu:
Algorithmics. IFIP's Exciting First 60+ Years 2021: 59-98 - [i11]Natasha Fernandes, Annabelle McIver, Carroll Morgan:
The Laplace Mechanism has optimal utility for differential privacy over continuous queries. CoRR abs/2105.07176 (2021) - 2020
- [b4]Mário S. Alvim, Konstantinos Chatzikokolakis, Annabelle McIver, Carroll Morgan, Catuscia Palamidessi, Geoffrey Smith:
The Science of Quantitative Information Flow. Information Security and Cryptography, Springer 2020, ISBN 978-3-319-96129-3, pp. I-XXVIII, 1-478 - [j42]Peter Höfner, Carroll Morgan, Vaughan R. Pratt:
Preface. Acta Informatica 57(3-5): 305-311 (2020) - [c52]Annabelle McIver, Carroll Morgan:
Correctness by Construction for Probabilistic Programs. ISoLA (1) 2020: 216-239 - [p2]Jeremy Gibbons, Annabelle McIver, Carroll Morgan, Tom Schrijvers:
Quantitative Information Flow with Monads in Haskell. Foundations of Probabilistic Programming 2020: 391-448 - [i10]Annabelle McIver, Carroll Morgan:
Correctness by construction for probabilistic programs. CoRR abs/2007.15246 (2020)
2010 – 2019
- 2019
- [j41]A. K. McIver, Carroll C. Morgan, T. M. Rabehaja:
Program algebra for quantitative information flow. J. Log. Algebraic Methods Program. 106: 55-77 (2019) - [j40]Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja:
Abstract Hidden Markov Models: a monadic account of quantitative information flow. Log. Methods Comput. Sci. 15(1) (2019) - [j39]Mário S. Alvim, Konstantinos Chatzikokolakis, Annabelle McIver, Carroll Morgan, Catuscia Palamidessi, Geoffrey Smith:
An axiomatization of information flow measures. Theor. Comput. Sci. 777: 32-54 (2019) - [c51]Annabelle McIver, Carroll Morgan:
Proving that Programs Are Differentially Private. APLAS 2019: 3-18 - [c50]Tahiry M. Rabehaja, Annabelle McIver, Carroll Morgan, Georg Struth:
Categorical Information Flow. The Art of Modelling Computational Systems 2019: 329-343 - 2018
- [j38]Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen:
A new proof rule for almost-sure termination. Proc. ACM Program. Lang. 2(POPL): 33:1-33:28 (2018) - 2017
- [j37]Annabelle McIver, Tahiry M. Rabehaja, Roland Wen, Carroll Morgan:
Privacy in elections: How small is "small"? J. Inf. Secur. Appl. 36: 112-126 (2017) - [c49]Annabelle McIver, Carroll C. Morgan, Tahiry M. Rabehaja:
Algebra for Quantitative Information Flow. RAMiCS 2017: 3-23 - [c48]Carroll Morgan:
A Demonic Lattice of Information. Concurrency, Security, and Puzzles 2017: 203-222 - [c47]Nicolás E. Bordenabe, Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja:
Reasoning About Distributed Secrets. FORTE 2017: 156-170 - [i9]Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja:
Abstract Hidden Markov Models: a monadic account of quantitative information flow. CoRR abs/1708.01688 (2017) - [i8]Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen:
A New Proof Rule for Almost-Sure Termination. CoRR abs/1711.03588 (2017) - 2016
- [c46]Mário S. Alvim, Konstantinos Chatzikokolakis, Annabelle McIver, Carroll Morgan, Catuscia Palamidessi, Geoffrey Smith:
Axioms for Information Leakage. CSF 2016: 77-92 - [c45]June Andronick, Corey Lewis, Daniel Matichuk, Carroll Morgan, Christine Rizkallah:
Proof of OS Scheduling Behavior in the Presence of Interrupt-Induced Concurrency. ITP 2016: 52-68 - [i7]Nicolás E. Bordenabe, Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja:
Compositional security and collateral leakage. CoRR abs/1604.04983 (2016) - [i6]Annabelle McIver, Carroll Morgan:
A new rule for almost-certain termination of probabilistic and demonic programs. CoRR abs/1612.01091 (2016) - 2015
- [j36]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
Hidden-Markov program algebra with iteration. Math. Struct. Comput. Sci. 25(2): 320-360 (2015) - [c44]Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja:
Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow. LICS 2015: 597-608 - [c43]June Andronick, Corey Lewis, Carroll Morgan:
Controlled Owicki-Gries Concurrency: Reasoning about the Preemptible eChronos Embedded Operating System. MARS 2015: 10-24 - 2014
- [j35]Thai Son Hoang, A. K. McIver, Larissa Meinicke, Carroll C. Morgan, Anthony Sloane, E. Susatyo:
Abstractions of non-interference security: probabilistic versus possibilistic. Formal Aspects Comput. 26(1): 169-194 (2014) - [j34]Carroll Morgan:
An old new notation for elementary probability theory. Sci. Comput. Program. 85: 115-136 (2014) - [j33]Adenilso da Silva Simão, Carroll Morgan:
Selected papers from the Brazilian Symposium on Formal Methods (SBMF 2011). Sci. Comput. Program. 92: 85 (2014) - [j32]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Real-reward testing for probabilistic processes. Theor. Comput. Sci. 538: 16-36 (2014) - [c42]Mário S. Alvim, Konstantinos Chatzikokolakis, Annabelle McIver, Carroll Morgan, Catuscia Palamidessi, Geoffrey Smith:
Additive and Multiplicative Notions of Leakage, and Their Capacities. CSF 2014: 308-322 - [c41]Roland Wen, Annabelle McIver, Carroll Morgan:
Towards a Formal Analysis of Information Leakage for Signature Attacks in Preferential Elections. FM 2014: 595-610 - [c40]Annabelle McIver, Carroll Morgan, Geoffrey Smith, Barbara Espinoza, Larissa Meinicke:
Abstract Channels and Their Robust Information-Leakage Ordering. POST 2014: 83-102 - [c39]Carroll Morgan:
(In-)Formal Methods: The Lost Art - A Users' Manual. SETSS 2014: 1-79 - 2013
- [c38]Carroll C. Morgan:
Lattices of Information for Security: Deterministic, Demonic, Probabilistic. ICFEM 2013: 1-3 - 2012
- [j31]Carroll Morgan:
Compositional noninterference from first principles. Formal Aspects Comput. 24(1): 3-26 (2012) - [c37]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism. LICS 2012: 461-470 - [c36]Carroll Morgan:
Elementary Probability Theory in the Eindhoven Style. MPC 2012: 48-73 - [i5]Jin Song Dong, Annabelle McIver, Carroll Morgan:
Quantitative methods in security and safety critical applications (NII Shonan Meeting 2012-10). NII Shonan Meet. Rep. 2012 (2012) - 2011
- [j30]A. K. McIver, Carroll C. Morgan:
Compositional refinement in agent-based security protocols. Formal Aspects Comput. 23(6): 711-737 (2011) - [c35]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Real-Reward Testing for Probabilistic Processes (Extended Abstract). QAPL 2011: 61-73 - [e4]Adenilso da Silva Simão, Carroll Morgan:
Formal Methods, Foundations and Applications - 14th Brazilian Symposium, SBMF 2011, São Paulo, Brazil, September 26-30, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7021, Springer 2011, ISBN 978-3-642-25031-6 [contents] - [i4]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
Hidden-Markov Program Algebra with iteration. CoRR abs/1102.0333 (2011) - 2010
- [c34]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
Compositional Closure for Bayes Risk in Probabilistic Noninterference. ICALP (2) 2010: 223-235 - [c33]Joost-Pieter Katoen, Annabelle McIver, Larissa Meinicke, Carroll C. Morgan:
Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods. SAS 2010: 390-406 - [p1]A. K. McIver, Carroll C. Morgan:
The Thousand-and-One Cryptographers. Reflections on the Work of C. A. R. Hoare 2010: 255-282 - [i3]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
Compositional closure for Bayes Risk in probabilistic noninterference. CoRR abs/1007.1054 (2010)
2000 – 2009
- 2009
- [j29]Carroll Morgan:
The Shadow Knows: Refinement and security in sequential programs. Sci. Comput. Program. 74(8): 629-653 (2009) - [c32]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Testing Finitary Probabilistic Processes. CONCUR 2009: 274-288 - [c31]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
Security, Probability and Nearly Fair Coins in the Cryptographers' Café. FM 2009: 41-71 - [c30]Annabelle McIver, Carroll C. Morgan:
Sums and Lovers: Case Studies in Security, Compositionality and Refinement. FM 2009: 289-304 - [c29]Carroll Morgan:
How to Brew-up a Refinement Ordering. REFINE@FMWeek 2009: 123-141 - [e3]Martin Leucker, Carroll Morgan:
Theoretical Aspects of Computing - ICTAC 2009, 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009. Proceedings. Lecture Notes in Computer Science 5684, Springer 2009, ISBN 978-3-642-03465-7 [contents] - [e2]Suzana Andova, Annabelle McIver, Pedro R. D'Argenio, Pieter J. L. Cuijpers, Jasen Markovski, Carroll Morgan, Manuel Núñez:
Proceedings First Workshop on Quantitative Formal Methods: Theory and Applications, QFM 2009, Eindhoven, The Netherlands, 3rd November 2009. EPTCS 13, 2009 [contents] - 2008
- [j28]A. K. McIver, Carlos Gonzalía, Ernie Cohen, Carroll C. Morgan:
Using probabilistic Kleene algebra pKA for protocol verification. J. Log. Algebraic Methods Program. 76(1): 90-111 (2008) - [j27]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Characterising Testing Preorders for Finite Probabilistic Processes. Log. Methods Comput. Sci. 4(4) (2008) - [c28]A. K. McIver, Carroll C. Morgan, Carlos Gonzalía:
Proofs and Refutations for Probabilistic Refinement. FM 2008: 100-115 - [i2]Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan:
Characterising Testing Preorders for Finite Probabilistic Processes. CoRR abs/0810.3708 (2008) - 2007
- [j26]Annabelle McIver, Carroll Morgan:
Results on the quantitative µ-calculus qMµ. ACM Trans. Comput. Log. 8(1): 3 (2007) - [c27]Yuxin Deng, Rob J. van Glabbeek, Carroll Morgan, Chenyi Zhang:
Scalar Outcomes Suffice for Finitary Probabilistic Testing. ESOP 2007: 363-378 - [c26]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang:
Characterising Testing Preorders for Finite Probabilistic Processes. LICS 2007: 313-325 - [c25]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang:
Remarks on Testing Probabilistic Processes. Computation, Meaning, and Logic 2007: 359-397 - 2006
- [c24]Annabelle McIver, Ernie Cohen, Carroll Morgan:
Using Probabilistic Kleene Algebra for Protocol Verification. RelMiCS 2006: 296-310 - [c23]Carroll Morgan:
The Shadow Knows: Refinement of Ignorance in Sequential Programs. MPC 2006: 359-378 - [c22]Carroll Morgan, Annabelle McIver:
Programming-Logic Analysis of Fault Tolerance: Expected Performance of Self-stabilisation. RODIN Book 2006: 288-305 - 2005
- [b3]Annabelle McIver, Carroll Morgan:
Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science, Springer 2005, ISBN 978-0-387-40115-7, pp. 1-310 - [j25]Annabelle McIver, Carroll Morgan:
An elementary proof that Herman's Ring is Theta (N2). Inf. Process. Lett. 94(2): 79-84 (2005) - [j24]Annabelle McIver, Carroll Morgan:
Abstraction and refinement in probabilistic systems. SIGMETRICS Perform. Evaluation Rev. 32(4): 41-47 (2005) - [j23]Joe Hurd, Annabelle McIver, Carroll Morgan:
Probabilistic guarded commands mechanized in HOL. Theor. Comput. Sci. 346(1): 96-112 (2005) - [c21]Carroll Morgan, Thai Son Hoang, Jean-Raymond Abrial:
The Challenge of Probabilistic Event B - Extended Abstract. ZB 2005: 162-171 - [c20]Thai Son Hoang, Zhendong Jin, Ken Robinson, Annabelle McIver, Carroll Morgan:
Development via Refinement in Probabilistic B - Foundation and Case Study. ZB 2005: 355-373 - [c19]Annabelle McIver, Carroll Morgan:
A Novel Stochastic Game Via the Quantitative mu-calculus. QAPL 2005: 195-212 - 2004
- [c18]Carroll Morgan:
Of Probabilistic Wp and SP-and Compositionality. 25 Years Communicating Sequential Processes 2004: 220-241 - [c17]Jifeng He, Carroll Morgan, Annabelle McIver:
Deriving Probabilistic Semantics Via the 'Weakest Completion'. ICFEM 2004: 131-145 - [c16]Annabelle McIver, Carroll Morgan:
Developing and Reasoning About Probabilistic Programs in pGCL. PSSE 2004: 123-155 - [c15]Carroll Morgan, Annabelle McIver:
Memoryless Strategies for Stochastic Games via Domain Theory. SBMF 2004: 23-37 - [c14]Joe Hurd, Annabelle McIver, Carroll Morgan:
Probabilistic Guarded Commands Mechanized in HOL. QAPL 2004: 95-111 - 2003
- [j22]Annabelle McIver, Carroll Morgan:
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL. Theor. Comput. Sci. 293(3): 507-534 (2003) - [c13]Annabelle McIver, Carroll Morgan, Thai Son Hoang:
Probabilistic Termination in B. ZB 2003: 216-239 - [c12]Thai Son Hoang, Zhendong Jin, Ken Robinson, Annabelle McIver, Carroll Morgan:
Probabilistic Invariants for Probabilistic Machines. ZB 2003: 240-259 - [i1]Annabelle McIver, Carroll Morgan:
Results on the quantitative mu-calculus qMu. CoRR cs.LO/0309024 (2003) - 2002
- [c11]Annabelle McIver, Carroll Morgan:
Games, Probability and the Quantitative µ-Calculus qMµ. LPAR 2002: 292-310 - 2001
- [j21]Annabelle McIver, Carroll Morgan:
Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Informatica 37(4/5): 329-354 (2001) - [j20]Annabelle McIver, Carroll Morgan:
Partial correctness for probabilistic demonic programs. Theor. Comput. Sci. 266(1-2): 513-541 (2001) - [c10]Carroll Morgan, Annabelle McIver:
Cost Analysis of Games, Using Program Logic. APSEC 2001: 351- - [c9]Annabelle McIver, Carroll Morgan:
Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL. CATS 2001: 12-40 - 2000
- [c8]Steve King, Carroll Morgan:
An Iterator Construct for the Refinement Calculus. IWFM 2000
1990 – 1999
- 1999
- [j19]Carroll Morgan, Annabelle McIver:
An Expectation-Transformer Model for Probabilistic Temporal Logic. Log. J. IGPL 7(6): 779-804 (1999) - 1998
- [c7]Carroll Morgan:
The Generalised Substitution Language Extended to Probabilistic Programs. B 1998: 9-25 - 1996
- [j18]Carroll Morgan, Annabelle McIver, Karen Seidel, Jeff W. Sanders:
Refinement-Oriented Probability for CSP. Formal Aspects Comput. 8(6): 617-647 (1996) - [j17]Carroll Morgan, Annabelle McIver:
Unifying wp and wlp. Inf. Process. Lett. 59(3): 159-163 (1996) - [j16]Carroll Morgan, Annabelle McIver, Karen Seidel:
Probabilistic Predicate Transformers. ACM Trans. Program. Lang. Syst. 18(3): 325-353 (1996) - 1995
- [j15]Michael J. Butler, Carroll Morgan:
Action Systemes, Unbounded Nondeterminism, and Infinite Traces. Formal Aspects Comput. 7(1): 37-53 (1995) - [j14]Steve King, Carroll Morgan:
Exits in the Refinement Calculus. Formal Aspects Comput. 7(1): 54-76 (1995) - 1994
- [b2]Carroll Morgan:
Programming from specifications, 2nd Edition. Prentice Hall International series in computer science, Prentice Hall 1994, ISBN 978-0-13-123274-7, pp. I-XV, 1-332 - [j13]Carroll Morgan:
Foreword: Special Issue on Mathematics of Program Construction. Sci. Comput. Program. 22(1-2): 1-2 (1994) - 1993
- [j12]Paul H. B. Gardiner, Carroll Morgan:
A Single Complete Rule for Data Refinement. Formal Aspects Comput. 5(4): 367-382 (1993) - [c6]Carroll Morgan:
The Refinement Calculus, and Literate Development. Formal Program Development 1993: 161-182 - [e1]Richard S. Bird, Carroll Morgan, Jim Woodcock:
Mathematics of Program Construction, Second International Conference, Oxford, UK, June 29 - July 3, 1992, Proceedings. Lecture Notes in Computer Science 669, Springer 1993, ISBN 3-540-56625-2 [contents] - 1992
- [c5]Carroll Morgan:
The Refinement Calculus. NATO ASI PDC 1992: 3-52 - 1991
- [j11]Paul H. B. Gardiner, Carroll Morgan:
Data Refinement of Predicate Transformers. Theor. Comput. Sci. 87(1): 143-162 (1991) - 1990
- [b1]Carroll Morgan:
Programming from specifications. Prentice Hall International Series in computer science, Prentice Hall 1990, ISBN 978-0-13-726233-5, pp. I-XI, 1-255 - [j10]Carroll Morgan, Paul H. B. Gardiner:
Data Refinement by Calculation. Acta Informatica 27(6): 481-503 (1990) - [j9]Carroll Morgan, Trevor Vickers:
Types and Invariants in the Refinement Calculus. Sci. Comput. Program. 14(2-3): 281-304 (1990) - [c4]Jim Woodcock, Carroll Morgan:
Refinement of State-Based Concurrent Systems. VDM Europe 1990: 340-351
1980 – 1989
- 1989
- [c3]Carroll Morgan:
Types and Invariants in the Refinement Calculus. MPC 1989: 363-378 - 1988
- [j8]Carroll Morgan:
Data Refinement by Miracles. Inf. Process. Lett. 26(5): 243-246 (1988) - [j7]Carroll Morgan:
Auxiliary Variables in Data Refinement. Inf. Process. Lett. 29(6): 293-296 (1988) - [j6]Carroll Morgan:
Procedures, parameters, and abstraction: Separate concerns. Sci. Comput. Program. 11(1): 17-27 (1988) - [j5]Carroll Morgan:
The Specification Statement. ACM Trans. Program. Lang. Syst. 10(3): 403-419 (1988) - 1987
- [j4]C. A. R. Hoare, Ian J. Hayes, Jifeng He, Carroll Morgan, A. W. Roscoe, Jeff W. Sanders, Ib Holm Sørensen, J. Michael Spivey, Bernard Sufrin:
Laws of Programming. Commun. ACM 30(8): 672-686 (1987) - 1985
- [j3]Carroll Morgan:
Global and Logical Time in Distributed Algorithms. Inf. Process. Lett. 20(4): 189-194 (1985) - 1984
- [j2]Carroll Morgan, Bernard Sufrin:
Specification of the UNIX Filing System. IEEE Trans. Software Eng. 10(2): 128-142 (1984) - 1983
- [c2]Carroll Morgan:
Specification of a simplified Network Service in Z. The Analysis of Concurrent Systems 1983: 318-344 - [c1]Carroll Morgan, C. A. R. Hoare:
Specification of a simplified Network Service in CSP. The Analysis of Concurrent Systems 1983: 345-353
1970 – 1979
- 1976
- [j1]Carroll Morgan:
A prime decomposition result for parallel systems. SIGACT News 8(3): 14-20 (1976)
Coauthor Index
Annabelle McIver
aka: A. K. McIver
aka: A. K. McIver
[c57] [c56] [i14] [c55] [i13] [j43] [c54] [i12] [c53] [i11] [b4] [c52] [p2] [i10] [j41] [j40] [j39] [c51] [c50] [j38] [j37] [c49] [c47] [i9] [i8] [c46] [i7] [i6] [j36] [c44] [j35] [c42] [c41] [c40] [c37] [i5] [j30] [i4] [c34] [c33] [p1] [i3] [c31] [c30] [e2] [j28] [c28] [j26] [c24] [c22] [b3] [j25] [j24] [j23] [c20] [c19] [c17] [c16] [c15] [c14] [j22] [c13] [c12] [i1] [c11] [j21] [j20] [c10] [c9] [j19] [j18] [j17] [j16]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-04 00:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
