Sciweavers

300 search results - page 28 / 60
» An extension of the Cayley-Sylvester formula
Sort
View
CADE
2011
Springer
12 years 8 months ago
ASASP: Automated Symbolic Analysis of Security Policies
We describe asasp, a symbolic reachability procedure for the analysis of administrative access control policies. The tool represents access policies and their administrative action...
Francesco Alberti, Alessandro Armando, Silvio Rani...
LATA
2012
Springer
12 years 3 months ago
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
Arne Meier, Johannes Schmidt, Michael Thomas, Heri...
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 8 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
CAV
2003
Springer
155views Hardware» more  CAV 2003»
13 years 11 months ago
An Improved On-The-Fly Tableau Construction for a Real-Time Temporal Logic
Abstract. Temporal logic is popular for specifying correctness properties of reactive systems. Real-time temporal logics add the ability to express quantitative timing aspects. Tab...
Marc Geilen
ALGORITHMICA
2007
93views more  ALGORITHMICA 2007»
13 years 8 months ago
Random 2-SAT with Prescribed Literal Degrees
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
Colin Cooper, Alan M. Frieze, Gregory B. Sorkin