Larissa Meinicke

According to our database1, Larissa Meinicke authored at least 26 papers between 2006 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 





A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency.
Formal Asp. Comput., 2019

Type Capabilities for Object-Oriented Programming Languages.
Proceedings of the Formal Methods and Software Engineering, 2018

Encoding Fairness in a Synchronous Concurrent Program Algebra.
Proceedings of the Formal Methods - 22nd International Symposium, 2018

Designing a semantic model for a wide-spectrum language with concurrency.
Formal Asp. Comput., 2017

Evaluating quality of security testing of the JDK.
Proceedings of the 8th ACM SIGSOFT International Workshop on Automated Software Testing, 2017

Capabilities for Java: Secure Access to Resources.
Proceedings of the Programming Languages and Systems - 15th Asian Symposium, 2017

An Algebra of Synchronous Atomic Steps.
Proceedings of the FM 2016: Formal Methods, 2016

Hidden-Markov program algebra with iteration.
Mathematical Structures in Computer Science, 2015

Abstractions of non-interference security: probabilistic versus possibilistic.
Formal Asp. Comput., 2014

Abstract Channels and Their Robust Information-Leakage Ordering.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

Invariants, Well-Founded Statements and Real-Time Program Algebra.
Proceedings of the FM 2014: Formal Methods, 2014

Linking Unifying Theories of Program refinement.
Sci. Comput. Program., 2013

A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Towards an Algebra for Real-Time Programs.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2012

Refinement algebra for probabilistic programs.
Formal Asp. Comput., 2010

Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods.
Proceedings of the Static Analysis - 17th International Symposium, 2010

Unifying Theories of Programming That Distinguish Nontermination and Abort.
Proceedings of the Mathematics of Program Construction, 10th International Conference, 2010

Compositional Closure for Bayes Risk in Probabilistic Noninterference.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Security, Probability and Nearly Fair Coins in the Cryptographers' Café.
Proceedings of the FM 2009: Formal Methods, 2009

Refinement Algebra for Probabilistic Programs.
Electr. Notes Theor. Comput. Sci., 2008

Algebraic reasoning for probabilistic action systems and while-loops.
Acta Inf., 2008

Probabilistic Choice in Refinement Algebra.
Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008

Reactive Probabilistic Programs and Refinement Algebra.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2008

A Stepwise Development Process for Reasoning About the Reliability of Real-Time Systems.
Proceedings of the Integrated Formal Methods, 6th International Conference, 2007

Continuous Action System Refinement.
Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006

Reasoning Algebraically About Probabilistic Loops.
Proceedings of the Formal Methods and Software Engineering, 2006