Difference between revisions of "Applications"

From The Maude System
Jump to: navigation, search
Line 7: Line 7:
 
* Cryptographic protocol analysis: [http://maude.cs.illinois.edu/w/index.php/Maude_Tools:_Maude-NPA Maude-NPA] has analyzed many protocols and crypto-APIs modulo algebraic properties, like Yubikey&YubiHSM ([https://easychair.org/publications/paper/qkkq GAEMM18]), IBM’s CCA ([https://link.springer.com/chapter/10.1007/978-3-319-14054-4_8 GSEMM14]), and PCKS#11 ([https://link.springer.com/chapter/10.1007/978-3-319-27152-1_5 GSEMM15]), using unification and symbolic reachability. [https://tamarin-prover.github.io/ Tamarin], resp. [https://github.com/akiss/akiss AKISS], use Maude’s unification to analyze protocols like 5G-AKA ([https://people.cispa.io/cas.cremers/tamarin/5G/ DC18]), resp. RFID ([https://link.springer.com/chapter/10.1007/978-3-319-66399-9_1 GK17]).
 
* Cryptographic protocol analysis: [http://maude.cs.illinois.edu/w/index.php/Maude_Tools:_Maude-NPA Maude-NPA] has analyzed many protocols and crypto-APIs modulo algebraic properties, like Yubikey&YubiHSM ([https://easychair.org/publications/paper/qkkq GAEMM18]), IBM’s CCA ([https://link.springer.com/chapter/10.1007/978-3-319-14054-4_8 GSEMM14]), and PCKS#11 ([https://link.springer.com/chapter/10.1007/978-3-319-27152-1_5 GSEMM15]), using unification and symbolic reachability. [https://tamarin-prover.github.io/ Tamarin], resp. [https://github.com/akiss/akiss AKISS], use Maude’s unification to analyze protocols like 5G-AKA ([https://people.cispa.io/cas.cremers/tamarin/5G/ DC18]), resp. RFID ([https://link.springer.com/chapter/10.1007/978-3-319-66399-9_1 GK17]).
  
* Network protocols: AER/NCA active networks ([https://link.springer.com/chapter/10.1007/3-540-45314-8_24 OKMTZ06]), MANETS ([https://www.sciencedirect.com/science/article/pii/S2352220815000498 LOM16]), BGP ***ask Carolyn!***; DDoS-Intruder models; and DDoS protection: ASV ([https://www.sciencedirect.com/science/article/pii/S1571066109000747 AMG09]), Stable Availability ([http://dx.doi.org/10.1007/978-3-642-28872-2_6 EMMW12]), VoIP-SIP ([https://link.springer.com/chapter/10.1007/978-3-642-04444-1_24 SASGM09]), using [http://maude.cs.uiuc.edu/tools/pvesta/ Maude’s statistical model checking (SMC) tool].
+
* Network protocols: AER/NCA active networks ([https://link.springer.com/chapter/10.1007/3-540-45314-8_24 OKMTZ06]), MANETS ([https://www.sciencedirect.com/science/article/pii/S2352220815000498 LOM16]), BGP ([https://repository.upenn.edu/cgi/viewcontent.cgi?article=2029&context=cis_reports Wetal13], [https://link.springer.com/chapter/10.1007/978-3-642-21461-5_22 Wetal11], [https://link.springer.com/chapter/10.1007/978-3-642-28756-5_20 WTGLS12]); DDoS-Intruder models; and DDoS protection ([https://www.sciencedirect.com/science/article/pii/S2352220816301651 LDFN18]): ASV ([https://www.sciencedirect.com/science/article/pii/S1571066109000747 AMG09]), Stable Availability ([http://dx.doi.org/10.1007/978-3-642-28872-2_6 EMMW12]), VoIP-SIP ([https://link.springer.com/chapter/10.1007/978-3-642-04444-1_24 SASGM09]), using [http://maude.cs.uiuc.edu/tools/pvesta/ Maude’s statistical model checking (SMC) tool].
  
* Cloud transaction system formalization and analysis: Cassandra ([https://dl.acm.org/doi/10.1007/978-3-319-22264-6_15 LNGRG15]), Google’s Megastore ([https://dblp.org/rec/conf/sefm/GrovO14.bib GO14]), P-Store ([https://link.springer.com/chapter/10.1007/978-3-319-72044-9_13 O17]), etc. ([https://onlinelibrary.wiley.com/doi/10.1002/9781119428497.ch2 Betall18]), using SMC.
+
* Cloud transaction system formalization and analysis: Cassandra ([https://dl.acm.org/doi/10.1007/978-3-319-22264-6_15 LNGRG15]), Google’s Megastore ([https://dblp.org/rec/conf/sefm/GrovO14.bib GO14]), P-Store ([https://link.springer.com/chapter/10.1007/978-3-319-72044-9_13 O17]), etc. ([https://onlinelibrary.wiley.com/doi/10.1002/9781119428497.ch2 Betal18]), using SMC.
  
 
* Analysis of real-time and cyber-physical systems: CASH scheduling ([https://link.springer.com/chapter/10.1007/11693017_26 OC06]), sensor  ([https://www.sciencedirect.com/science/article/pii/S0304397508006683 OT09]) and MANET ([https://www.sciencedirect.com/science/article/pii/S2352220815000498 LOM16]) networks, timed security protocols ([https://dblp.org/rec/conf/indocrypt/Aparicio-Sanchez20.bib AEMMS20]), PALS transformation from synchronous to correct distributed real-time systems ([http://dx.doi.org/10.1016/j.tcs.2012.05.040 MO12], [https://link.springer.com/chapter/10.1007/978-3-642-35861-6_1 BMO12]) enables model checking of complex models such as AADL and Ptolemy models ([https://link.springer.com/chapter/10.1007/978-3-319-06410-9_7 BOM14]) and distributed control of airplane maneuvers ([http://dx.doi.org/10.4204/EPTCS.105.2 BKMO12]).
 
* Analysis of real-time and cyber-physical systems: CASH scheduling ([https://link.springer.com/chapter/10.1007/11693017_26 OC06]), sensor  ([https://www.sciencedirect.com/science/article/pii/S0304397508006683 OT09]) and MANET ([https://www.sciencedirect.com/science/article/pii/S2352220815000498 LOM16]) networks, timed security protocols ([https://dblp.org/rec/conf/indocrypt/Aparicio-Sanchez20.bib AEMMS20]), PALS transformation from synchronous to correct distributed real-time systems ([http://dx.doi.org/10.1016/j.tcs.2012.05.040 MO12], [https://link.springer.com/chapter/10.1007/978-3-642-35861-6_1 BMO12]) enables model checking of complex models such as AADL and Ptolemy models ([https://link.springer.com/chapter/10.1007/978-3-319-06410-9_7 BOM14]) and distributed control of airplane maneuvers ([http://dx.doi.org/10.4204/EPTCS.105.2 BKMO12]).
  
* Models of cell signaling used to explain drug effects, identify pathogen attack surfaces, etc. ***Carolyn should provide info on this ***
+
* Models of cell signaling used to explain drug effects, identify pathogen attack surfaces, etc. ([http://pl.csl.sri.com/] Pathway Logic)
  
 
* Specification and analysis of models of Concurrency: Petri Nets ([https://link.springer.com/chapter/10.1007/3-540-45541-8_9 SMO01]), CCS, pi-Calculus ([https://www.sciencedirect.com/science/article/pii/S1571066105801252]), Actors ([https://mitpress.mit.edu/books/research-directions-concurrent-object-oriented-programming M93]), REO ([https://doi.org/10.1016/j.entcs.2005.12.034 MSA]), Orc ([https://www.sciencedirect.com/science/article/pii/S2352220815000334 AM15]).  
 
* Specification and analysis of models of Concurrency: Petri Nets ([https://link.springer.com/chapter/10.1007/3-540-45541-8_9 SMO01]), CCS, pi-Calculus ([https://www.sciencedirect.com/science/article/pii/S1571066105801252]), Actors ([https://mitpress.mit.edu/books/research-directions-concurrent-object-oriented-programming M93]), REO ([https://doi.org/10.1016/j.entcs.2005.12.034 MSA]), Orc ([https://www.sciencedirect.com/science/article/pii/S2352220815000334 AM15]).  
  
 
* Logical framework applications to prototype logics and build and interoperate theorem provers: Barendregt’s lambda-cube ([https://link.springer.com/chapter/10.1007/978-3-540-39993-3_16 SM04]), linear logic ([https://link.springer.com/chapter/10.1007/978-94-017-0464-9_1 MM02]), modal logics ([https://link.springer.com/chapter/10.1007/978-3-319-99840-4_7 OPR18]), computational algebraic geometry, Maude’s Church-Rosser Checker and Inductive ([https://www.sciencedirect.com/science/article/pii/S1567832611001147 DM12], [https://doi.org/10.1016/j.jlamp.2019.100513 DMR20]) and Reachability Logic ([https://link.springer.com/chapter/10.1007/978-3-319-94460-9_12 SSM17]), theorem provers, HOL-to-Nuprl translator ([https://link.springer.com/chapter/10.1007/3-540-44755-5_23 NSM01]), integration of logic and deep-learning, etc.  These applications use meta-level, search, and symbolic features.
 
* Logical framework applications to prototype logics and build and interoperate theorem provers: Barendregt’s lambda-cube ([https://link.springer.com/chapter/10.1007/978-3-540-39993-3_16 SM04]), linear logic ([https://link.springer.com/chapter/10.1007/978-94-017-0464-9_1 MM02]), modal logics ([https://link.springer.com/chapter/10.1007/978-3-319-99840-4_7 OPR18]), computational algebraic geometry, Maude’s Church-Rosser Checker and Inductive ([https://www.sciencedirect.com/science/article/pii/S1567832611001147 DM12], [https://doi.org/10.1016/j.jlamp.2019.100513 DMR20]) and Reachability Logic ([https://link.springer.com/chapter/10.1007/978-3-319-94460-9_12 SSM17]), theorem provers, HOL-to-Nuprl translator ([https://link.springer.com/chapter/10.1007/3-540-44755-5_23 NSM01]), integration of logic and deep-learning, etc.  These applications use meta-level, search, and symbolic features.

Revision as of 21:39, 20 December 2020

Maude and its formal tools have been used in many pioneering applications:

  • Browser security: uncovering 12 kinds of unknown attacks on Internet Explorer (CMSWW07), and design and verification of the secure-by-construction Illinois’s IBOS browser (SKMT12, SMR20).
  • Cryptographic protocol analysis: Maude-NPA has analyzed many protocols and crypto-APIs modulo algebraic properties, like Yubikey&YubiHSM (GAEMM18), IBM’s CCA (GSEMM14), and PCKS#11 (GSEMM15), using unification and symbolic reachability. Tamarin, resp. AKISS, use Maude’s unification to analyze protocols like 5G-AKA (DC18), resp. RFID (GK17).
  • Cloud transaction system formalization and analysis: Cassandra (LNGRG15), Google’s Megastore (GO14), P-Store (O17), etc. (Betal18), using SMC.
  • Analysis of real-time and cyber-physical systems: CASH scheduling (OC06), sensor (OT09) and MANET (LOM16) networks, timed security protocols (AEMMS20), PALS transformation from synchronous to correct distributed real-time systems (MO12, BMO12) enables model checking of complex models such as AADL and Ptolemy models (BOM14) and distributed control of airplane maneuvers (BKMO12).
  • Models of cell signaling used to explain drug effects, identify pathogen attack surfaces, etc. ([1] Pathway Logic)
  • Specification and analysis of models of Concurrency: Petri Nets (SMO01), CCS, pi-Calculus ([2]), Actors (M93), REO (MSA), Orc (AM15).
  • Logical framework applications to prototype logics and build and interoperate theorem provers: Barendregt’s lambda-cube (SM04), linear logic (MM02), modal logics (OPR18), computational algebraic geometry, Maude’s Church-Rosser Checker and Inductive (DM12, DMR20) and Reachability Logic (SSM17), theorem provers, HOL-to-Nuprl translator (NSM01), integration of logic and deep-learning, etc. These applications use meta-level, search, and symbolic features.