Larissa Meinicke
According to our database^{1},
Larissa Meinicke
authored at least 25 papers
between 2006 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
Type Capabilities for ObjectOriented 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
2017
Designing a semantic model for a widespectrum 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
2016
An Algebra of Synchronous Atomic Steps.
Proceedings of the FM 2016: Formal Methods, 2016
2015
HiddenMarkov program algebra with iteration.
Mathematical Structures in Computer Science, 2015
2014
Abstractions of noninterference security: probabilistic versus possibilistic.
Formal Asp. Comput., 2014
Abstract Channels and Their Robust InformationLeakage Ordering.
Proceedings of the Principles of Security and Trust  Third International Conference, 2014
Invariants, WellFounded Statements and RealTime Program Algebra.
Proceedings of the FM 2014: Formal Methods, 2014
2013
Linking Unifying Theories of Program refinement.
Sci. Comput. Program., 2013
2012
A KantorovichMonadic 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 RealTime Programs.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2012
2010
Refinement algebra for probabilistic programs.
Formal Asp. Comput., 2010
LinearInvariant Generation for Probabilistic Programs:  Automated Support for ProofBased 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
2009
Security, Probability and Nearly Fair Coins in the Cryptographers' Café.
Proceedings of the FM 2009: Formal Methods, 2009
2008
Refinement Algebra for Probabilistic Programs.
Electr. Notes Theor. Comput. Sci., 2008
Algebraic reasoning for probabilistic action systems and whileloops.
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
2007
A Stepwise Development Process for Reasoning About the Reliability of RealTime Systems.
Proceedings of the Integrated Formal Methods, 6th International Conference, 2007
2006
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