Sciweavers

727 search results - page 19 / 146
» A Method for Implementing Equational Theories as Logic Progr...
Sort
View
CCS
2005
ACM
15 years 10 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
IFIP
2010
Springer
14 years 11 months ago
Efficient Decision Procedures for Message Deducibility and Static Equivalence
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
Bruno Conchinha, David A. Basin, Carlos Caleiro
ENTCS
2006
142views more  ENTCS 2006»
15 years 4 months ago
The Rewriting Logic Semantics Project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
José Meseguer, Grigore Rosu
ECAI
2008
Springer
15 years 6 months ago
Data-driven Induction of Functional Programs
We present a new method and system, called IGOR2, for the induction of recursive functional programs from few nonrecursive, possibly non-ground example equations describing a subse...
Emanuel Kitzelmann
ICLP
2004
Springer
15 years 10 months ago
MProlog: An Extension of Prolog for Modal Logic Programming
We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be u...
Linh Anh Nguyen