923 search results - page 116 / 185 » Proving the value of formal methods |
170
click to vote
ENTCS
2007
15 years 6 months ago
2007
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
137
click to vote
SIAMJO
2002
15 years 6 months ago
2002
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
153
click to vote
SEMWEB
2007
Springer
16 years 12 days ago
2007
Springer
The Hierarchical Task Network (HTN) planning method is conceived of as a useful method for Web service composition as well as classical task planning. However, there are no complet...
208
click to vote
CBSQ
2003
Springer
15 years 11 months ago
2003
Springer
The use of formal model based (FMB) methods to evaluate the quality of the components is an important research area. Except for a growing number of exceptions, FMB methods are sti...
280
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...