Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Lincoln, Patrick D."'
Publikováno v:
The Bulletin of Symbolic Logic, 1996 Sep 01. 2(3), 322-338.
Externí odkaz:
https://www.jstor.org/stable/420993
Publikováno v:
Journal of Computer Security. 2001, Vol. 9 Issue 4, p323. 16p. 2 Diagrams.
Publikováno v:
In Theoretical Computer Science 1999 227(1):299-331
Autor:
Tiwari, Ashish, Dutertre, Bruno, Jovanović, Dejan, de Candia, Thomas, Lincoln, Patrick D., Rushby, John, Sadigh, Dorsa, Seshia, Sanjit
Publikováno v:
Proceedings of the 3rd International Conference High Confidence Networked Systems; 4/15/2014, p85-94, 10p
Publikováno v:
Proceedings of the 7th ACM Conference: Computer & Communications Security; 11/ 1/2000, p19-24, 6p
Publikováno v:
Journal of Computer Security; 2005, Vol. 13 Issue 2, p265-316, 52p, 10 Diagrams
Publikováno v:
Electronic Notes in Theoretical Computer Science. :120-129
Proof search in linear logic is known to be difficult: the provability of propositional linear logic formulas is undecidable. Even without the modalities, multiplicative-additive fragment of propositional linear logic, mall, is known to be PSPACE-com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::7271a57ebaedc26f7fd3ff2b08587201
Publikováno v:
Journal of Computer Security. 2002, Vol. 10 Issue 3, p297. 1p.
Publikováno v:
In Electronic Notes in Theoretical Computer Science 1996 3:120-129