Difference between revisions of "Applications"
From The Maude System
| Line 9: | Line 9: | ||
* 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. See [https://doi.org/10.1007/978-3-642-03829-7_1 EMM09]. An account of the NRL protocol analyzer can be found [https://doi.org/10.1016/j.tcs.2006.08.035 here]. [https://tamarin-prover.github.io/ Tamarin] at ETH, resp. [https://github.com/akiss/akiss AKISS] at INRIA, 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. See [https://doi.org/10.1007/978-3-642-03829-7_1 EMM09]. An account of the NRL protocol analyzer can be found [https://doi.org/10.1016/j.tcs.2006.08.035 here]. [https://tamarin-prover.github.io/ Tamarin] at ETH, resp. [https://github.com/akiss/akiss AKISS] at INRIA, 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]). | ||
| − | * | + | * Networks: 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]. Secure Bandwidth Reservation in Path-Aware Internet Architectures ([https://zenodo.org/record/5856306#.YgTkifXMLt0 WLSPB22]), End-to-end name resolution ([https://dl.acm.org/doi/abs/10.1145/3603269.3604870 LDHBVBP23]). |
* 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://link.springer.com/chapter/10.1007%2F978-3-319-10431-7_12 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. | * 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://link.springer.com/chapter/10.1007%2F978-3-319-10431-7_12 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. | ||
| Line 20: | Line 20: | ||
* 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. | ||
| − | |||
| − | |||
* Distributed databases: SNOW-Optimal Read Atomic Transactions ([https://www.research-collection.ethz.ch/bitstream/handle/20.500.11850/511821/1/main.pdf L22]), Replicated RAMP Transactions ([https://ieeexplore.ieee.org/abstract/document/9546747 LL21]). | * Distributed databases: SNOW-Optimal Read Atomic Transactions ([https://www.research-collection.ethz.ch/bitstream/handle/20.500.11850/511821/1/main.pdf L22]), Replicated RAMP Transactions ([https://ieeexplore.ieee.org/abstract/document/9546747 LL21]). | ||
Revision as of 11:19, 14 December 2023
Maude and its formal tools have been used in many pioneering applications:
- Formal definition and verification of programming and hardware, resp. software, modeling languages: full C (ER12), Java (FCMR04), JVM (FMR04), NASA’s PLEXIL (RCMS12), Verilog (MKMR10), E-LOTOS (V02, VM05), UML (CE06, DRMA14), MOF (BM10), ODP (DV03, DRV05, RVD07), AADL (OBM10, BOM14), Ptolemy (BOFLT14), BPMN (DS17, DRS18), and DSMLs (RRDV, RDV09).
- Semantics of hardware architectures: MCA ARMv8 architecture (XZ22).
- 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. See EMM09. An account of the NRL protocol analyzer can be found here. Tamarin at ETH, resp. AKISS at INRIA, use Maude’s unification to analyze protocols like 5G-AKA (DC18), resp. RFID (GK17).
- Networks: AER/NCA active networks (OKMTZ06), MANETS (LOM16), BGP (Wetal13, Wetal11, WTGLS12); DDoS-Intruder models; and DDoS protection (LDFN18): ASV (AMG09), Stable Availability (EMMW12), VoIP-SIP (SASGM09), using Maude’s statistical model checking (SMC) tool. Secure Bandwidth Reservation in Path-Aware Internet Architectures (WLSPB22), End-to-end name resolution (LDHBVBP23).
- 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. (Pathway Logic). See EKLLMS02.
- Specification and analysis of models of Concurrency: Petri Nets (SMO01), CCS, pi-Calculus (S00), 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.
- Distributed databases: SNOW-Optimal Read Atomic Transactions (L22), Replicated RAMP Transactions (LL21).
- IoT systems: Attack Surface of Trigger-Action IoT Platforms (WDYLBG19), Automated Composition, Analysis and Deployment of IoT Applications (DG19).
- Runtime verification: See works by Roşu and Havelund.
Please, help us to complete this page. If you know of applications that should be in this list, email us to duran(at)lcc(dot)uma(dot)es.
