First Page | Document Content | |
---|---|---|
Date: 2016-07-15 23:00:36Theoretical computer science Mathematics Logic in computer science Proof theory Programming language semantics Metalogic Model theory Symbol Net Constructible universe Sequent Permutation | From Non-preemptive to Preemptive Scheduling using Synchronization Synthesis ⋆ ˇ Pavol Cern´ y1 , Edmund M. Clarke2 , Thomas A. Henzinger3 , Arjun 4Add to Reading ListSource URL: www.cs.purdue.eduDownload Document from Source WebsiteFile Size: 496,84 KBShare Document on Facebook |