Aleksandar Nanevski
Aleksandar Nanevski
Подтвержден адрес электронной почты в домене imdea.org - Главная страница
НазваниеПроцитированоГод
Contextual modal type theory
A Nanevski, F Pfenning, B Pientka
ACM Transactions on Computational Logic (TOCL) 9 (3), 23, 2008
2672008
Ynot: dependent types for imperative programs
A Nanevski, G Morrisett, A Shinnar, P Govereau, L Birkedal
ACM Sigplan Notices 43 (9), 229-240, 2008
220*2008
Polymorphism and separation in Hoare type theory
A Nanevski, G Morrisett, L Birkedal
ACM SIGPLAN Notices 41 (9), 62-73, 2006
1502006
Hoare type theory, polymorphism and separation1
A Nanevski, G Morrisett, L Birkedal
Journal of Functional Programming 18 (5-6), 865-911, 2008
1272008
Verification of information flow and access control policies with dependent types
A Nanevski, A Banerjee, D Garg
2011 IEEE Symposium on Security and Privacy, 165-179, 2011
862011
Structuring the verification of heap-manipulating programs
A Nanevski, V Vafeiadis, J Berdine
ACM Sigplan Notices 45 (1), 261-274, 2010
762010
Communicating state transition systems for fine-grained concurrent resources
A Nanevski, R Ley-Wild, I Sergey, GA Delbianco
European Symposium on Programming Languages and Systems, 290-310, 2014
752014
Abstract predicates and mutable ADTs in Hoare type theory
A Nanevski, A Ahmed, G Morrisett, L Birkedal
European Symposium on Programming, 189-204, 2007
742007
Meta-programming with names and necessity
A Nanevski
ACM SIGPLAN Notices 37 (9), 206-217, 2002
722002
Inferring invariants in separation logic for imperative list-processing programs
S Magill, A Nanevski, E Clarke, P Lee
SPACE 1 (1), 5.7, 2006
702006
Mechanized verification of fine-grained concurrent programs
I Sergey, A Nanevski, A Banerjee
ACM SIGPLAN Notices 50 (6), 77-87, 2015
652015
Mtac: a monad for typed tactic programming in Coq
B Ziliani, D Dreyer, NR Krishnaswami, A Nanevski, V Vafeiadis
Journal of Functional Programming 25, 2015
582015
Subjective auxiliary state for coarse-grained concurrency
R Ley-Wild, A Nanevski
ACM SIGPLAN Notices 48 (1), 561-574, 2013
502013
Effectively-propositional reasoning about reachability in linked data structures
S Itzhaky, A Banerjee, N Immerman, A Nanevski, M Sagiv
International Conference on Computer Aided Verification, 756-772, 2013
492013
How to make ad hoc proof automation less ad hoc
G Gonthier, B Ziliani, A Nanevski, D Dreyer
ACM SIGPLAN Notices 46 (9), 163-175, 2011
482011
Dependent type theory for verification of information flow and access control policies
A Nanevski, A Banerjee, D Garg
ACM Transactions on Programming Languages and Systems (TOPLAS) 35 (2), 6, 2013
412013
Staged computation with names and necessity
A Nanevski, F Pfenning
Journal of Functional Programming 15 (6), 893-939, 2005
412005
Specifying and verifying concurrent algorithms with histories and subjectivity
I Sergey, A Nanevski, A Banerjee
European Symposium on Programming Languages and Systems, 333-358, 2015
372015
A realizability model for impredicative Hoare type theory
RL Petersen, L Birkedal, A Nanevski, G Morrisett
European Symposium on Programming, 337-352, 2008
352008
Modular reasoning about heap paths via effectively propositional formulas
S Itzhaky, A Banerjee, N Immerman, O Lahav, A Nanevski, M Sagiv
ACM SIGPLAN Notices 49 (1), 385-396, 2014
272014
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20