Requires Python 3.6+
- Advanced standalone model checking
- State machine output
- HTML output
- Available on pip
HarmonyLang for VSCode
- Syntax Highlighting
- Intelligent Code Completion
- In-editor Visualizer
- Automatic Compiler Installation
Try out Harmony
Formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive peripherals.
An algorithm for mutual exclusion that allows two or more processes to share a single-use resource without conflict, using only shared memory for communication.
A solution to the producer/consumer problem using a Hoare monitor.
We want to prevent more than one thread modifying the shared resource simultaneously and allow for two or more readers to access the shared resource for reading at the same time.
This queue implementation uses separate locks for the head and the tail.
A way for multiple distributed processes to come to agreement, even in the face of failures.
What is Harmony?
Concurrent programming is hard to get right. A deadlock might occur only once in a million executions, caused by the most esoteric of circumstances. Harmony makes finding those bugs easy.
- Checks every possible interleaving of processes
- Detects non-compilance with invariants
- Provides the shortest path to a failing execution
Learning programming in Harmony should be straightforward to those familiar with Python or similar languages. In addition to our online documentation, we provide a textbook in PDF form with many programming examples including Peterson's Algorithm, reader/writer locks, and split binary semaphores.Read more
Our Primary Contributors
Robbert van RenesseCreator and Advisor to the Harmony Project
Anthony YangCompilers & Data Output
William MaCompilers & Visualization
Kevin SunDesign & Documentation
Renyu LiGraphical User Interface
Shi Chong Zhao
433 Gates Hall, Ithaca, NY 14853
+1 (607) 255-1021