4340 search results - page 398 / 868 » Formal Methods and Cryptography |
177
click to vote
IPL
2007
15 years 6 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
163
click to vote
JUCS
2007
15 years 6 months ago
2007
: This paper introduces model checking, originally conceived for checking finite state systems. It surveys its evolution to encompass finitely checkable properties of systems wit...
221
click to vote
TCS
1998
15 years 6 months ago
1998
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
159
click to vote
COMPSAC
2010
IEEE
15 years 4 months ago
2010
IEEE
Developing large scale software systems has major security challenges. This paper describes the issues involved and then addresses two topics: formal methods for emerging secure sy...
189
click to vote
MEMOCODE
2010
IEEE
15 years 4 months ago
2010
IEEE
Electronic System Level (ESL) design manages the complexity of todays systems by using abstract models. In this context Transaction Level Modeling (TLM) is state-of-theart for desc...