作者: Raju Halder , Matteo Zanioli , Agostino Cortesi
关键词: Theoretical computer science 、 Satisfiability 、 Programming language 、 Computer science 、 Static analysis 、 Propositional formula 、 Embedding 、 Abstract interpretation 、 Truth value 、 Query language 、 Domain (software engineering)
摘要: In this work, we extend language-based information-flow security analysis to the case of database applications embedding query languages. The is performed by (i) computing an overapproximation variables' dependences, in form propositional formula, occurred up each program point, (ii) checking satisfiability on assigning truth values variables, (iii) analyzing application over a numerical abstract domain, and finally, (iv) enhancing using reduced product formulae domain domain.