Sciweavers

4767 search results - page 62 / 954
» Structures for Abstract Rewriting
Sort
View
WOLLIC
2010
Springer
14 years 1 months ago
Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signa
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
Daniele Nantes Sobrinho, Mauricio Ayala-Rinc&oacut...
LATA
2009
Springer
14 years 1 months ago
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
Dana Pardubská, Martin Plátek, Fried...
TAGT
1998
Springer
156views Graph Theory» more  TAGT 1998»
14 years 1 months ago
Graph-Based Models for Managing Development Processes, Resources, and Products
Abstract. Management of development processes in di erent engineering disciplines is a challenging task. We present an integrated approach which covers not only the activities to b...
Carl-Arndt Krapp, Sven Krüppel, Ansgar Schlei...
POPL
1994
ACM
14 years 27 days 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
AMAST
2008
Springer
13 years 10 months ago
A Declarative Debugger for Maude
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
Adrián Riesco, Alberto Verdejo, Narciso Mar...