923 search results - page 103 / 185 » Proving the value of formal methods |
173
click to vote
IPL
2008
15 years 6 months ago
2008
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
151
click to vote
IJAR
2000
15 years 6 months ago
2000
Multiply sectioned Bayesian networks (MSBNs) provide a coherent and flexible formalism for representing uncertain knowledge in large domains. Global consistency among subnets in a...
187
click to vote
IFM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A communication system evolves dynamically with the addition and deletion of services. In our previous work [12], a graph transformation system (GTS) was used to model th...
147
click to vote
JSC
2006
15 years 6 months ago
2006
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof...
169
click to vote
SAS
2009
Springer
16 years 1 months ago
2009
Springer
There are many programming situations where it would be convenient to conceal the meaning of code, or the meaning of certain variables. This can be achieved through program transfo...