First Page | Document Content | |
---|---|---|
Date: 2018-06-13 06:07:43Theoretical computer science Formal methods Temporal logic Software engineering Alloy Massachusetts Institute of Technology Z notation Concurrency Model checking TLA+ Linear temporal logic Computation tree logic | Electrum Lightweight specification of behavioral models with rich configurations Julien Brunel1 , David Chemouil1 , Alcino Cunha2 , Nuno Macedo2 et al. Workshop on the Future of Alloy, April 30 & May 1, 2018, MIT.Add to Reading ListSource URL: alloytools.orgDownload Document from Source WebsiteFile Size: 421,78 KBShare Document on Facebook |
Verifying Concurrency in an Adaptive Ocean Circulation Model Alper Altuntas 1DocID: 1xVYz - View Document | |
C/C++ Concurrency: Formalization and Model Finding Mark Batty Jasmin Blanchette Susmit Sarkar Peter SewellDocID: 1xVyg - View Document | |
SDNRacer: Detecting Concurrency Violations in Software-Defined NetworksDocID: 1xVts - View Document | |
SDNRacer: Detecting Concurrency Violations in Software-Defined NetworksDocID: 1xUY7 - View Document | |
SDNRacer Concurrency Analysis for SDNs Ahmed El-Hassany Jeremie Miserez Pavol Bielik Laurent VanbeverDocID: 1xUyW - View Document |