Sciweavers

3424 search results - page 482 / 685
» Automated Testing of Classes
Sort
View
LPAR
2007
Springer
15 years 11 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
LPAR
2007
Springer
15 years 11 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
LPNMR
2007
Springer
15 years 11 months ago
Head-Elementary-Set-Free Logic Programs
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
Martin Gebser, Joohyung Lee, Yuliya Lierler
SARA
2007
Springer
15 years 11 months ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu
TARK
2007
Springer
15 years 11 months ago
The computational complexity of choice sets
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
Felix Brandt, Felix A. Fischer, Paul Harrenstein