Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysıs Method

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	WRLA (14. : 2022 : Online; München) Rewriting logic and its applications
1. Verfasser:	López-Rueda, Raúl (VerfasserIn)
Weitere Verfasser:	Escobar, Santiago (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2022
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
An Efficient Canonical Narrowing Implementation for Protocol Analysis	2022	López-Rueda, Raúl
On Ground Convergence and Completeness of Conditional Equational Program Hierarchies	2022	Meseguer, José
Maude as a Library: An Efücient All-Purpose Programming Interface	2022	Rubio, Rubén
Rewriting Privacy	2022	Mödersheim, Sebastian
Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysıs Method	2022	López-Rueda, Raúl
Modeling, Algorithm Synthesis, and Instrumentation for Co-simulation in Maude	2022	Hansen, Simon Thrane
From Static to Dynamic Analysis and Allocation of Resources for BPMN Processes	2022	Durán, Francisco
Teaching Formal Methods to Undergraduate Students Using Maude	2022	Ölveczky, Peter Csaba
Business Processes Analysıs with Resource-Aware Machine Learning Scheduling in Rewriting Logic	2022	Durán, Francisco
An Overview of the Maude Strategy Language and its Applications	2022	Rubio, Rubén
Checking Sufficient Completeness by Inductive Theorem Proving	2022	Meseguer, José
Automating Safety Proofs About Cyber-Physical Systems Using Rewriting Modulo SMT	2022	Nigam, Vivek
Executable Semantics and Type Checking for Session-Based Concurrency in Maude	2022	Restrepo, Carlos Alberto Ramírez
Parallel Maude-NPA for Cryptographic Protocol Analysis	2022	Do, Canh Minh