Difference between revisions of "Applications"

From The Maude System
Jump to: navigation, search
 
Line 5: Line 5:
 
* Semantics of hardware architectures: MCA ARMv8 architecture ([https://www.sciencedirect.com/science/article/pii/S1383762122000352 XZ22]).  
 
* Semantics of hardware architectures: MCA ARMv8 architecture ([https://www.sciencedirect.com/science/article/pii/S1383762122000352 XZ22]).  
  
−
* Browser security: uncovering 12 kinds of unknown attacks on Internet Explorer ([https://ieeexplore.ieee.org/abstract/document/4223215 CMSWW07]), and design and verification of the secure-by-construction Illinois’s IBOS browser ([https://link.springer.com/chapter/10.1007/978-3-642-35861-6_14 SKMT12],  
+
* Browser security: uncovering 12 kinds of unknown attacks on Internet Explorer ([https://ieeexplore.ieee.org/abstract/document/4223215 CMSWW07]), and design and verification of the secure-by-construction Illinois’s IBOS browser ([https://link.springer.com/chapter/10.1007/978-3-642-35861-6_14 SKMT12], [https://link.springer.com/chapter/10.1007%2F978-3-030-63595-4_10 SMR20]).
−
[https://link.springer.com/chapter/10.1007%2F978-3-030-63595-4_10 SMR20]).
+
  
 
* 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]).

Latest revision as of 14:03, 20 March 2024

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

  • 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).
  • 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).

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.

Retrieved from "https://maude.cs.illinois.edu/w/index.php?title=Applications&oldid=503"