923 search results - page 137 / 185 » Proving the value of formal methods |
177
click to vote
FOCM
2011
14 years 9 months ago
2011
We consider a wide class of semi linear Hamiltonian partial differential equations and their approximation by time splitting methods. We assume that the nonlinearity is polynomia...
203
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
141
click to vote
MICAI
2000
Springer
15 years 9 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
143
click to vote
LPNMR
1990
Springer
15 years 10 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
165
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...