Recent Posts
- Dutch Election Software
- Maximum in an array (by elimination)
- Two equal elements
- Maximum in a tree
- Cyclic list
- Inverting an Injection
- Sum and Maximum
- Searching a Linked List
- Amortized Queue
- N Queens
- Red-black Tree
- Composite Pattern 2
- Union Find
- Binary Heap
- Constant Time Sparse Array
- The Mobius Demonstrator Case Study
- Adding and Multiplying Numbers
- Iterators
- Layered Implementation of a Map ADT
- Linked-List Implementation of a Queue ADT
- Sorting a Queue
- Binary Search in an Array
- Thread-safety of java.lang.StringBuffer
- The bakery protocol
- Subject-Observer Pattern
- Selection sort
- Quantifiers and Comprehensions
- Morgan's Calculator
- Modification of Static Fields
- Modeling Types
- Methods that Use Function Objects
- Method Calls in Specifications
- Java Machine Readable Travel Documents
- JMM: Safe one-time publication
- Invocations of Function Objects
- Invariants of Complex Object Structures
- Finalizers
- Extracting positive elements of an array
- Dijkstra's Shortest Path Algorithm
- Database system for managing exams
- Database Library
- Composite Pattern
- Class Initialization
Tag Cloud
Java Jml Competition Array Clemson-osu Fac2007 Vstte10 Vacid benchmarks Adt Savcbs Cost verification competition 2011 Solved Permutation Queue Data abstraction Linked list Sort Search Database Key Sum Comprehension Observer Heap Function objects Jmm Composite pattern Case study Pattern Maximum Why Deductive Induction Unbounded Concurrency Separation Krakatoa Coarse-grained Locking Interactive Bakery Lamport Loop Multiplication Integer Numbers Map Sql Exam Addition