Sciweavers

565 search results - page 106 / 113
» A logic for authorization provenance
Sort
View
STACS
2010
Springer
14 years 3 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
ICDT
2009
ACM
135views Database» more  ICDT 2009»
14 years 3 months ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
Foto N. Afrati, Phokion G. Kolaitis
ISSTA
2009
ACM
14 years 3 months ago
Precise pointer reasoning for dynamic test generation
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
Bassem Elkarablieh, Patrice Godefroid, Michael Y. ...
ICCS
2007
Springer
14 years 2 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga
OOPSLA
2007
Springer
14 years 2 months ago
Ilea: inter-language analysis across java and c
Java bug finders perform static analysis to find implementation mistakes that can lead to exploits and failures; Java compilers perform static analysis for optimization. If Java...
Gang Tan, Greg Morrisett