Sciweavers

923 search results - page 44 / 185
» Proving the value of formal methods
Sort
View
FMSD
2006
103views more  FMSD 2006»
15 years 6 months ago
Cones and foci: A mechanical framework for protocol verification
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between ...
Wan Fokkink, Jun Pang, Jaco van de Pol
ISOLA
2007
Springer
16 years 6 days ago
Using Invariant Detection Mechanism in Black Box Inference
The testing and formal verification of black box software components is a challenging domain. The problem is even harder when specifications of these components are not available...
Muzammil Shahbaz, Roland Groz
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
16 years 8 days ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
ECML
2004
Springer
15 years 11 months ago
Convergence and Divergence in Standard and Averaging Reinforcement Learning
Although tabular reinforcement learning (RL) methods have been proved to converge to an optimal policy, the combination of particular conventional reinforcement learning techniques...
Marco Wiering
TYPES
2007
Springer
16 years 5 days ago
Intuitionistic vs. Classical Tautologies, Quantitative Comparison
We consider propositional formulas built on implication. The size of a formula is the number of occurrences of variables in it. We assume that two formulas which differ only in th...
Antoine Genitrini, Jakub Kozik, Marek Zaionc