436 search results - page 9 / 88 » Decomposing constraint systems: equivalences and computation... |
169
click to vote
KBSE
2010
IEEE
15 years 4 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...
202
click to vote
JAIR
2011
14 years 9 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...
138
click to vote
CHI
2010
ACM
16 years 27 days 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...
157
click to vote
STACS
2009
Springer
16 years 25 days 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...
143
click to vote
STACS
2007
Springer
16 years 4 days 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...