default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLarissa Meinicke
Person information
- affiliation: University of Queensland
- affiliation: Abo Akademi University, Turku, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]Ian J. Hayes
, Larissa A. Meinicke, Nasos Evangelou-Oost:
Restructuring a Concurrent Refinement Algebra. RAMiCS 2024: 135-155- [i14]Larissa A. Meinicke, Ian J. Hayes:
Reasoning about distributive laws in a concurrent refinement algebra. CoRR abs/2403.13425 (2024) - [i13]Larissa A. Meinicke, Ian J. Hayes, Cliff B. Jones:
Data reification in a concurrent rely-guarantee algebra. CoRR abs/2405.05546 (2024) - [i12]Ian J. Hayes, Larissa A. Meinicke, Nasos Evangelou-Oost:
Restructuring a concurrent refinement algebra. CoRR abs/2405.05690 (2024) - [i11]Robert J. Colvin, Ian J. Hayes, Scott Heiner, Peter Höfner, Larissa Meinicke, Roger C. Su:
Practical Rely/Guarantee Verification of an Efficient Lock for seL4 on Multicore Architectures. CoRR abs/2407.20559 (2024) - [i10]Ian J. Hayes, Cliff B. Jones, Larissa A. Meinicke:
Handling expression evaluation under interference. CoRR abs/2409.07741 (2024) - 2023
- [c24]Ian J. Hayes, Cliff B. Jones, Larissa A. Meinicke:
Specifying and Reasoning About Shared-Variable Concurrency. Theories of Programming and Formal Methods 2023: 110-135 - [c23]Nasos Evangelou-Oost, Larissa Meinicke, Callum Bannister, Ian J. Hayes:
Trace Models of Concurrent Valuation Algebras. ICFEM 2023: 118-136 - [c22]Larissa A. Meinicke, Ian J. Hayes:
Using scylindric algebra to support local variables in rely/guarantee concurrency. FormaliSE 2023: 108-119 - [i9]Nasos Evangelou-Oost, Callum Bannister, Larissa Meinicke, Ian J. Hayes:
Trace models of concurrent valuation algebras. CoRR abs/2305.18017 (2023) - 2021
- [i8]Ian J. Hayes, Larissa A. Meinicke, Patrick A. Meiring:
Deriving Laws for Developing Concurrent Programs in a Rely-Guarantee Style. CoRR abs/2103.15292 (2021)
2010 – 2019
- 2019
- [j7]Ian J. Hayes, Larissa A. Meinicke, Kirsten Winter, Robert J. Colvin:
A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency. Formal Aspects Comput. 31(2): 133-163 (2019) - [c21]Brijesh Dongol, Ian J. Hayes, Larissa Meinicke, Georg Struth:
Cylindric Kleene Lattices for Program Construction. MPC 2019: 197-225 - [c20]Ian J. Hayes, Larissa A. Meinicke:
Developing an Algebra for Rely/Guarantee Concurrency: Design Decisions and Challenges. UTP 2019: 176-197 - [i7]Larissa A. Meinicke, Ian J. Hayes:
Handling localisation in rely/guarantee concurrency: An algebraic approach. CoRR abs/1907.04005 (2019) - 2018
- [c19]Ian J. Hayes, Larissa A. Meinicke:
Encoding Fairness in a Synchronous Concurrent Program Algebra. FM 2018: 222-239 - [c18]Xi Wu, Yi Lu, Patrick A. Meiring, Ian J. Hayes, Larissa A. Meinicke:
Type Capabilities for Object-Oriented Programming Languages. ICFEM 2018: 215-230 - [i6]Ian J. Hayes, Larissa A. Meinicke:
Encoding fairness in a synchronous concurrent program algebra: extended version with proofs. CoRR abs/1805.01681 (2018) - 2017
- [j6]Robert J. Colvin, Ian J. Hayes, Larissa A. Meinicke:
Designing a semantic model for a wide-spectrum language with concurrency. Formal Aspects Comput. 29(5): 853-875 (2017) - [c17]Ian J. Hayes, Xi Wu, Larissa A. Meinicke:
Capabilities for Java: Secure Access to Resources. APLAS 2017: 67-84 - [c16]Padmanabhan Krishnan, Jerome Loh, Rebecca O'Donoghue, Larissa Meinicke:
Evaluating quality of security testing of the JDK. A-TEST@ESEC/SIGSOFT FSE 2017: 19-20 - [i5]Ian J. Hayes, Larissa A. Meinicke, Kirsten Winter, Robert J. Colvin:
A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency. CoRR abs/1710.03352 (2017) - 2016
- [c15]Ian J. Hayes, Robert J. Colvin, Larissa A. Meinicke, Kirsten Winter, Andrius Velykis:
An Algebra of Synchronous Atomic Steps. FM 2016: 352-369 - [i4]Ian J. Hayes, Robert Colvin, Larissa Meinicke, Kirsten Winter, Andrius Velykis:
An algebra of synchronous atomic steps. CoRR abs/1609.00118 (2016) - [i3]Robert J. Colvin, Ian J. Hayes, Larissa A. Meinicke:
Designing a semantic model for a wide-spectrum language with concurrency. CoRR abs/1609.00195 (2016) - 2015
- [j5]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
Hidden-Markov program algebra with iteration. Math. Struct. Comput. Sci. 25(2): 320-360 (2015) - 2014
- [j4]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) - [c14]Ian J. Hayes, Larissa Meinicke:
Invariants, Well-Founded Statements and Real-Time Program Algebra. FM 2014: 318-334 - [c13]Annabelle McIver, Carroll Morgan, Geoffrey Smith, Barbara Espinoza, Larissa Meinicke:
Abstract Channels and Their Robust Information-Leakage Ordering. POST 2014: 83-102 - 2013
- [j3]Ian J. Hayes, Steve Dunne, Larissa Meinicke:
Linking Unifying Theories of Program refinement. Sci. Comput. Program. 78(11): 2086-2107 (2013) - 2012
- [c12]Brijesh Dongol, Ian J. Hayes, Larissa Meinicke, Kim Solin:
Towards an Algebra for Real-Time Programs. RAMiCS 2012: 50-65 - [c11]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism. LICS 2012: 461-470 - 2011
- [i2]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
Hidden-Markov Program Algebra with iteration. CoRR abs/1102.0333 (2011) - 2010
- [j2]Larissa Meinicke, Kim Solin:
Refinement algebra for probabilistic programs. Formal Aspects Comput. 22(1): 3-31 (2010) - [c10]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
Compositional Closure for Bayes Risk in Probabilistic Noninterference. ICALP (2) 2010: 223-235 - [c9]Ian J. Hayes, Steve Dunne, Larissa Meinicke:
Unifying Theories of Programming That Distinguish Nontermination and Abort. MPC 2010: 178-194 - [c8]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 - [i1]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
Compositional closure for Bayes Risk in probabilistic noninterference. CoRR abs/1007.1054 (2010)
2000 – 2009
- 2009
- [c7]Annabelle McIver, Larissa Meinicke, Carroll Morgan:
Security, Probability and Nearly Fair Coins in the Cryptographers' Café. FM 2009: 41-71 - 2008
- [b1]Larissa A. Meinicke:
Transformation Rules for Probabilistic Progams: An Algebraic Approach. University of Queensland, Australia, 2008 - [j1]Larissa Meinicke, Ian J. Hayes:
Algebraic reasoning for probabilistic action systems and while-loops. Acta Informatica 45(5): 321-382 (2008) - [c6]Larissa Meinicke, Kim Solin:
Reactive Probabilistic Programs and Refinement Algebra. RelMiCS 2008: 304-319 - [c5]Larissa Meinicke, Ian J. Hayes:
Probabilistic Choice in Refinement Algebra. MPC 2008: 243-267 - 2007
- [c4]Larissa Meinicke, Graeme Smith:
A Stepwise Development Process for Reasoning About the Reliability of Real-Time Systems. IFM 2007: 439-458 - [c3]Larissa Meinicke, Kim Solin:
Refinement Algebra for Probabilistic Programs. REFINE@IFM 2007: 177-195 - 2006
- [c2]Larissa Meinicke, Ian J. Hayes:
Reasoning Algebraically About Probabilistic Loops. ICFEM 2006: 380-399 - [c1]Larissa Meinicke, Ian J. Hayes:
Continuous Action System Refinement. MPC 2006: 316-337
Coauthor Index
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 2024-10-15 00:24 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:
