Tag Archives: non-determinism

Process algebra reconsidered

Posted on May 7, 2010 by admin

Paper is here. The following incorrect claim is not unusual in the process algebra literature. Basically, what is missing [in classical automata theory] is the notion of interaction: during the execution from initial state to fi nal state, a system may … Continue reading →

Posted in specification, theoretical computer science | Tagged , , , | Leave a comment

Deterministic multithreading

Posted on August 10, 2009 by admin

An interesting paper appearing in ASPLOS proceedings provides a “deterministic” locking method Kendo enforces a deterministic interleaving of lock acquisitions and specially declared non-protected reads through a novel dynamically load-balanced deterministic scheduling algorithm. The algorithm tracks the progress of each … Continue reading →

Posted in embedded systems, operating systems, software engineering, software security, specification | Tagged , , , , | Leave a comment