From exponential to polynomial-time security typing via principal types

Hunt, S. & Sands, D. (2011). From exponential to polynomial-time security typing via principal types. Lecture Notes in Computer Science, 6602 L, pp. 297-316. ISSN 0302-9743

[img]
Preview
PDF
Download (252kB) | Preview

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: School of Informatics > Department of Computing
School of Informatics > Centre for Software Reliability
URI: http://openaccess.city.ac.uk/id/eprint/199

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics