summaryrefslogtreecommitdiff
path: root/Source/AIFramework/VariableMap/Intervals.ssc
blob: f507e020df93cdbcb6ebbbb6d560599bba040a0e (plain)
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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
//-----------------------------------------------------------------------------
//
// Copyright (C) Microsoft Corporation.  All Rights Reserved.
//
//-----------------------------------------------------------------------------
using System;
using System.Collections;
using System.Compiler.Analysis;
using Microsoft.AbstractInterpretationFramework.Collections;
using Microsoft.Contracts;
using Microsoft.Basetypes;

/////////////////////////////////////////////////////////////////////////////////
// An implementation of the interval abstract domain
/////////////////////////////////////////////////////////////////////////////////

namespace Microsoft.AbstractInterpretationFramework 
{
  public class IntervalLattice : MicroLattice 
  {
    readonly ILinearExprFactory! factory;
    
    public IntervalLattice(ILinearExprFactory! factory)
    {
      this.factory = factory;
      // base();
    }

    public override bool UnderstandsBasicArithmetics
    {   
      get
      {
        return true;
      }
    }

    public override Element! Top 
    {
      get 
      {
        return IntervalElement.Top;
      }
    }
    
    public override Element! Bottom
    { 
      get
      {
        return IntervalElement.Bottom;
      }
    }

    /// <summary>
    /// The paramter is the top?
    /// </summary>
    public override bool IsTop(Element! element)
    {
      IntervalElement interval = (IntervalElement) element;
      
      return interval.IsTop();
    }

    /// <summary>
    /// The parameter is the bottom?
    /// </summary>
    public override bool IsBottom(Element! element)
    {
      IntervalElement interval = (IntervalElement) element;
      
      return interval.IsBottom();
    }

    /// <summary>
    /// The classic, pointwise, join of intervals
    /// </summary>
    public override Element! NontrivialJoin(Element! left, Element! right)
    {
      IntervalElement! leftInterval = (IntervalElement!) left;
      IntervalElement! rightInterval = (IntervalElement) right;
        
      ExtendedInt inf = ExtendedInt.Inf(leftInterval.Inf, rightInterval.Inf);
      ExtendedInt sup = ExtendedInt.Sup(leftInterval.Sup, rightInterval.Sup);

      IntervalElement! join =  IntervalElement.Factory(inf, sup);

      return join;
    }

    /// <summary>
    /// The classic, pointwise, meet of intervals
    /// </summary>
    public override Element! NontrivialMeet(Element! left, Element! right)
    {
      IntervalElement! leftInterval = (IntervalElement!) left;
      IntervalElement! rightInterval = (IntervalElement) right;
        
      ExtendedInt inf = ExtendedInt.Sup(leftInterval.Inf, rightInterval.Inf);
      ExtendedInt sup = ExtendedInt.Inf(leftInterval.Sup, rightInterval.Sup);

      return IntervalElement.Factory(inf, sup);
    }


    /// <summary>
    /// The very simple widening of intervals, to be improved with thresholds
    /// left is the PREVIOUS value in the iterations and right is the NEW one
    /// </summary>
    public override Element! Widen(Element! left, Element! right)
    {      
      IntervalElement! prevInterval = (IntervalElement!) left;
      IntervalElement! nextInterval = (IntervalElement!) right;
  
      ExtendedInt inf = nextInterval.Inf < prevInterval.Inf ? ExtendedInt.MinusInfinity : prevInterval.Inf;
      ExtendedInt sup = nextInterval.Sup > prevInterval.Sup ? ExtendedInt.PlusInfinity : prevInterval.Sup;

      IntervalElement widening = IntervalElement.Factory(inf, sup);

      return widening;
    }


    /// <summary>
    /// Return true iff the interval left is containted in right
    /// </summary>
    protected override bool AtMost(Element! left, Element! right)
    {
      IntervalElement! leftInterval = (IntervalElement!) left;
      IntervalElement! rightInterval = (IntervalElement!) right;

      if(leftInterval.IsBottom() || rightInterval.IsTop())
        return true;

      return rightInterval.Inf <= leftInterval.Inf && leftInterval.Sup <= rightInterval.Sup;
    }

    /// <summary>
    /// Return just null
    /// </summary>
    public override IExpr GetFoldExpr(Element! element)
    {
      return null;
    }    

    /// <summary>
    /// return a predicate inf "\leq x and x "\leq" sup (if inf [or sup] is not oo)
    /// </summary>
    public override IExpr! ToPredicate(IVariable! var, Element! element)
    {
      IntervalElement! interval = (IntervalElement!) element;
      IExpr lowerBound = null;
      IExpr upperBound = null;

      if(! (interval.Inf is InfinitaryInt)) 
      {
        IExpr constant = this.factory.Const(interval.Inf.Value);
        lowerBound = this.factory.AtMost(constant, var);        // inf <= var 
      }
      if(! (interval.Sup is InfinitaryInt))
      {
        IExpr constant = this.factory.Const(interval.Sup.Value);
        upperBound = this.factory.AtMost(var, constant);       // var <= inf
      }

      if(lowerBound != null && upperBound != null)
        return this.factory.And(lowerBound, upperBound);        // inf <= var && var <= sup         
      else
        if(lowerBound != null)
          return lowerBound;
      else 
        if(upperBound != null)
          return upperBound;
      else      // If we reach this point, both lowerBound and upperBound are null, i.e. we have no bounds on var, so we return simply true...
          return this.factory.True;
    }    

    /// <summary>
    /// For the moment consider just equalities. Other case must be considered
    /// </summary>
    public override bool Understands(IFunctionSymbol! f, IList /*<IExpr*/ ! args)
    {          
      return f.Equals(Microsoft.AbstractInterpretationFramework.Value.Eq);
    }


    /// <summary>
    /// Evaluate the predicate passed as input according the semantics of intervals
    /// </summary>
    public override Element! EvaluatePredicate(IExpr! pred)
    {          
      return this.EvaluatePredicateWithState(pred, null);
    }
   
    /// <summary>
    /// Evaluate the predicate passed as input according the semantics of intervals and the given state.
    /// Right now just basic arithmetic operations are supported. A future extension may consider an implementation of boolean predicates 
    /// </summary>
    public override Element! EvaluatePredicateWithState(IExpr! pred, IFunctionalMap/* Var -> Element */ state)
    {
      if(pred is IFunApp)
      {
        IFunApp fun = (IFunApp) pred;
        if(fun.FunctionSymbol.Equals(Microsoft.AbstractInterpretationFramework.Value.Eq)) // if it is a symbol of equality
        {                     
          IExpr! leftArg = (IExpr!) fun.Arguments[0];
          IExpr! rightArg = (IExpr!) fun.Arguments[1];
          if (leftArg is IVariable) {
            return Eval(rightArg, state);
          } else if (rightArg is IVariable) {
            return Eval(leftArg, state);
          }
        }                
      }
      // otherwise we simply return Top
      return IntervalElement.Top;
    }

    /// <summary>
    /// Evaluate the expression (that is assured to be an arithmetic expression, in the state passed as a parameter
    /// </summary>
    private IntervalElement! Eval(IExpr! exp, IFunctionalMap/* Var -> Element */ state)
    {  

      IntervalElement! retVal = (IntervalElement!) Top;

      // Eval the expression by structural induction


      if(exp is IVariable && state != null) // A variable
      {
        object lookup = state[exp];
        if(lookup is IntervalElement)
          retVal = (IntervalElement) lookup;
        else
        {    
          retVal = (IntervalElement) Top;
        }
      }
      else if(exp is IFunApp)
      {    
        IFunApp fun = (IFunApp) exp;
        
        if(fun.FunctionSymbol is IntSymbol)   // An integer
        {
          IntSymbol intSymb =  (IntSymbol) fun.FunctionSymbol;
          BigNum val = intSymb.Value;
        
          retVal = IntervalElement.Factory(val);
        } 
        else if(fun.FunctionSymbol.Equals(Int.Negate)) // An unary minus
        {
          IExpr! arg = (IExpr!) fun.Arguments[0];
          IntervalElement! argEval = Eval(arg, state);
          IntervalElement! zero = IntervalElement.Factory(BigNum.ZERO);
          
          retVal = zero - argEval;
        }
        else if(fun.Arguments.Count == 2)
        {
          IExpr! left = (IExpr!) fun.Arguments[0];
          IExpr! right = (IExpr!) fun.Arguments[1];
          
          IntervalElement! leftVal = Eval(left, state);
          IntervalElement! rightVal = Eval(right, state);

          if(fun.FunctionSymbol.Equals(Int.Add))
            retVal = leftVal + rightVal;
          else if(fun.FunctionSymbol.Equals(Int.Sub))
            retVal = leftVal - rightVal;
          else if(fun.FunctionSymbol.Equals(Int.Mul))
            retVal = leftVal * rightVal;
          else if(fun.FunctionSymbol.Equals(Int.Div))
            retVal = leftVal / rightVal;
          else if(fun.FunctionSymbol.Equals(Int.Mod))
            retVal = leftVal % rightVal;
        }
      }  
        
      return retVal;
    }

    /// <summary> 
    /// Inner class standing for an interval on integers, possibly unbounded
    /// </summary>
    private class IntervalElement : Element 
    {
        protected static readonly IntervalElement! TopInterval = new IntervalElement(new MinusInfinity(), new PlusInfinity());    // Top    = [-oo , +oo]
        protected static readonly IntervalElement! BottomInterval = new IntervalElement(new PlusInfinity(), new MinusInfinity()); // Bottom = [+oo, -oo] 

        private readonly ExtendedInt! inf;
        private readonly ExtendedInt! sup;
        
        public ExtendedInt! Inf
        {
          get
          {
            return inf;
          }
        }
    
        public ExtendedInt! Sup
        {
          get
          {
            return sup;
          }
        }
      
        // Construct the inteval [val, val]
        protected  IntervalElement(BigNum val) 
        {
          this.inf = this.sup = ExtendedInt.Factory(val);
          // base();
        }

        // Construct the interval [inf, sup]
        protected IntervalElement(BigNum infInt, BigNum supInt)
        {
          this.inf = ExtendedInt.Factory(infInt);
          this.sup = ExtendedInt.Factory(supInt);
          // base();   // to please the compiler...
        }
              
        protected IntervalElement(ExtendedInt! inf, ExtendedInt! sup)
        {
          this.inf = inf;
          this.sup = sup;
          // base();
        }

        // Construct an Interval
        public static IntervalElement! Factory(ExtendedInt! inf, ExtendedInt! sup)
        { 
          if(inf is MinusInfinity && sup is PlusInfinity)
            return Top;
          if(inf > sup)
            return Bottom;
          // otherwise...
          return new IntervalElement(inf, sup);
        }

        public static IntervalElement! Factory(BigNum i)
        {
          return new IntervalElement(i);
        }

        public static IntervalElement! Factory(BigNum inf, BigNum sup)
        {
          ExtendedInt! i = ExtendedInt.Factory(inf);
          ExtendedInt! s = ExtendedInt.Factory(sup);

          return Factory(i, s);
        }

        static public IntervalElement! Top
        {
          get
          {
            return TopInterval;
          }
        } 

        static public IntervalElement! Bottom
        {
          get
          {
            return BottomInterval;
          }
        }

        public bool IsTop()
        {
          return this.inf is MinusInfinity && this.sup is PlusInfinity;
        }

        public bool IsBottom()
        {
          return this.inf > this.sup;
        }

        #region Below are the arithmetic operations lifted to intervals 

        // Addition
        public static IntervalElement! operator+(IntervalElement! a, IntervalElement! b) 
        {
          ExtendedInt! inf = a.inf + b.inf;
          ExtendedInt! sup = a.sup + b.sup;

          return Factory(inf, sup);
        }

         // Subtraction
        public static IntervalElement! operator-(IntervalElement! a, IntervalElement! b) 
        {             
          ExtendedInt! inf = a.inf - b.sup;
          ExtendedInt! sup = a.sup - b.inf;

          IntervalElement! sub = Factory(inf, sup);

          return sub;
        }       

        // Multiplication
        public static IntervalElement! operator*(IntervalElement! a, IntervalElement! b)
        {
          ExtendedInt! infinf = a.inf * b.inf;
          ExtendedInt! infsup = a.inf * b.sup;
          ExtendedInt! supinf = a.sup * b.inf;
          ExtendedInt! supsup = a.sup * b.sup;

          ExtendedInt! inf = ExtendedInt.Inf(infinf, infsup, supinf, supsup);
          ExtendedInt! sup = ExtendedInt.Sup(infinf, infsup, supinf, supsup);

          return Factory(inf, sup);
        }

        // Division
        public static IntervalElement! operator/(IntervalElement! a, IntervalElement! b)
        {
          if(b.inf.IsZero && b.sup.IsZero)   //  Check division by zero
            return IntervalElement.Top;

          ExtendedInt! infinf = a.inf / b.inf;
          ExtendedInt! infsup = a.inf / b.sup;
          ExtendedInt! supinf = a.sup / b.inf;
          ExtendedInt! supsup = a.sup / b.sup;

          ExtendedInt! inf = ExtendedInt.Inf(infinf, infsup, supinf, supsup);
          ExtendedInt! sup = ExtendedInt.Sup(infinf, infsup, supinf, supsup);

          return Factory(inf, sup);
        }

        // Division
        public static IntervalElement! operator%(IntervalElement! a, IntervalElement! b)
        {
          if(b.inf.IsZero && b.sup.IsZero)   //  Check division by zero
            return IntervalElement.Top;

          ExtendedInt! infinf = a.inf % b.inf;
          ExtendedInt! infsup = a.inf % b.sup;
          ExtendedInt! supinf = a.sup % b.inf;
          ExtendedInt! supsup = a.sup % b.sup;

          ExtendedInt inf = ExtendedInt.Inf(infinf, infsup, supinf, supsup);
          ExtendedInt sup = ExtendedInt.Sup(infinf, infsup, supinf, supsup);

          return Factory(inf, sup);
        }

        #endregion

        #region Overriden methods

        public override Element! Clone()
        {
          // Real copying should not be needed because intervals are immutable?
		  return this;
		  /*
          int valInf = this.inf.Value;
          int valSup = this.sup.Value;

          ExtendedInt clonedInf = ExtendedInt.Factory(valInf);
          ExtendedInt clonedSup = ExtendedInt.Factory(valSup);

          return Factory(clonedInf, clonedSup);
          */
        }

        [Pure]
        public override System.Collections.Generic.ICollection<IVariable!>! FreeVariables()
        {
          return (!) (new System.Collections.Generic.List<IVariable!>()).AsReadOnly();
        }

        [Pure]
        public override string! ToString() 
        {
          return "[" + this.inf + ", " + this.sup + "]";
        }

        #endregion
    }
}

    
  /// The interface for an extended integer
  abstract class ExtendedInt 
  {
    private static readonly PlusInfinity! cachedPlusInf = new PlusInfinity();
    private static readonly MinusInfinity! cachedMinusInf = new MinusInfinity();

    static public ExtendedInt! PlusInfinity
    {
      get
      {
        return cachedPlusInf;
      }
    }

    static public ExtendedInt! MinusInfinity
    {
      get
      {
        return cachedMinusInf;
      } 
    }

    public abstract BigNum Value { get; }

    public abstract int Signum { get; }

    public bool IsZero {
      get {
        return Signum == 0;
      }
    }

    public bool IsPositive {
      get {
        return Signum > 0;
      }
    }

    public bool IsNegative {
      get {
        return Signum < 0;
      }
    }


    #region Below are the extensions of arithmetic operations on extended integers

    // Addition
    public static ExtendedInt! operator+(ExtendedInt! a, ExtendedInt! b)
    {
        if (a is InfinitaryInt) {
          return a;
        } else if (b is InfinitaryInt) {
          return b;
        } else {
          return ExtendedInt.Factory(a.Value + b.Value);
        }
    }

    // Subtraction
    public static ExtendedInt! operator-(ExtendedInt! a, ExtendedInt! b)
    {
        if (a is InfinitaryInt) {
          return a;
        } else if (b is InfinitaryInt) {
          return UnaryMinus(b);
        } else {
          return ExtendedInt.Factory(a.Value - b.Value);
        }
    }  
  
    // Unary minus
    public static ExtendedInt! operator-(ExtendedInt! a)
    {
      // BUGBUG: Some compiler error prevents the unary minus operator from being used
      return UnaryMinus(a);
    }

    // Unary minus
    public static ExtendedInt! UnaryMinus(ExtendedInt! a)
    {
      if(a is PlusInfinity)
        return cachedMinusInf;
      if(a is MinusInfinity)
        return cachedPlusInf;
      else // a is a PureInteger
        return new PureInteger(-a.Value);
    }

    // Multiplication
    public static ExtendedInt! operator*(ExtendedInt! a, ExtendedInt! b)        
    {
        if (a.IsZero) {
          return a;
        } else if (b.IsZero) {
          return b;
        } else if (a is InfinitaryInt) {
          if (b.IsPositive) {
            return a;
          } else {
            return UnaryMinus(a);
          }
        } else if (b is InfinitaryInt) {
          if (a.IsPositive) {
            return b;
          } else {
            return UnaryMinus(b);
          }
        } else {
          return ExtendedInt.Factory(a.Value * b.Value);
        }
    }    

    // Division
    public static ExtendedInt! operator/(ExtendedInt! a, ExtendedInt! b)  
    {
        if(b.IsZero) 
        {
          return a.IsPositive? (ExtendedInt) cachedPlusInf : cachedMinusInf;
        }
        if (a is InfinitaryInt) {
          return a;
        } else if (b is InfinitaryInt) {
          return b;
        } else {
          return ExtendedInt.Factory(a.Value / b.Value);
        }
    }

    // Modulo
    public static ExtendedInt! operator%(ExtendedInt! a, ExtendedInt! b)     
    {
        if(b.IsZero) 
        {
          return a.IsPositive? (ExtendedInt) cachedPlusInf : cachedMinusInf;
        } 
        if (a is InfinitaryInt) {
          return a;
        } else if (b is InfinitaryInt) {
          return b;
        } else {
          return ExtendedInt.Factory(a.Value % b.Value);
        }
    }

    #endregion

    #region Inf and Sup operations

    public abstract int CompareTo(ExtendedInt! that);

    public static bool operator<(ExtendedInt! inf, ExtendedInt! sup)
    {
      return inf.CompareTo(sup) < 0;
    }

    public static bool operator>(ExtendedInt! inf, ExtendedInt! sup)
    {
      return inf.CompareTo(sup) > 0;
    }

    public static bool operator<=(ExtendedInt! inf, ExtendedInt! sup)
    {
      return inf.CompareTo(sup) <= 0;
    }

    public static bool operator>=(ExtendedInt! inf, ExtendedInt! sup)
      requires inf != null && sup != null;
    {
      return inf.CompareTo(sup) >= 0;
    }

    public static ExtendedInt! Inf(ExtendedInt! inf, ExtendedInt! sup)
    {
      if(inf < sup)
        return inf;
      else
        return sup;
    }

    public static ExtendedInt! Inf(ExtendedInt! a, ExtendedInt! b, ExtendedInt! c, ExtendedInt! d)
    {
      ExtendedInt! infab = Inf(a,b);
      ExtendedInt! infcd = Inf(c,d);

      return Inf(infab, infcd);
    }
  
    public static ExtendedInt! Sup(ExtendedInt! inf, ExtendedInt! sup)
    {
      if(inf > sup)
        return inf;
      else
        return sup;
    }  

    public static ExtendedInt! Sup(ExtendedInt! a, ExtendedInt! b, ExtendedInt! c, ExtendedInt! d)
    {
      ExtendedInt! supab = Sup(a,b);
      ExtendedInt! supcd = Sup(c,d);

      return Sup(supab, supcd);
    }

    #endregion

    // Return the ExtendedInt corresponding to the value
    public static ExtendedInt! Factory(BigNum val) 
    {
      return new PureInteger(val);
    }
 }

  // Stands for a normal (finite) integer x
  class  PureInteger : ExtendedInt
  {    
    public PureInteger(BigNum i)
    {
      this.val = i;
    }

    [Pure]
    public override string! ToString()
    {
      return this.Value.ToString();
    }

    private BigNum val;
    public override BigNum Value {
      get 
      {
        return this.val;
      }
    }

    public override int Signum {
		get {
			return val.Signum;
		}
	}

    public override int CompareTo(ExtendedInt! that) {
		if (that is PlusInfinity)
			return -1;
		else if (that is PureInteger)
			return this.Value.CompareTo(that.Value);
		else // then that is a MinusInfinity
			return 1;
	}
  }

  abstract class InfinitaryInt : ExtendedInt 
  {
    public override BigNum Value 
    {
      get {
        throw new InvalidOperationException();
      }
    }
  }

  class PlusInfinity : InfinitaryInt
  {
    [Pure]
    public override string! ToString()
    {
      return "+oo";
    }

    public override int Signum {
		get {
			return 1;
		}
	}

    public override int CompareTo(ExtendedInt! that) {
		if (that is PlusInfinity)
			return 0;
		else
		    return 1;
	}
  }

  class MinusInfinity : InfinitaryInt
  {
    [Pure]
    public override string! ToString()
    {
      return "-oo";
    }

    public override int Signum {
		get {
			return -1;
		}
	}

    public override int CompareTo(ExtendedInt! that) {
		if (that is MinusInfinity)
			return 0;
		else
		    return -1;
	}
  }
}