2661 search results - page 304 / 533 » Model Checking Performability Properties |
121
click to vote
AAAI
2006
15 years 2 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
123
Voted
DAGSTUHL
1997
15 years 2 months ago
1997
A realistic simulation system, which couples geometry and physics, can provide a useful toolkit for virtual environments. Interactions among moving objects in the virtual worlds a...
114
Voted
IEE
2010
14 years 11 months ago
2010
A key problem in compositional model checking of software systems is that typical model checkers accept only closed systems (runnable programs) and therefore a component cannot be ...
133
click to vote
FDTC
2010
Springer
14 years 10 months ago
2010
Springer
Many implementations of cryptographic algorithms have shown to be susceptible to fault attacks. For some of them, countermeasures against specific fault models have been proposed. ...
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently,...