Fundamentals of Software Engineering
|
|
|
- Erica Norton
- 7 years ago
- Views:
Transcription
1 Fundamentals of Software Engineering Java Modeling Language - Part II Ina Schaefer Institute for Software Systems Engineering TU Braunschweig, Germany Slides by Wolfgang Ahrendt, Richard Bubel, Reiner Hähnle (Chalmers University of Technology, Gothenburg, Sweden) Ina Schaefer FSE 1
2 JML Expressions Java Expressions boolean JML Expressions (to be completed) each side-effect free boolean Java expression is a boolean JML expression if a and b are boolean JML expressions, and x is a variable of type t, then the following are also boolean JML expressions:!a ( not a ) a && b ( a and b ) a b ( a or b ) Ina Schaefer FSE 2
3 JML Expressions Java Expressions boolean JML Expressions (to be completed) each side-effect free boolean Java expression is a boolean JML expression if a and b are boolean JML expressions, and x is a variable of type t, then the following are also boolean JML expressions:!a ( not a ) a && b ( a and b ) a b ( a or b ) a ==> b ( a implies b ) a <==> b ( a is equivalent to b ) Ina Schaefer FSE 3
4 Beyond boolean Java expressions How to express the following? an array arr only holds values 2 the variable m holds the maximum entry of array arr all Account objects in the array accountproxies are stored at the index corresponding to their respective accountnumber field all created instances of class BankCard have different cardnumbers Ina Schaefer FSE 4
5 First-order Logic in JML Expressions JML boolean expressions extend Java boolean expressions by: implication equivalence quantification Ina Schaefer FSE 5
6 boolean JML Expressions boolean JML expressions are defined recursively: boolean JML Expressions each side-effect free boolean Java expression is a boolean JML expression if a and b are boolean JML expressions, and x is a variable of type t, then the following are also boolean JML expressions:!a ( not a ) a && b ( a and b ) a b ( a or b ) a ==> b ( a implies b ) a <==> b ( a is equivalent to b ) (\forall t x; a) ( for all x of type t, a is true ) (\exists t x; a) ( there exists x of type t such that a ) Ina Schaefer FSE 6
7 boolean JML Expressions boolean JML expressions are defined recursively: boolean JML Expressions each side-effect free boolean Java expression is a boolean JML expression if a and b are boolean JML expressions, and x is a variable of type t, then the following are also boolean JML expressions:!a ( not a ) a && b ( a and b ) a b ( a or b ) a ==> b ( a implies b ) a <==> b ( a is equivalent to b ) (\forall t x; a) ( for all x of type t, a is true ) (\exists t x; a) ( there exists x of type t such that a ) (\forall t x; a; b) ( for all x of type t fulfilling a, b is true ) (\exists t x; a; b) ( there exists an x of type t fulfilling a, such that b ) Ina Schaefer FSE 7
8 JML Quantifiers in (\forall t x; a; b) (\exists t x; a; b) a called range predicate Ina Schaefer FSE 8
9 JML Quantifiers in (\forall t x; a; b) (\exists t x; a; b) a called range predicate those forms are redundant: (\forall t x; a; b) equivalent to (\forall t x; a ==> b) (\exists t x; a; b) equivalent to (\exists t x; a && b) Ina Schaefer FSE 9
10 Pragmatics of Range Predicates (\forall t x; a; b) and (\exists t x; a; b) widely used pragmatics of range predicate: a used to restrict range of x further than t Ina Schaefer FSE 10
11 Pragmatics of Range Predicates (\forall t x; a; b) and (\exists t x; a; b) widely used pragmatics of range predicate: a used to restrict range of x further than t example: arr is sorted at indexes between 0 and 9 : Ina Schaefer FSE 11
12 Pragmatics of Range Predicates (\forall t x; a; b) and (\exists t x; a; b) widely used pragmatics of range predicate: a used to restrict range of x further than t example: arr is sorted at indexes between 0 and 9 : (\forall int i,j; Ina Schaefer FSE 12
13 Pragmatics of Range Predicates (\forall t x; a; b) and (\exists t x; a; b) widely used pragmatics of range predicate: a used to restrict range of x further than t example: arr is sorted at indexes between 0 and 9 : (\forall int i,j; 0<=i && i<j && j<10; Ina Schaefer FSE 13
14 Pragmatics of Range Predicates (\forall t x; a; b) and (\exists t x; a; b) widely used pragmatics of range predicate: a used to restrict range of x further than t example: arr is sorted at indexes between 0 and 9 : (\forall int i,j; 0<=i && i<j && j<10; arr[i] <= arr[j]) Ina Schaefer FSE 14
15 Using Quantified JML expressions How to express: an array arr only holds values 2 Ina Schaefer FSE 15
16 Using Quantified JML expressions How to express: an array arr only holds values 2 (\forall int i; Ina Schaefer FSE 16
17 Using Quantified JML expressions How to express: an array arr only holds values 2 (\forall int i; 0<=i && i<arr.length; Ina Schaefer FSE 17
18 Using Quantified JML expressions How to express: an array arr only holds values 2 (\forall int i; 0<=i && i<arr.length; arr[i] <= 2) Ina Schaefer FSE 18
19 Using Quantified JML expressions How to express: the variable m holds the maximum entry of array arr Ina Schaefer FSE 19
20 Using Quantified JML expressions How to express: the variable m holds the maximum entry of array arr (\forall int i; 0<=i && i<arr.length; m >= arr[i]) Ina Schaefer FSE 20
21 Using Quantified JML expressions How to express: the variable m holds the maximum entry of array arr (\forall int i; 0<=i && i<arr.length; m >= arr[i]) is this enough? Ina Schaefer FSE 21
22 Using Quantified JML expressions How to express: the variable m holds the maximum entry of array arr (\forall int i; 0<=i && i<arr.length; m >= arr[i]) (\exists int i; 0<=i && i<arr.length; m == arr[i]) Ina Schaefer FSE 22
23 Using Quantified JML expressions How to express: the variable m holds the maximum entry of array arr (\forall int i; 0<=i && i<arr.length; m >= arr[i]) arr.length>0 ==> (\exists int i; 0<=i && i<arr.length; m == arr[i]) Ina Schaefer FSE 23
24 Using Quantified JML expressions How to express: all Account objects in the array accountproxies are stored at the index corresponding to their respective accountnumber field Ina Schaefer FSE 24
25 Using Quantified JML expressions How to express: all Account objects in the array accountproxies are stored at the index corresponding to their respective accountnumber field (\forall int i; 0<=i && i<maxaccountnumber; accountproxies[i].accountnumber == i ) Ina Schaefer FSE 25
26 Using Quantified JML expressions How to express: all created instances of class BankCard have different cardnumbers Ina Schaefer FSE 26
27 Using Quantified JML expressions How to express: all created instances of class BankCard have different cardnumbers (\forall BankCard p1, p2; \created(p1) && \created(p2); p1!= p2 ==> p1.cardnumber!= p2.cardnumber) Ina Schaefer FSE 27
28 Using Quantified JML expressions How to express: all created instances of class BankCard have different cardnumbers (\forall BankCard p1, p2; \created(p1) && \created(p2); p1!= p2 ==> p1.cardnumber!= p2.cardnumber) note: JML quantifiers range also over non-created objects Ina Schaefer FSE 28
29 Using Quantified JML expressions How to express: all created instances of class BankCard have different cardnumbers (\forall BankCard p1, p2; \created(p1) && \created(p2); p1!= p2 ==> p1.cardnumber!= p2.cardnumber) note: JML quantifiers range also over non-created objects same for quantifiers in KeY! Ina Schaefer FSE 29
30 Using Quantified JML expressions How to express: all created instances of class BankCard have different cardnumbers (\forall BankCard p1, p2; \created(p1) && \created(p2); p1!= p2 ==> p1.cardnumber!= p2.cardnumber) note: JML quantifiers range also over non-created objects same for quantifiers in KeY! in JML, restrict to created objects with \created Ina Schaefer FSE 30
31 Using Quantified JML expressions How to express: all created instances of class BankCard have different cardnumbers (\forall BankCard p1, p2; \created(p1) && \created(p2); p1!= p2 ==> p1.cardnumber!= p2.cardnumber) note: JML quantifiers range also over non-created objects same for quantifiers in KeY! in JML, restrict to created objects with \created in KeY? Ina Schaefer FSE 31
32 Using Quantified JML expressions How to express: all created instances of class BankCard have different cardnumbers (\forall BankCard p1, p2; \created(p1) && \created(p2); p1!= p2 ==> p1.cardnumber!= p2.cardnumber) note: JML quantifiers range also over non-created objects same for quantifiers in KeY! in JML, restrict to created objects with \created in KeY? ( coming lecture) Ina Schaefer FSE 32
33 Example: Specifying LimitedIntegerSet public class LimitedIntegerSet { public final int limit; private int arr[]; private int size = 0; public LimitedIntegerSet(int limit) { this.limit = limit; this.arr = new int[limit]; } public boolean add(int elem) {/*...*/} public void remove(int elem) {/*...*/} public boolean contains(int elem) {/*...*/} // other methods } Ina Schaefer FSE 33
34 Prerequisites: Adding Specification Modifiers public class LimitedIntegerSet { public final int limit; private /*@ int arr[]; private /*@ int size = 0; public LimitedIntegerSet(int limit) { this.limit = limit; this.arr = new int[limit]; } public boolean add(int elem) {/*...*/} public void remove(int elem) {/*...*/} public /*@ boolean contains(int elem) {/*...*/} // other methods } Ina Schaefer FSE 34
35 Specifying contains() public boolean contains(int elem) {/*...*/} Ina Schaefer FSE 35
36 Specifying contains() public boolean contains(int elem) {/*...*/} has no effect on state Ina Schaefer FSE 36
37 Specifying contains() public boolean contains(int elem) {/*...*/} has no effect on state how to specify result value? Ina Schaefer FSE 37
38 Result Values in Postcondition In postconditions, one can use \result to refer to the return value of the method. public ensures \result == Ina Schaefer FSE 38
39 Result Values in Postcondition In postconditions, one can use \result to refer to the return value of the method. public ensures \result == (\exists int Ina Schaefer FSE 39
40 Result Values in Postcondition In postconditions, one can use \result to refer to the return value of the method. public ensures \result == (\exists int 0 <= i && i < Ina Schaefer FSE 40
41 Result Values in Postcondition In postconditions, one can use \result to refer to the return value of the method. public ensures \result == (\exists int 0 <= i && i < arr[i] == public /*@ boolean contains(int elem) {/*...*/} Ina Schaefer FSE 41
42 Specifying add() (spec-case1) public requires size < limit ensures \result == ensures ensures (\forall int e!= contains(e) <==> ensures size == \old(size) @ public boolean add(int elem) {/*...*/} Ina Schaefer FSE 42
43 Specifying add() (spec-case2) public requires (size == limit) ensures \result == ensures (\forall int contains(e) <==> ensures size == public boolean add(int elem) {/*...*/} Ina Schaefer FSE 43
44 Specifying remove() public ensures (\forall int e!= contains(e) <==> ensures ==> size == \old(size) - ==> size == public void remove(int elem) {/*...*/} Ina Schaefer FSE 44
45 Specifying Data Constraints So far: JML used to specify method specifics. Ina Schaefer FSE 45
46 Specifying Data Constraints So far: JML used to specify method specifics. How to specify constraints on class data? Ina Schaefer FSE 46
47 Specifying Data Constraints So far: JML used to specify method specifics. How to specify constraints on class data, e.g.: consistency of redundant data representations (like indexing) restrictions for efficiency (like sortedness) Ina Schaefer FSE 47
48 Specifying Data Constraints So far: JML used to specify method specifics. How to specify constraints on class data, e.g.: consistency of redundant data representations (like indexing) restrictions for efficiency (like sortedness) data constraints are global: all methods must preserve them Ina Schaefer FSE 48
49 Consider LimitedSortedIntegerSet public class LimitedSortedIntegerSet { public final int limit; private int arr[]; private int size = 0; public LimitedSortedIntegerSet(int limit) { this.limit = limit; this.arr = new int[limit]; } public boolean add(int elem) {/*...*/} public void remove(int elem) {/*...*/} public boolean contains(int elem) {/*...*/} // other methods } Ina Schaefer FSE 49
50 Consequence of Sortedness for Implementations method contains can employ binary search (logarithmic complexity) Ina Schaefer FSE 50
51 Consequence of Sortedness for Implementations method contains can employ binary search (logarithmic complexity) why is that sufficient? Ina Schaefer FSE 51
52 Consequence of Sortedness for Implementations method contains can employ binary search (logarithmic complexity) why is that sufficient? it assumes sortedness in pre-state Ina Schaefer FSE 52
53 Consequence of Sortedness for Implementations method contains can employ binary search (logarithmic complexity) why is that sufficient? it assumes sortedness in pre-state method add searches first index with bigger element, inserts just before that Ina Schaefer FSE 53
54 Consequence of Sortedness for Implementations method contains can employ binary search (logarithmic complexity) why is that sufficient? it assumes sortedness in pre-state method add searches first index with bigger element, inserts just before that thereby tries to establish sortedness in post-state Ina Schaefer FSE 54
55 Consequence of Sortedness for Implementations method contains can employ binary search (logarithmic complexity) why is that sufficient? it assumes sortedness in pre-state method add searches first index with bigger element, inserts just before that thereby tries to establish sortedness in post-state why is that sufficient? Ina Schaefer FSE 55
56 Consequence of Sortedness for Implementations method contains can employ binary search (logarithmic complexity) why is that sufficient? it assumes sortedness in pre-state method add searches first index with bigger element, inserts just before that thereby tries to establish sortedness in post-state why is that sufficient? it assumes sortedness in pre-state Ina Schaefer FSE 56
57 Consequence of Sortedness for Implementations method contains can employ binary search (logarithmic complexity) why is that sufficient? it assumes sortedness in pre-state method add searches first index with bigger element, inserts just before that thereby tries to establish sortedness in post-state why is that sufficient? it assumes sortedness in pre-state method remove (accordingly) Ina Schaefer FSE 57
58 Specifying Sortedness with JML recall class fields: public final int limit; private int arr[]; private int size = 0; sortedness as JML expression: Ina Schaefer FSE 58
59 Specifying Sortedness with JML recall class fields: public final int limit; private int arr[]; private int size = 0; sortedness as JML expression: (\forall int i; 0 < i && i < size; arr[i-1] <= arr[i]) Ina Schaefer FSE 59
60 Specifying Sortedness with JML recall class fields: public final int limit; private int arr[]; private int size = 0; sortedness as JML expression: (\forall int i; 0 < i && i < size; arr[i-1] <= arr[i]) (what s the value of this if size < 2?) Ina Schaefer FSE 60
61 Specifying Sorted contains() can assume sortedness of pre-state Ina Schaefer FSE 61
62 Specifying Sorted contains() can assume sortedness of pre-state public requires (\forall int i; 0 < i && i < arr[i-1] <= ensures \result == (\exists int 0 <= i && i < arr[i] == public /*@ boolean contains(int elem) {/*...*/} Ina Schaefer FSE 62
63 Specifying Sorted contains() can assume sortedness of pre-state public requires (\forall int i; 0 < i && i < arr[i-1] <= ensures \result == (\exists int 0 <= i && i < arr[i] == public /*@ boolean contains(int elem) {/*...*/} contains() is pure sortedness of post-state trivially ensured Ina Schaefer FSE 63
64 Specifying Sorted remove() can assume sortedness of pre-state must ensure sortedness of post-state public requires (\forall int i; 0 < i && i < arr[i-1] <= ensures (\forall int e!= contains(e) <==> ensures ==> size == \old(size) - ==> size == ensures (\forall int i; 0 < i && i < arr[i-1] <= public void remove(int elem) {/*...*/} Ina Schaefer FSE 64
65 Specifying Sorted add() (spec-case1) public requires (\forall int i; 0 < i && i < arr[i-1] <= requires size < limit ensures \result == ensures ensures (\forall int e!= contains(e) <==> ensures size == \old(size) + ensures (\forall int i; 0 < i && i < arr[i-1] also public boolean add(int elem) {/*...*/} Ina Schaefer FSE 65
66 Specifying Sorted add() (spec-case2) public requires (\forall int i; 0 < i && i < arr[i-1] <= requires (size == limit) ensures \result == ensures (\forall int contains(e) <==> ensures size == ensures (\forall int i; 0 < i && i < arr[i-1] <= public boolean add(int elem) {/*...*/} Ina Schaefer FSE 66
67 Factor out Sortedness so far: sortedness has swamped our specification Ina Schaefer FSE 67
68 Factor out Sortedness so far: sortedness has swamped our specification we can do better, using JML Class Invariant construct for specifying data constraints centrally Ina Schaefer FSE 68
69 Factor out Sortedness so far: sortedness has swamped our specification we can do better, using JML Class Invariant construct for specifying data constraints centrally 1. delete blue and red parts from previous slides 2. add sortedness as JML class invariant instead Ina Schaefer FSE 69
70 JML Class Invariant public class LimitedSortedIntegerSet { public final int limit; } /*@ public invariant (\forall int 0 < i && i < arr[i-1] <= private /*@ int arr[]; private /*@ int size = 0; // constructor and methods, // without sortedness in pre/post-conditions Ina Schaefer FSE 70
71 JML Class Invariant JML class invariant can be placed anywhere in class (contrast: method contract must be in front of its method) custom to place class invariant in front of fields it talks about Ina Schaefer FSE 71
72 Instance vs. Static Invariants instance invariants can refer to instance fields of this object (unqualified, like size, or qualified with this, like this.size ) JML syntax: instance invariant Ina Schaefer FSE 72
73 Instance vs. Static Invariants instance invariants can refer to instance fields of this object (unqualified, like size, or qualified with this, like this.size ) JML syntax: instance invariant static invariants cannot refer to instance fields of this object JML syntax: static invariant Ina Schaefer FSE 73
74 Instance vs. Static Invariants instance invariants can refer to instance fields of this object (unqualified, like size, or qualified with this, like this.size ) JML syntax: instance invariant static invariants cannot refer to instance fields of this object JML syntax: static invariant both can refer to static fields instance fields via explicit reference, like o.size Ina Schaefer FSE 74
75 Instance vs. Static Invariants instance invariants can refer to instance fields of this object (unqualified, like size, or qualified with this, like this.size ) JML syntax: instance invariant static invariants cannot refer to instance fields of this object JML syntax: static invariant both can refer to static fields instance fields via explicit reference, like o.size in classes: instance is default(static in interfaces) if instance or static is omitted instance invariant! Ina Schaefer FSE 75
76 Static JML Invariant Example public class BankCard { /*@ public static (\forall BankCard p1, \created(p1) && p1!=p2 ==> private /*@ int cardnumber; // rest of class follows } Ina Schaefer FSE 76
77 Recall Specification of enterpin() private BankCard insertedcard = null; private /*@ int wrongpincounter = 0; private /*@ boolean customerauthenticated = false; /*@ <spec-case1> also <spec-case2> also public void enterpin (int pin) {... Ina Schaefer FSE 77
78 Recall Specification of enterpin() private BankCard insertedcard = null; private /*@ int wrongpincounter = 0; private /*@ boolean customerauthenticated = false; /*@ <spec-case1> also <spec-case2> also public void enterpin (int pin) {... last lecture: all 3 spec-cases were normal_behavior Ina Schaefer FSE 78
79 Specifying Exceptional Behavior of Methods normal_behavior specification case, with preconditions P, forbids method to throw exceptions if pre-state satisfies P Ina Schaefer FSE 79
80 Specifying Exceptional Behavior of Methods normal_behavior specification case, with preconditions P, forbids method to throw exceptions if pre-state satisfies P exceptional_behavior specification case, with preconditions P, requires method to throw exceptions if pre-state satisfies P Ina Schaefer FSE 80
81 Specifying Exceptional Behavior of Methods normal_behavior specification case, with preconditions P, forbids method to throw exceptions if pre-state satisfies P exceptional_behavior specification case, with preconditions P, requires method to throw exceptions if pre-state satisfies P keyword signals specifies post-state, depending on thrown exception Ina Schaefer FSE 81
82 Specifying Exceptional Behavior of Methods normal_behavior specification case, with preconditions P, forbids method to throw exceptions if pre-state satisfies P exceptional_behavior specification case, with preconditions P, requires method to throw exceptions if pre-state satisfies P keyword signals specifies post-state, depending on thrown exception keyword signals_only limits types of thrown exception Ina Schaefer FSE 82
83 Completing Specification of enterpin() <spec-case1> also <spec-case2> also public requires signals_only signals public void enterpin (int pin) {... Ina Schaefer FSE 83
84 Completing Specification of enterpin() <spec-case1> also <spec-case2> also public requires signals_only signals public void enterpin (int pin) {... in case insertedcard==null in pre-state an exception must be thrown it can only be an ATMException ( exceptional_behavior ) ( signals_only ) method must then ensure!customerauthenticated in post-state ( signals ) Ina Schaefer FSE 84
85 signals_only Clause: General Case an exceptional specification case can have one clause of the form signals_only (E1,..., En); where E1,..., En are exception types Ina Schaefer FSE 85
86 signals_only Clause: General Case an exceptional specification case can have one clause of the form signals_only (E1,..., En); where E1,..., En are exception types Meaning: if an exception is thrown, it is of type E1 or... or En Ina Schaefer FSE 86
87 signals Clause: General Case an exceptional specification case can have several clauses of the form signals (E) b; where E is exception type, b is boolean expression Ina Schaefer FSE 87
88 signals Clause: General Case an exceptional specification case can have several clauses of the form signals (E) b; where E is exception type, b is boolean expression Meaning: if an exception of type E is thrown, b holds in post condition Ina Schaefer FSE 88
89 Allowing Non-Termination by default, both: normal_behavior exceptional_behavior specification cases enforce termination Ina Schaefer FSE 89
90 Allowing Non-Termination by default, both: normal_behavior exceptional_behavior specification cases enforce termination in each specification case, non-termination can be permitted via the clause diverges true; Ina Schaefer FSE 90
91 Allowing Non-Termination by default, both: normal_behavior exceptional_behavior specification cases enforce termination in each specification case, non-termination can be permitted via the clause diverges true; Meaning: given the precondition of the specification case holds in pre-state, the method may or may not terminate Ina Schaefer FSE 91
92 Further Modifiers: non_null and nullable JML extends the Java modifiers by further modifiers: class fields method parameters method return types can be declared as nullable: may or may not be null non_null: must not be null Ina Schaefer FSE 92
93 non_null: Examples private spec_public String name; implicit invariant public invariant name!= null; added to class public void BankCard card) {.. implicit precondition requires card!= null; added to each specification case of insertcard public String tostring() implicit postcondition ensures \result!= null; added to each specification case of tostring Ina Schaefer FSE 93
94 non_null is default in JML! same effect even without explicit non null s private /*@ String name; implicit invariant public invariant name!= null; added to class public void insertcard(bankcard card) {.. implicit precondition requires card!= null; added to each specification case of insertcard public String tostring() implicit postcondition ensures \result!= null; added to each specification case of tostring Ina Schaefer FSE 94
95 nullable: Examples To prevent such pre/post-conditions and invariants: nullable private spec_public String name; no implicit invariant added public void BankCard card) {.. no implicit precondition added public String tostring() no implicit postcondition added to specification cases of tostring Ina Schaefer FSE 95
96 LinkedList: non_null or nullable? public class LinkedList { private Object elem; private LinkedList next;... In JML this means: Ina Schaefer FSE 96
97 LinkedList: non_null or nullable? public class LinkedList { private Object elem; private LinkedList next;... In JML this means: all elements in the list are non_null Ina Schaefer FSE 97
98 LinkedList: non_null or nullable? public class LinkedList { private Object elem; private LinkedList next;... In JML this means: all elements in the list are non_null the list is cyclic, or infinite! Ina Schaefer FSE 98
99 LinkedList: non_null or nullable? Repair: public class LinkedList { private Object elem; private /*@ LinkedList next;... Now, the list is allowed to end somewhere! Ina Schaefer FSE 99
100 Final Remark on non_null and nullable non_null as default in JML only since a few years. Older JML tutorial or articles may not use the non null by default semantics. Ina Schaefer FSE 100
101 JML and Inheritance All JML contracts, i.e. specification cases class invariants are inherited down from superclasses to subclasses. A class has to fulfill all contracts of its superclasses. in addition, the subclass may add further specification cases, starting with also: public void method () {... Ina Schaefer FSE 101
102 Tools Many tools support JML (see On the course website you find a link how to install a JML checker for eclipse that works with newer Java versions. Ina Schaefer FSE 102
103 Literature for this Lecture essential reading: in KeY Book A. Roth and Peter H. Schmitt: Formal Specification. Chapter 5 only sections 5.1, 5.3, In: B. Beckert, R. Hähnle, and P. Schmitt, editors. Verification of Object-Oriented Software: The KeY Approach, vol 4334 of LNCS. Springer, further reading, all available at JML Reference Manual Gary T. Leavens, Erik Poll, Curtis Clifton, Yoonsik Cheon, Clyde Ruby, David Cok, Peter Müller, and Joseph Kiniry. JML Reference Manual JML Tutorial Gary T. Leavens, Yoonsik Cheon. Design by Contract with JML JML Overview Gary T. Leavens, Albert L. Baker, and Clyde Ruby. JML: A Notation for Detailed Design Ina Schaefer FSE 103
Rigorous Software Development CSCI-GA 3033-009
Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 5 Disclaimer. These notes are derived from notes originally developed by Joseph Kiniry, Gary Leavens, Erik Poll,
StaRVOOrS: A Tool for Combined Static and Runtime Verification of Java
StaRVOOrS: A Tool for Combined Static and Runtime Verification of Java Jesús Mauricio Chimento 1, Wolfgang Ahrendt 1, Gordon J. Pace 2, and Gerardo Schneider 3 1 Chalmers University of Technology, Sweden.
Fully Abstract Operation Contracts
Fully Abstract Operation Contracts Richard Bubel, Reiner Hähnle, and Maria Pelevina Department of Computer Science Technical University of Darmstadt bubel haehnle@cs.tu-darmstadt.de m.pelevina@gmail.com
Fundamentals of Software Engineering
Fundamentals of Software Engineering Model Checking with Temporal Logic Ina Schaefer Institute for Software Systems Engineering TU Braunschweig, Germany Slides by Wolfgang Ahrendt, Richard Bubel, Reiner
Formal Engineering for Industrial Software Development
Shaoying Liu Formal Engineering for Industrial Software Development Using the SOFL Method With 90 Figures and 30 Tables Springer Contents Introduction 1 1.1 Software Life Cycle... 2 1.2 The Problem 4 1.3
Software Engineering Techniques
Software Engineering Techniques Low level design issues for programming-in-the-large. Software Quality Design by contract Pre- and post conditions Class invariants Ten do Ten do nots Another type of summary
Using JML to protect Java code against SQL injection. Johan Janssen 0213888 jjanssen@sci.ru.nl June 26, 2007
Using JML to protect Java code against SQL injection Johan Janssen 0213888 jjanssen@sci.ru.nl June 26, 2007 1 Abstract There are a lot of potential solutions against SQL injection. The problem is that
Programming by Contract. Programming by Contract: Motivation. Programming by Contract: Preconditions and Postconditions
COMP209 Object Oriented Programming Designing Classes 2 Mark Hall Programming by Contract (adapted from slides by Mark Utting) Preconditions Postconditions Class invariants Programming by Contract An agreement
Reasoning about Safety Critical Java
Reasoning about Safety Critical Java Chris Marriott 27 th January 2011 Motivation Safety critical systems are becoming part of everyday life Failure can potentially lead to serious consequences Verification
Unified Static and Runtime Verification of Object-Oriented Software
Unified Static and Runtime Verification of Object-Oriented Software Wolfgang Ahrendt 1, Mauricio Chimento 1, Gerardo Schneider 2, Gordon J. Pace 3 1 Chalmers University of Technology, Gothenburg, Sweden
Java Programming Language
Lecture 1 Part II Java Programming Language Additional Features and Constructs Topics in Quantitative Finance: Numerical Solutions of Partial Differential Equations Instructor: Iraj Kani Subclasses and
Introduction to Programming System Design. CSCI 455x (4 Units)
Introduction to Programming System Design CSCI 455x (4 Units) Description This course covers programming in Java and C++. Topics include review of basic programming concepts such as control structures,
Code Contracts User Manual
Code Contracts User Manual Microsoft Corporation August 14, 2013 What s New? We fixed the debug information generated by the rewriter for async and iterator methods so that locals now appear again when
Chapter 13 - Inheritance
Goals Chapter 13 - Inheritance To learn about inheritance To understand how to inherit and override superclass methods To be able to invoke superclass constructors To learn about protected and package
Masters programmes in Computer Science and Information Systems. Object-Oriented Design and Programming. Sample module entry test xxth December 2013
Masters programmes in Computer Science and Information Systems Object-Oriented Design and Programming Sample module entry test xxth December 2013 This sample paper has more questions than the real paper
Rigorous Software Development CSCI-GA 3033-009
Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical
Data Structures and Algorithms
Data Structures and Algorithms CS245-2016S-05 Abstract Data Types and Lists David Galles Department of Computer Science University of San Francisco 05-0: Abstract Data Types Recall that an Abstract Data
Computing Concepts with Java Essentials
2008 AGI-Information Management Consultants May be used for personal purporses only or by libraries associated to dandelon.com network. Computing Concepts with Java Essentials 3rd Edition Cay Horstmann
Vérification de bytecode et ses applications
Thèse de Doctorat Préparée pour obtenir le titre de Docteur en Sciences de l Université de Nice Sophia Antipolis Discipline : Informatique Préparée à l Institut National de Recherche en Informatique et
Java 6 'th. Concepts INTERNATIONAL STUDENT VERSION. edition
Java 6 'th edition Concepts INTERNATIONAL STUDENT VERSION CONTENTS PREFACE vii SPECIAL FEATURES xxviii chapter i INTRODUCTION 1 1.1 What Is Programming? 2 J.2 The Anatomy of a Computer 3 1.3 Translating
Unit-testing with JML
Métodos Formais em Engenharia de Software Unit-testing with JML José Carlos Bacelar Almeida Departamento de Informática Universidade do Minho MI/MEI 2008/2009 1 Talk Outline Unit Testing - software testing
CompSci-61B, Data Structures Final Exam
Your Name: CompSci-61B, Data Structures Final Exam Your 8-digit Student ID: Your CS61B Class Account Login: This is a final test for mastery of the material covered in our labs, lectures, and readings.
Lecture Notes on Linear Search
Lecture Notes on Linear Search 15-122: Principles of Imperative Computation Frank Pfenning Lecture 5 January 29, 2013 1 Introduction One of the fundamental and recurring problems in computer science is
Class 32: The Java Collections Framework
Introduction to Computation and Problem Solving Class 32: The Java Collections Framework Prof. Steven R. Lerman and Dr. V. Judson Harward Goals To introduce you to the data structure classes that come
Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science. Unit of Study / Textbook Correlation
Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science updated 03/08/2012 Unit 1: JKarel 8 weeks http://www.fcps.edu/is/pos/documents/hs/compsci.htm
Object-Oriented Design Lecture 4 CSU 370 Fall 2007 (Pucella) Tuesday, Sep 18, 2007
Object-Oriented Design Lecture 4 CSU 370 Fall 2007 (Pucella) Tuesday, Sep 18, 2007 The Java Type System By now, you have seen a fair amount of Java. Time to study in more depth the foundations of the language,
An Overview of JML Tools and Applications
This article appears in Software Tools for Technology Transfer. The original version is available at www.springerlink.com An overview of JML tools and applications Lilian Burdy 1, Yoonsik Cheon 2, David
Java SE 8 Programming
Oracle University Contact Us: 1.800.529.0165 Java SE 8 Programming Duration: 5 Days What you will learn This Java SE 8 Programming training covers the core language features and Application Programming
Software Engineering
Software Engineering Lecture 04: The B Specification Method Peter Thiemann University of Freiburg, Germany SS 2013 Peter Thiemann (Univ. Freiburg) Software Engineering SWT 1 / 50 The B specification method
How To Write A Test Engine For A Microsoft Microsoft Web Browser (Php) For A Web Browser For A Non-Procedural Reason)
Praspel: A Specification Language for Contract-Driven Testing in PHP Ivan Enderlin Frédéric Dadeau Alain Giorgetti Abdallah Ben Othman October 27th, 2011 Meetings: LTP MTVV Ivan Enderlin, Frédéric Dadeau,
Object Invariants in Dynamic Contexts
Object Invariants in Dynamic Contexts K. Rustan M. Leino 1 and Peter Müller 2 1 Microsoft Research, Redmond, WA, USA, leino@microsoft.com 2 ETH Zurich, Switzerland, peter.mueller@inf.ethz.ch Abstract.
CMSC 202H. ArrayList, Multidimensional Arrays
CMSC 202H ArrayList, Multidimensional Arrays What s an Array List ArrayList is a class in the standard Java libraries that can hold any type of object an object that can grow and shrink while your program
Java Interfaces. Recall: A List Interface. Another Java Interface Example. Interface Notes. Why an interface construct? Interfaces & Java Types
Interfaces & Java Types Lecture 10 CS211 Fall 2005 Java Interfaces So far, we have mostly talked about interfaces informally, in the English sense of the word An interface describes how a client interacts
Appendix... B. The Object Constraint
UML 2.0 in a Nutshell Appendix B. The Object Constraint Pub Date: June 2005 Language The Object Constraint Language 2.0 (OCL) is an addition to the UML 2.0 specification that provides you with a way to
Java Interview Questions and Answers
1. What is the most important feature of Java? Java is a platform independent language. 2. What do you mean by platform independence? Platform independence means that we can write and compile the java
Getting Started with the Internet Communications Engine
Getting Started with the Internet Communications Engine David Vriezen April 7, 2014 Contents 1 Introduction 2 2 About Ice 2 2.1 Proxies................................. 2 3 Setting Up ICE 2 4 Slices 2
Design by Contract beyond class modelling
Design by Contract beyond class modelling Introduction Design by Contract (DbC) or Programming by Contract is an approach to designing software. It says that designers should define precise and verifiable
A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:
Binary Search Trees 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will)
SQL DATA DEFINITION: KEY CONSTRAINTS. CS121: Introduction to Relational Database Systems Fall 2015 Lecture 7
SQL DATA DEFINITION: KEY CONSTRAINTS CS121: Introduction to Relational Database Systems Fall 2015 Lecture 7 Data Definition 2 Covered most of SQL data manipulation operations Continue exploration of SQL
Facebook Twitter YouTube Google Plus Website Email
PHP MySQL COURSE WITH OOP COURSE COVERS: PHP MySQL OBJECT ORIENTED PROGRAMMING WITH PHP SYLLABUS PHP 1. Writing PHP scripts- Writing PHP scripts, learn about PHP code structure, how to write and execute
Case studies: Outline. Requirement Engineering. Case Study: Automated Banking System. UML and Case Studies ITNP090 - Object Oriented Software Design
I. Automated Banking System Case studies: Outline Requirements Engineering: OO and incremental software development 1. case study: withdraw money a. use cases b. identifying class/object (class diagram)
Inductive Verification of Data Model Invariants for Web Applications
Inductive Verification of Data Model Invariants for Web Applications Ivan Bocić and Tevfik Bultan Department of Computer Science University of California, Santa Barbara, USA {bo,bultan}@cs.ucsb.edu ABSTRACT
Lecture 9. Semantic Analysis Scoping and Symbol Table
Lecture 9. Semantic Analysis Scoping and Symbol Table Wei Le 2015.10 Outline Semantic analysis Scoping The Role of Symbol Table Implementing a Symbol Table Semantic Analysis Parser builds abstract syntax
AP Computer Science Java Subset
APPENDIX A AP Computer Science Java Subset The AP Java subset is intended to outline the features of Java that may appear on the AP Computer Science A Exam. The AP Java subset is NOT intended as an overall
The C Programming Language course syllabus associate level
TECHNOLOGIES The C Programming Language course syllabus associate level Course description The course fully covers the basics of programming in the C programming language and demonstrates fundamental programming
Quotes from Object-Oriented Software Construction
Quotes from Object-Oriented Software Construction Bertrand Meyer Prentice-Hall, 1988 Preface, p. xiv We study the object-oriented approach as a set of principles, methods and tools which can be instrumental
Programming Languages Featherweight Java David Walker
Programming Languages Featherweight Java David Walker Overview Featherweight Java (FJ), a minimal Javalike language. Models inheritance and subtyping. Immutable objects: no mutation of fields. Trivialized
CSC 742 Database Management Systems
CSC 742 Database Management Systems Topic #4: Data Modeling Spring 2002 CSC 742: DBMS by Dr. Peng Ning 1 Phases of Database Design Requirement Collection/Analysis Functional Requirements Functional Analysis
Software Testing. Definition: Testing is a process of executing a program with data, with the sole intention of finding errors in the program.
Software Testing Definition: Testing is a process of executing a program with data, with the sole intention of finding errors in the program. Testing can only reveal the presence of errors and not the
Statically Checking API Protocol Conformance with Mined Multi-Object Specifications Companion Report
Statically Checking API Protocol Conformance with Mined Multi-Object Specifications Companion Report Michael Pradel 1, Ciera Jaspan 2, Jonathan Aldrich 2, and Thomas R. Gross 1 1 Department of Computer
The Advantages and Disadvantages of Using Natural Language Documentation
The Future of Library Specification Gary T. Leavens University of Central Florida Orlando, FL, USA leavens@eecs.ucf.edu ABSTRACT Programming language technology has started to achieve one of the dreams
Course: Programming II - Abstract Data Types. The ADT Stack. A stack. The ADT Stack and Recursion Slide Number 1
Definition Course: Programming II - Abstract Data Types The ADT Stack The ADT Stack is a linear sequence of an arbitrary number of items, together with access procedures. The access procedures permit insertions
Lecture Notes on Binary Search Trees
Lecture Notes on Binary Search Trees 15-122: Principles of Imperative Computation Frank Pfenning Lecture 17 March 17, 2010 1 Introduction In the previous two lectures we have seen how to exploit the structure
Concepts and terminology in the Simula Programming Language
Concepts and terminology in the Simula Programming Language An introduction for new readers of Simula literature Stein Krogdahl Department of Informatics University of Oslo, Norway April 2010 Introduction
Examples of Design by Contract in Java
Object World Berlin 99 Design & Components Berlin, May 17th-20th 1999 Examples of Design by Contract in Java using Contract, the Design by Contract tm Tool for Java tm Reto Kramer, kramer@acm.org Java
Formal Specification and Verification of Avionics Software
Formal Specification and Verification of Avionics Software June 7th, 2006 Outline 1 Introduction Software in the avionics domain Certification requirements Object-oriented technologies 2 Specification
www.virtualians.pk CS506 Web Design and Development Solved Online Quiz No. 01 www.virtualians.pk
CS506 Web Design and Development Solved Online Quiz No. 01 Which of the following is a general purpose container? JFrame Dialog JPanel JApplet Which of the following package needs to be import while handling
Java in sicherheits-kritischen Systemen: Das HIJA-Profil
Java in sicherheits-kritischen Systemen: Das HIJA-Profil... Korrektheitsnachweis für (echtzeit-) Java Anwendungen Dr. Fridtjof Siebert Director of Development, aicas GmbH Java Forum, Stuttgart, 7. Juli
An overview of JML tools and applications
Electronic Notes in Theoretical Computer Science 66 No. 2 (2003) URL: http://www.elsevier.nl/locate/entcs/volume66.html An overview of JML tools and applications www.jmlspecs.org Lilian Burdy a, Yoonsik
Contents. 9-1 Copyright (c) 1999-2004 N. Afshartous
Contents 1. Introduction 2. Types and Variables 3. Statements and Control Flow 4. Reading Input 5. Classes and Objects 6. Arrays 7. Methods 8. Scope and Lifetime 9. Utility classes 10. Introduction to
Datastrukturer och standardalgoritmer i Java
1 (8) Datastrukturer och standardalgoritmer i Java Dokumentet listar ett urval av konstruktorer och metoder för några vanliga Javaklasser. Class ArrayList ArrayList() Constructs an empty list. void
Logical Testing. Hoare-style Specification Meets Executable Validation
Logical Testing Hoare-style Specification Meets Executable Validation Kathryn E. Gray Alan Mycroft University of Cambridge Computer Laboratory {Kathryn.Gray,Alan.Mycroft}@cl.cam.ac.uk Abstract. Software
Model Driven Security: Foundations, Tools, and Practice
Model Driven Security: Foundations, Tools, and Practice David Basin, Manuel Clavel, and ETH Zurich, IMDEA Software Institute Thursday 1st, 2011 Outline I 1 Models Analysis. Types. 2 The Object Constraint
Organization of DSLE part. Overview of DSLE. Model driven software engineering. Engineering. Tooling. Topics:
Organization of DSLE part Domain Specific Language Engineering Tooling Eclipse plus EMF Xtext, Xtend, Xpand, QVTo and ATL Prof.dr. Mark van den Brand GLT 2010/11 Topics: Meta-modeling Model transformations
Course: Programming II - Abstract Data Types. The ADT Queue. (Bobby, Joe, Sue, Ellen) Add(Ellen) Delete( ) The ADT Queues Slide Number 1
Definition Course: Programming II - Abstract Data Types The ADT Queue The ADT Queue is a linear sequence of an arbitrary number of items, together with access procedures. The access procedures permit addition
Programming Database lectures for mathema
Programming Database lectures for mathematics students April 25, 2015 Functions Functions are defined in Postgres with CREATE FUNCTION name(parameter type,...) RETURNS result-type AS $$ function-body $$
Software Verification with Integrated Data Type Refinement for Integer Arithmetic
Software Verification with Integrated Data Type Refinement for Integer Arithmetic Bernhard Beckert 1 and Steffen Schlager 2 1 University of Koblenz-Landau Institute for Computer Science D-56072 Koblenz,
Lecture Notes on Binary Search Trees
Lecture Notes on Binary Search Trees 15-122: Principles of Imperative Computation Frank Pfenning André Platzer Lecture 17 October 23, 2014 1 Introduction In this lecture, we will continue considering associative
Introduction to Object-Oriented Programming
Introduction to Object-Oriented Programming Programs and Methods Christopher Simpkins chris.simpkins@gatech.edu CS 1331 (Georgia Tech) Programs and Methods 1 / 8 The Anatomy of a Java Program It is customary
Testing the Java Card Applet Firewall
Testing the Java Card Applet Firewall Wojciech Mostowski and Erik Poll Security of Systems (SoS) group Department of Computing Science Radboud University Nijmegen The Netherlands {woj,erikpoll@cs.ru.nl
A Reverse Inheritance Relationship for Improving Reusability and Evolution: The Point of View of Feature Factorization
Reverse Inheritance Relationship for Improving Reusability and Evolution: The Point of View of Feature Factorization Ciprian-Bogdan Chirila *, Pierre Crescenzo **, and Philippe Lahire ** * University Politehnica
DEFINING CONTRACTS WITH DIFFERENT TOOLS IN SOFTWARE DEVELOPMENT
Annales Univ. Sci. Budapest., Sect. Comp. 36 (2012) 323 339 DEFINING CONTRACTS WITH DIFFERENT TOOLS IN SOFTWARE DEVELOPMENT György Orbán and László Kozma (Budapest, Hungary) Communicated by Zoltán Horváth
Enumerated Types in Java
Enumerated Types in Java Paul A. Cairns School of Computing Science, Middlesex University, The Burroughs, Hendon, London, NW4 4BT e-mail: p.cairns@mdx.ac.uk tel: +44 (0) 181 362 6852 fax: +44 (0) 181 362
Part 3: GridWorld Classes and Interfaces
GridWorld Case Study Part 3: GridWorld Classes and Interfaces In our example programs, a grid contains actors that are instances of classes that extend the Actor class. There are two classes that implement
Lab Experience 17. Programming Language Translation
Lab Experience 17 Programming Language Translation Objectives Gain insight into the translation process for converting one virtual machine to another See the process by which an assembler translates assembly
Outline. Computer Science 331. Stack ADT. Definition of a Stack ADT. Stacks. Parenthesis Matching. Mike Jacobson
Outline Computer Science 1 Stacks Mike Jacobson Department of Computer Science University of Calgary Lecture #12 1 2 Applications Array-Based Linked List-Based 4 Additional Information Mike Jacobson (University
CS 111 Classes I 1. Software Organization View to this point:
CS 111 Classes I 1 Software Organization View to this point: Data Objects and primitive types Primitive types operators (+, /,,*, %). int, float, double, char, boolean Memory location holds the data Objects
AP Computer Science A - Syllabus Overview of AP Computer Science A Computer Facilities
AP Computer Science A - Syllabus Overview of AP Computer Science A Computer Facilities The classroom is set up like a traditional classroom on the left side of the room. This is where I will conduct my
Rigorous Software Engineering Hoare Logic and Design by Contracts
Rigorous Software Engineering Hoare Logic and Design by Contracts Simão Melo de Sousa RELEASE (UBI), LIACC (Porto) Computer Science Department University of Beira Interior, Portugal 2010-2011 S. Melo de
Project 4 DB A Simple database program
Project 4 DB A Simple database program Due Date April (Friday) Before Starting the Project Read this entire project description before starting Learning Objectives After completing this project you should
3 Pillars of Object-oriented Programming. Industrial Programming Systems Programming & Scripting. Extending the Example.
Industrial Programming Systems Programming & Scripting Lecture 12: C# Revision 3 Pillars of Object-oriented Programming Encapsulation: each class should be selfcontained to localise changes. Realised through
A Comparison of Runtime Assertion Checking and Theorem Proving for Concurrent and Distributed Systems. Research Report 435
UNIVERSITY OF OSLO Department of Informatics A Comparison of Runtime Assertion Checking and Theorem Proving for Concurrent and Distributed Systems Research Report 435 Crystal Chang Din Olaf Owe Richard
Software Development with UML and Java 2 SDJ I2, Spring 2010
Software Development with UML and Java 2 SDJ I2, Spring 2010 Agenda week 7, 2010 Pakages Looking back Looking forward Packages Interfaces Page 1 Spring 2010 Download, Install/Setup 1. Java SE SDK (http://java.sun.com/javase/downloads)
1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D.
1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D. base address 2. The memory address of fifth element of an array can be calculated
Specification and Analysis of Contracts Lecture 1 Introduction
Specification and Analysis of Contracts Lecture 1 Introduction Gerardo Schneider gerardo@ifi.uio.no http://folk.uio.no/gerardo/ Department of Informatics, University of Oslo SEFM School, Oct. 27 - Nov.
El Dorado Union High School District Educational Services
El Dorado Union High School District Course of Study Information Page Course Title: ACE Computer Programming II (#495) Rationale: A continuum of courses, including advanced classes in technology is needed.
Mathematical Reasoning in Software Engineering Education. Peter B. Henderson Butler University
Mathematical Reasoning in Software Engineering Education Peter B. Henderson Butler University Introduction Engineering is a bridge between science and mathematics, and the technological needs of mankind.
The Java Series. Java Essentials I What is Java? Basic Language Constructs. Java Essentials I. What is Java?. Basic Language Constructs Slide 1
The Java Series Java Essentials I What is Java? Basic Language Constructs Slide 1 What is Java? A general purpose Object Oriented programming language. Created by Sun Microsystems. It s a general purpose
Computer Programming I
Computer Programming I COP 2210 Syllabus Spring Semester 2012 Instructor: Greg Shaw Office: ECS 313 (Engineering and Computer Science Bldg) Office Hours: Tuesday: 2:50 4:50, 7:45 8:30 Thursday: 2:50 4:50,
Moving from CS 61A Scheme to CS 61B Java
Moving from CS 61A Scheme to CS 61B Java Introduction Java is an object-oriented language. This document describes some of the differences between object-oriented programming in Scheme (which we hope you
Data Structures and Algorithms Lists
Data Structures and Algorithms Lists Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/19 5-0: Abstract Data Types An
Summit Public Schools Summit, New Jersey Grade Level / Content Area: Mathematics Length of Course: 1 Academic Year Curriculum: AP Computer Science A
Summit Public Schools Summit, New Jersey Grade Level / Content Area: Mathematics Length of Course: 1 Academic Year Curriculum: AP Computer Science A Developed By Brian Weinfeld Course Description: AP Computer
Exception Handling. Overloaded methods Interfaces Inheritance hierarchies Constructors. OOP: Exception Handling 1
Exception Handling Error handling in general Java's exception handling mechanism The catch-or-specify priciple Checked and unchecked exceptions Exceptions impact/usage Overloaded methods Interfaces Inheritance
JOURNAL OF OBJECT TECHNOLOGY
JOURNAL OF OBJECT TECHNOLOGY Online at www.jot.fm. Published by ETH Zurich, Chair of Software Engineering JOT, 2002 Vol. 1, No. 3 Special issue: TOOLS USA 2002 proceedings Evaluation of Assertion Support
D06 PROGRAMMING with JAVA
Cicles Formatius de Grau Superior Desenvolupament d Aplicacions Informàtiques D06 PROGRAMMING with JAVA Ch13 Inheritance PowerPoint presentation, created by Angel A. Juan - ajuanp(@)gmail.com, for accompanying
Arrays. Atul Prakash Readings: Chapter 10, Downey Sun s Java tutorial on Arrays: http://java.sun.com/docs/books/tutorial/java/nutsandbolts/arrays.
Arrays Atul Prakash Readings: Chapter 10, Downey Sun s Java tutorial on Arrays: http://java.sun.com/docs/books/tutorial/java/nutsandbolts/arrays.html 1 Grid in Assignment 2 How do you represent the state
Chapter 1 Fundamentals of Java Programming
Chapter 1 Fundamentals of Java Programming Computers and Computer Programming Writing and Executing a Java Program Elements of a Java Program Features of Java Accessing the Classes and Class Members The
Free Java textbook available online. Introduction to the Java programming language. Compilation. A simple java program
Free Java textbook available online "Thinking in Java" by Bruce Eckel, 4th edition, 2006, ISBN 0131872486, Pearson Education Introduction to the Java programming language CS 4354 Summer II 2015 The third
Department of Computing Science and Mathematics University of Stirling
Department of Computing Science and Mathematics University of Stirling Push-Button Tools for Application Developers, Full Formal Verification for Component Vendors Thomas Wilson, Savi Maharaj, Robert G.
Algorithms and Data Structures Written Exam Proposed SOLUTION
Algorithms and Data Structures Written Exam Proposed SOLUTION 2005-01-07 from 09:00 to 13:00 Allowed tools: A standard calculator. Grading criteria: You can get at most 30 points. For an E, 15 points are