8917 search results - page 415 / 1784 » Abstraction in Algorithm Animation |
154
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
172
Voted
CAV
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking...
168
click to vote
ANTS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the...
221
click to vote
ASIAN
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Clever algorithm design is sometimes superseded by simple encodings into logic. We apply this motto to a few case studies in the formal verification of security propertie...
207
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We investigate the problem of the verification of multiagent systems by means of parallel algorithms. We present algorithms for CTLK, a logic combining branching time tem...