关注
Matthew J. Parkinson
Matthew J. Parkinson
Microsoft Research
在 microsoft.com 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Permission accounting in separation logic
R Bornat, C Calcagno, P O'Hearn, M Parkinson
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of …, 2005
5202005
Separation logic and abstraction
M Parkinson, G Bierman
ACM symposium on principles of programming languages (POPL), 247-258, 2005
4302005
A marriage of rely/guarantee and separation logic
V Vafeiadis, M Parkinson
CONCUR 2007–Concurrency Theory, 256-271, 2007
4252007
jStar: Towards practical verification for Java
D Distefano, MJ Parkinson J
ACM Sigplan Notices 43 (10), 213-226, 2008
3492008
Concurrent abstract predicates
T Dinsdale-Young, M Dodds, P Gardner, MJ Parkinson, V Vafeiadis
ECOOP 2010–Object-Oriented Programming: 24th European Conference, Maribor …, 2010
3162010
Behavioral interface specification languages
J Hatcliff, GT Leavens, KRM Leino, P Müller, M Parkinson
ACM Computing Surveys (CSUR) 44 (3), 1-58, 2012
2312012
Views: compositional reasoning for concurrent programs
T Dinsdale-Young, L Birkedal, P Gardner, M Parkinson, H Yang
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on principles of …, 2013
2242013
Separation logic, abstraction and inheritance
MJ Parkinson, GM Bierman
ACM SIGPLAN Notices 43 (1), 75-86, 2008
2002008
MJ: An imperative core calculus for Java and Java with effects
G Bierman, M Parkinson, A Pitts
Technical report, University of Cambridge Computer Laboratory, to appear, 2003
1692003
Local reasoning for Java
MJ Parkinson
University of Cambridge, Computer Laboratory, 2005
1602005
Deny-guarantee reasoning
M Dodds, X Feng, M Parkinson, V Vafeiadis
Programming Languages and Systems: 18th European Symposium on Programming …, 2009
1582009
Uniqueness and reference immutability for safe parallelism
CS Gordon, MJ Parkinson, J Parsons, A Bromfield, J Duffy
ACM SIGPLAN Notices 47 (10), 21-40, 2012
1552012
Tractable reasoning in a fragment of separation logic
B Cook, C Haase, J Ouaknine, M Parkinson, J Worrell
CONCUR 2011–Concurrency Theory: 22nd International Conference, CONCUR 2011 …, 2011
1202011
Proving that non-blocking algorithms don't block
A Gotsman, B Cook, M Parkinson, V Vafeiadis
ACM SIGPLAN Notices 44 (1), 16-28, 2009
1082009
Modular safety checking for fine-grained concurrency
C Calcagno, M Parkinson, V Vafeiadis
Static Analysis: 14th International Symposium, SAS 2007, Kongens Lyngby …, 2007
1042007
Variables as resource in Hoare logics
M Parkinson, R Bornat, C Calcagno
Logic in Computer Science, 2006 21st Annual IEEE Symposium on, 137-146, 2006
1012006
The Java module system: core design and semantic definition
R Strniša, P Sewell, M Parkinson
ACM SIGPLAN Notices 42 (10), 499-514, 2007
982007
Modular verification of a non-blocking stack
M Parkinson, R Bornat, P O'Hearn
ACM SIGPLAN Notices 42 (1), 297-302, 2007
982007
Modular reasoning about separation of concurrent data structures
K Svendsen, L Birkedal, M Parkinson
Programming Languages and Systems: 22nd European Symposium on Programming …, 2013
862013
Coarse-grained transactions
E Koskinen, M Parkinson, M Herlihy
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2010
852010
系统目前无法执行此操作,请稍后再试。
文章 1–20