1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
//
// ComposedFactQuery.cs
//
// Authors:
// Alexander Chebaturkin (chebaturkin@gmail.com)
//
// Copyright (C) 2011 Alexander Chebaturkin
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
using System;
using System.Collections.Generic;
using System.Linq;
using Mono.CodeContracts.Static.AST;
using Mono.CodeContracts.Static.ControlFlow;
using Mono.CodeContracts.Static.DataStructures;
using Mono.CodeContracts.Static.Lattices;
namespace Mono.CodeContracts.Static.Proving
{
class ComposedFactQuery<Variable> : IFactQuery<BoxedExpression, Variable>
{
private List<IFactQuery<BoxedExpression, Variable>> elements = new List<IFactQuery<BoxedExpression, Variable>> ();
private Predicate<APC> isUnreachable;
public ComposedFactQuery(Predicate<APC> isUnreachable )
{
this.isUnreachable = isUnreachable;
}
public void Add(IFactQuery<BoxedExpression, Variable> item)
{
if (item == null)
return;
this.elements.Add (item);
}
#region Implementation of IFactBase<Variable>
public FlatDomain<bool> IsNull(APC pc, Variable variable)
{
return elements.Select(fact => fact.IsNull(pc, variable)).FirstOrDefault(factResult => !factResult.IsTop);
}
public FlatDomain<bool> IsNonNull(APC pc, Variable variable)
{
return elements.Select(fact => fact.IsNonNull(pc, variable)).FirstOrDefault(factResult => !factResult.IsTop);
}
public bool IsUnreachable(APC pc)
{
if (this.isUnreachable != null && this.isUnreachable(pc))
return true;
return elements.Any (factQuery => factQuery.IsUnreachable (pc));
}
#endregion
#region Implementation of IFactQuery<BoxedExpression,Variable>
public FlatDomain<bool> IsNull(APC pc, BoxedExpression expr)
{
return elements.Select(fact => fact.IsNull(pc, expr)).FirstOrDefault(factResult => !factResult.IsTop);
}
public FlatDomain<bool> IsNonNull(APC pc, BoxedExpression expr)
{
return elements.Select(fact => fact.IsNonNull(pc, expr)).FirstOrDefault(factResult => !factResult.IsTop);
}
public FlatDomain<bool> IsTrue(APC pc, BoxedExpression expr)
{
FlatDomain<bool> res = ProofOutcome.Top;
foreach (var factQuery in elements) {
var outcome = factQuery.IsTrue (pc, expr);
if (outcome.IsTrue() || outcome.IsBottom)
return outcome;
if (outcome.IsFalse ())
res = outcome;
}
if (!res.IsTop)
return res;
BinaryOperator op;
BoxedExpression left;
BoxedExpression right;
if (expr.IsBinaryExpression (out op, out left, out right)) {
if ((op == BinaryOperator.Ceq || op == BinaryOperator.Cobjeq) && this.IsRelational (left) && this.IsNull (pc, right).IsTrue ()) {
var outcome = this.IsTrue (pc, left);
return outcome.Negate ();
}
int leftInt;
int rightInt;
if (op == BinaryOperator.Ceq && left.IsConstantIntOrNull (out leftInt) && right.IsConstantIntOrNull (out rightInt))
return leftInt == rightInt ? ProofOutcome.True : ProofOutcome.False;
}
if (expr.IsUnary && expr.UnaryOperator == UnaryOperator.Not) {
var outcome = this.IsTrue (pc, expr.UnaryArgument);
return outcome.Negate ();
}
return ProofOutcome.Top;
}
private bool IsRelational(BoxedExpression e)
{
BinaryOperator op;
BoxedExpression left;
BoxedExpression right;
if (e.IsBinaryExpression (out op, out left, out right))
switch (op) {
case BinaryOperator.Ceq:
case BinaryOperator.Cobjeq:
case BinaryOperator.Cne_Un:
case BinaryOperator.Cge:
case BinaryOperator.Cge_Un:
case BinaryOperator.Cgt:
case BinaryOperator.Cgt_Un:
case BinaryOperator.Cle:
case BinaryOperator.Cle_Un:
case BinaryOperator.Clt:
case BinaryOperator.Clt_Un:
return true;
}
return false;
}
public FlatDomain<bool> IsTrueImply(APC pc, Sequence<BoxedExpression> positiveAssumptions, Sequence<BoxedExpression> negativeAssumptions, BoxedExpression goal)
{
return elements.Select(fact => fact.IsTrueImply(pc, positiveAssumptions, negativeAssumptions, goal)).FirstOrDefault(factResult => !factResult.IsTop);
}
public FlatDomain<bool> IsGreaterEqualToZero(APC pc, BoxedExpression expr)
{
return elements.Select(fact => fact.IsGreaterEqualToZero(pc, expr)).FirstOrDefault(factResult => !factResult.IsTop);
}
public FlatDomain<bool> IsLessThan(APC pc, BoxedExpression expr, BoxedExpression right)
{
return elements.Select(fact => fact.IsLessThan(pc, expr, right)).FirstOrDefault(factResult => !factResult.IsTop);
}
public FlatDomain<bool> IsNonZero(APC pc, BoxedExpression expr)
{
return elements.Select(fact => fact.IsNonZero(pc, expr)).FirstOrDefault(factResult => !factResult.IsTop);
}
#endregion
}
}
|
