54 search results - page 9 / 11 » Checking Secrecy by Means of Partial Order Reduction |
FORMATS
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA). We first formulate the principles of layering and transition indep...
81
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
KBSE
2007
IEEE
15 years 3 months ago
2007
IEEE
Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under ...
101
click to vote
FORMATS
2006
Springer
15 years 1 months ago
2006
Springer
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
ICRA
2007
IEEE
15 years 3 months ago
2007
IEEE
— We consider motion planning problems for a vehicle with kinodynamic constraints, where there is partial knowledge about the environment and replanning is required. We present a...