List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Visibility and separability for a declarative linearizability proof of the timestamped stack | 2025-06-26 | Paper |
| Mtac: a monad for typed tactic programming in Coq Journal of Functional Programming | 2017-10-23 | Paper |
| Contextual modal type theory ACM Transactions on Computational Logic | 2017-07-12 | Paper |
| Specifying and verifying concurrent algorithms with histories and subjectivity Programming Languages and Systems | 2016-04-26 | Paper |
| Meta-programming with names and necessity Proceedings of the seventh ACM SIGPLAN international conference on Functional programming | 2015-10-07 | Paper |
| Polymorphism and separation in Hoare type theory Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming | 2015-08-03 | Paper |
| Structuring the verification of heap-manipulating programs Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-06-11 | Paper |
| Mtac: a monad for typed tactic programming in Coq Proceedings of the 18th ACM SIGPLAN international conference on Functional programming | 2015-03-30 | Paper |
| Hoare-style reasoning with (algebraic) continuations Proceedings of the 18th ACM SIGPLAN international conference on Functional programming | 2015-03-30 | Paper |
| Ynot: dependent types for imperative programs Proceedings of the 13th ACM SIGPLAN international conference on Functional programming | 2015-03-16 | Paper |
| Automatic generation of staged geometric predicates Proceedings of the sixth ACM SIGPLAN international conference on Functional programming | 2015-03-09 | Paper |
| How to make ad hoc proof automation less ad hoc Proceedings of the 16th ACM SIGPLAN international conference on Functional programming | 2015-03-05 | Paper |
| Subjective auxiliary state for coarse-grained concurrency Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
| Communicating state transition systems for fine-grained concurrent resources Programming Languages and Systems | 2014-04-16 | Paper |
| Modular reasoning about heap paths via effectively propositional formulas Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
| How to make ad hoc proof automation less ad hoc Journal of Functional Programming | 2014-02-27 | Paper |
| Denotation of contextual modal type theory (CMTT): syntax and meta-programming Journal of Applied Logic | 2013-05-02 | Paper |
| Partiality, state and dependent types Lecture Notes in Computer Science | 2011-06-17 | Paper |
| Hoare type theory, polymorphism and separation Journal of Functional Programming | 2008-12-18 | Paper |
| A Realizability Model for Impredicative Hoare Type Theory Programming Languages and Systems | 2008-04-11 | Paper |
| Abstract Predicates and Mutable ADTs in Hoare Type Theory Programming Languages and Systems | 2007-09-04 | Paper |
| Staged computation with names and necessity Journal of Functional Programming | 2005-11-28 | Paper |
| Automatic generation of staged geometric predicates Higher-Order and Symbolic Computation | 2004-03-15 | Paper |
| scientific article; zbMATH DE number 1484272 (Why is no real title available?) | 2000-08-03 | Paper |
Research outcomes over time
This page was built for person: Aleksandar Nanevski
