Nominal Automata for Resource Usage Control
作者： Pierpaolo Degano , Gian-Luigi Ferrari , Gianluca Mezzetti
DOI: 10.1007/978-3-642-31606-7_11
关键词:
摘要: Two classes of nominal automata, namely Usage Automata (UAs) and Variable Finite (VFAs) are considered to express resource control policies over program execution traces expressed by a calculus (Usages). We first analyse closure properties UAs, then show UAs less expressive than VFAs. finally carry VFAs the symbolic technique for model checking Usages against so making it possible verify compliance with larger class security properties.
springer.com
core.ac.uk
springerlink.com参考文章(34)
Moshe Y. Vardi, Pierre Wolper, An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) logic in computer science. pp. 332- 344 ,(1986)
Joost-Pieter Katoen, Christel Baier, Principles of Model Checking (Representation and Mind Series) The MIT Press. ,(2008)
Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, On the Maximal Number of Cubic Runs in a String Language and Automata Theory and Applications. ,vol. 6031, pp. 227- 238 ,(2010) , 10.1007/978-3-642-13089-2_19
Joost-Pieter Katoen, Christel Baier, Principles of Model Checking ,(2008)
Mary Cryan, Peter Bro Miltersen, On Pseudorandom Generators in NC mathematical foundations of computer science. pp. 272- 284 ,(2001) , 10.1007/3-540-44683-4_24
Massimo Bartoletti, Roberto Zunino, LocUsT: a tool for checking usage policies Università di Pisa. ,(2008)
Luc Segoufin, Automata and Logics for Words and Trees over an Infinite Alphabet Computer Science Logic. pp. 41- 57 ,(2006) , 10.1007/11874683_3
Foundations of Security Analysis and Design V: FOSAD 2007/2008/2009 Tutorial Lectures Lecture Notes in Computer Science. ,vol. 5705, ,(2009) , 10.1007/978-3-642-03829-7
Orna Grumberg, Orna Kupferman, Sarai Sheinvald, Variable Automata over Infinite Alphabets Language and Automata Theory and Applications. pp. 561- 572 ,(2010) , 10.1007/978-3-642-13089-2_47
Frank Neven, Thomas Schwentick, Victor Vianu, Towards Regular Languages over Infinite Alphabets mathematical foundations of computer science. pp. 560- 572 ,(2001) , 10.1007/3-540-44683-4_49