436 search results - page 9 / 88 » Decomposing constraint systems: equivalences and computation... |
KBSE
2010
IEEE
13 years 7 months ago
2010
IEEE
We study the problem of statistical model checking of probabilistic systems for PCTL unbounded until property P1p(ϕ1 U ϕ2) (where 1 ∈ {<, ≤, >, ≥}) using the computa...
JAIR
2011
12 years 11 months ago
2011
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...
CHI
2010
ACM
14 years 3 months ago
2010
ACM
Click-based graphical passwords have attractive usability properties, such as cueing and good memorability. However, image size and number of click-points in each password signifi...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...