Sciweavers

1073 search results - page 42 / 215
» Formal Program Development with Approximations
Sort
View
POPL
2007
ACM
14 years 9 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
LPAR
2007
Springer
14 years 2 months ago
Why Would You Trust B ?
Abstract. The use of formal methods provides confidence in the correctness of developments. Yet one may argue about the actual level of confidence obtained when the method itself...
Éric Jaeger, Catherine Dubois
JFP
2002
89views more  JFP 2002»
13 years 8 months ago
The countdown problem
We systematically develop a functional program that solves the countdown problem, a numbers game in which the aim is to construct arithmetic expressions satisfying certain constra...
Graham Hutton
FM
2003
Springer
88views Formal Methods» more  FM 2003»
14 years 1 months ago
A Semantic Foundation for TCOZ in Unifying Theories of Programming
Abstract. UnifyingTheoriesofProgramming(UTP)canprovideaformalsemantic foundation not only for programming languages but also for more expressive specification languages. We believ...
Shengchao Qin, Jin Song Dong, Wei-Ngan Chin
IASTEDSEA
2004
13 years 10 months ago
Higher-order strategic programming: A road to software assurance
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
Victor L. Winter, Steve Roach, Fares Fraij