Sciweavers

71 search results - page 5 / 15
» An Abstract Way to Define Rewriting Logic
Sort
View
CSFW
1999
IEEE
13 years 11 months ago
A Meta-Notation for Protocol Analysis
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln...
KBSE
2000
IEEE
13 years 11 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
POPL
1994
ACM
13 years 11 months ago
A Needed Narrowing Strategy
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
Sergio Antoy, Rachid Echahed, Michael Hanus
CALCO
2007
Springer
129views Mathematics» more  CALCO 2007»
13 years 11 months ago
CIRC : A Circular Coinductive Prover
Abstract. CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, togeth...
Dorel Lucanu, Grigore Rosu
FSTTCS
1993
Springer
13 years 11 months ago
Higher-Order and Semantic Unification
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
Nachum Dershowitz, Subrata Mitra