Filters








30 Hits in 3.0 sec

Sequential Protocol Composition in Maude-NPA [chapter]

Santiago Escobar, Catherine Meadows, José Meseguer, Sonia Santiago
2010 Lecture Notes in Computer Science  
In this paper we discuss an extension to the Maude-NPA syntax and operational semantics to support dynamic sequential composition of protocols, so that protocols can be specified separately and composed  ...  Moreover, we show that, by a simple protocol transformation, we are able to analyze and verify this dynamic composition in the current Maude-NPA tool.  ...  In this paper we propose a syntax and operational semantics for sequential protocol composition in Maude-NPA [10, 11] , a protocol specification and analysis tool based on unification and narrowing-based  ... 
doi:10.1007/978-3-642-15497-3_19 fatcat:4nhhxtrsqrdnlgo7gtdk4ljfgi

Effective Sequential Protocol Composition in Maude-NPA [article]

Sonia Santiago and Santiago Escobar and Catherine Meadows and José Meseguer
2016 arXiv   pre-print
In this paper we discuss an extension to the Maude-NPA syntax and its operational semantics to support dynamic sequential composition of protocols, so that protocols can be specified separately and composed  ...  We show how compositions can be defined and executed symbolically in Maude-NPA using the compositional syntax and semantics.  ...  Strand and Protocol Composition In this section we formally define sequential protocol composition in Maude-NPA.  ... 
arXiv:1603.00087v1 fatcat:jvc3ph62erbarbiyoqn4hdynzi

Strand Spaces with Choice via a Process Algebra Semantics [article]

Fan Yang and Santiago Escobar and Catherine Meadows and José Meseguer
2019 arXiv   pre-print
In this paper we address the problem of representing choice in the strand space model of cryptographic protocols, particularly as it is used in the Maude-NPA cryptographic protocol analysis tool.  ...  We have fully integrated the process algebra syntax and its transformation into strands in Maude-NPA.  ...  Integration of the Protocol Process Algebra in Maude-NPA We have fully implemented the process algebra notation in Maude-NPA.  ... 
arXiv:1904.09946v1 fatcat:2tey4ev35jaavghtt2m42ivgi4

Protocol Analysis with Time [article]

Damián Aparicio-Sánchez, Santiago Escobar, Catherine Meadows, Jose Meseguer, Julia Sapiña
2020 arXiv   pre-print
We provide a sound and complete protocol transformation from our timed process algebra to the Maude-NPA syntax and semantics, and we prove its soundness and completeness.  ...  We demonstrate the feasibility of our approach by using the Maude-NPA protocol analyzer together with an SMT solver that is used to evaluate the satisfiability of timing constraints.  ...  Experiments As a feasibility study, we have encoded several distance bounding protocols in Maude-NPA.  ... 
arXiv:2010.13707v1 fatcat:ujqyxo7kmbb7fkhmljvmcgqz6q

Strand spaces with choice via a process algebra semantics

Fan Yang, Santiago Escobar, Catherine Meadows, José Meseguer, Sonia Santiago
2016 Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming - PPDP '16  
In this paper we address the problem of representing choice in the strand space model of cryptographic protocols, particularly as it is used in the Maude-NPA cryptographic protocol analysis tool.  ...  At the practical level, we present a prototype implementation of our process algebra in Maude-NPA, illustrate its expressive power and naturalness with various examples, and show how it can be effectively  ...  "Proc¨Proc" denotes sequential composition of processes, where symbol _._ is associative and has the empty process nil as identity. "Proc ?  ... 
doi:10.1145/2967973.2968609 dblp:conf/ppdp/YangEMMS16 fatcat:edohqhobube6bkjocyldcuj4tm

One Picture Is Worth a Dozen Connectives: A Fault-Tree Representation of NPATRL Security Requirements

l. Cervesato
2007 IEEE Transactions on Dependable and Secure Computing  
In this paper we show how we can increase the ease of reading and writing security requirements for cryptographic protocols at the Dolev-Yao level of abstraction by developing a visual language based on  ...  We also show how the fault trees can be used to improve the presentation of some specifications that we developed in our analysis of the Group Domain of Interpretation (GDOI) protocol.  ...  In particular, there is a new tool under development, Maude-NPA [3] , that extends the capabilities of NPA in a number of ways.  ... 
doi:10.1109/tdsc.2007.70206 fatcat:f34l7rwqgner5orwomc6b3a4le

Twenty years of rewriting logic

José Meseguer
2012 The Journal of Logic and Algebraic Programming  
This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations  ...  rewriting logic at this point, when twenty years have passed since the first papers were published, for their further encouragement to turn my WRLA lecture into a survey paper, and for their patience in  ...  This work has been supported in part by NSF Grants CNS 07-16638, CNS 08-34709, CNS 08-31064, CNS 09-04749, and CCF 09-05584, AFOSR Grant FA8750-11-2-0084, and the "Programa de Apoyo a la Investigación  ... 
doi:10.1016/j.jlap.2012.06.003 fatcat:5tx4a5uxlvapfpf5fajozkbboi

Twenty Years of Rewriting Logic [chapter]

José Meseguer
2010 Lecture Notes in Computer Science  
This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations  ...  rewriting logic at this point, when twenty years have passed since the first papers were published, for their further encouragement to turn my WRLA lecture into a survey paper, and for their patience in  ...  This work has been supported in part by NSF Grants CNS 07-16638, CNS 08-34709, CNS 08-31064, CNS 09-04749, and CCF 09-05584, AFOSR Grant FA8750-11-2-0084, and the "Programa de Apoyo a la Investigación  ... 
doi:10.1007/978-3-642-16310-4_2 fatcat:ho7s76r67nc63bndpoptbh5k4e

Formal prototyping in early stages of protocol design

Alwyn Goodloe, Carl A. Gunter, Mark-Oliver Stehr
2005 Proceedings of the 2005 workshop on Issues in the theory of security - WITS '05  
We investigate how formal simulation based on Maude executable specifications overcomes many of these hurdles.  ...  A drawback of this technique is that errors in protocols can be notoriously difficult to detect by testing alone.  ...  The first form of association composition is concatenation.  ... 
doi:10.1145/1045405.1045413 dblp:conf/popl/GoodloeGS05 fatcat:hyh6skl6z5c5rjadqkhmb3wseu

Vertical Protocol Composition

Thomas Groß, Sebastian Modersheim
2011 2011 IEEE 24th Computer Security Foundations Symposium  
In fact, vertical composition is a composition class widely used in practice, for which we do not have sufficient compositionality results.  ...  Previous compositionality approaches usable for vertical composition, such as [10], [13] , require disjointness between the protocols of the different layers and, thus, cannot allow the same channel protocol  ...  [30] extend the Maude-NPA tool by sequential composition primitives, thus allow for an automated composition analysis by Maude-NPA's unification and backwards search method.  ... 
doi:10.1109/csf.2011.23 dblp:conf/csfw/GrossM11 fatcat:lfj2tlvlajeh5agbrawrhlyuuu

An interpolation-based method for the verification of security protocols

Marco Rocchetto, Luca Viganò, Marco Volpe
2017 Journal of Computer Security  
Interpolation has been successfully applied in formal methods for model checking and test-case generation for sequential programs.  ...  Interpolants are generated as a response to search failure in order to prune possible useless traces and speed up the exploration.  ...  1 Work partially supported by the FP7-ICT-2009-5 Project no. 257876, "SPaCIoS: Secure Provision and Consumption in the Internet of Services" and the PRIN 2010-11 project "Security Horizons".  ... 
doi:10.3233/jcs-16832 fatcat:dp3ihuxvwrerzgfqhfuaugnpga

Programming and symbolic computation in Maude

Francisco Durán, Steven Eker, Santiago Escobar, Narciso Martí-Oliet, José Meseguer, Rubén Rubio, Carolyn Talcott
2019 Journal of Logical and Algebraic Methods in Programming  
Furthermore, we include many examples illustrating all the Maude notions and features described in the paper.  ...  In particular, meta-interpreters are external objects encapsulating Maude interpreters that can interact with many other objects.  ...  The Maude-NPA protocol analyzer has already been tested with various protocols using associative operators without encountering any incompleteness warnings (see [68] ). 17 The iter, or iterated operator  ... 
doi:10.1016/j.jlamp.2019.100497 fatcat:loloa2temzgubgorsxnqwefuwi

Partial Order Reduction for Security Protocols [article]

David Baelde, Stéphanie Delaune, Lucca Hirschi
2015 arXiv   pre-print
We have implemented our reductions in the tool Apte, and demonstrated that it achieves the expected speedup on various protocols.  ...  In this paper, we overcome this difficulty by developing partial order reduction techniques for the verification of security protocols.  ...  In [19] , the authors develop "state space reduction" techniques for the Maude-NRL Protocol Analyzer (Maude-NPA).  ... 
arXiv:1504.04768v3 fatcat:5pdro6axrjgcdmcaww2jx2g7ji

Using conditional trace slicing for improving Maude programs

María Alpuente, Demis Ballis, Francisco Frechina, Daniel Romero
2014 Science of Computer Programming  
Given a Maude execution trace T and a slicing criterion for the trace (i.e., a piece of information that we want to observe in the final computation state), we traverse T from back to front and the backward  ...  Maude language that seamlessly unifies a wide variety of logics and models of concurrency.  ...  Rewriting logic-based tools, like the Maude-NPA protocol analyzer, the Maude LTLR model checker, and the Java PathExplorer runtime verification tool (just to mention a few [8] ), are used in the analysis  ... 
doi:10.1016/j.scico.2013.09.018 fatcat:pavknj54lndt3fzb7lwypyuz4e

Automated Analysis of Equivalence Properties for Security Protocols Using Else Branches [chapter]

Ivan Gazeau, Steve Kremer
2017 Lecture Notes in Computer Science  
In this paper we present an extension of the AKISS protocol verification tool which allows to verify equivalence properties for protocols with else branches, i.e., disequality tests.  ...  We demonstrate the tool's effectiveness on several case studies, including the AKA protocol deployed in mobile telephony.  ...  While Maude NPA does support xor in principle, termination fails even on simple examples [28] . We may also note that the support for else branches in Maude NPA is very recent [32] .  ... 
doi:10.1007/978-3-319-66399-9_1 fatcat:627lclmsdzcf7cqltyefr44qye
« Previous Showing results 1 — 15 out of 30 results