923 search results - page 52 / 185 » Proving the value of formal methods |
159
click to vote
SAS
2005
Springer
15 years 11 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
177
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
The intrinsic complexity of most protocol speci cations in particular, and of asynchronous systems in general, lead us to study combinations of static analysis with classical model...
145
click to vote
FMCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper is placed in the context of large scale distributed programming, providing a programming model based on asynchronous components. It focuses on the semantics of asynchron...
197
click to vote
ACL2
2006
ACM
15 years 9 months ago
2006
ACM
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
168
Voted
FMCAD
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...