Sciweavers

325 search results - page 29 / 65
» Rewriting Strategies in Java
Sort
View
STACS
2004
Springer
15 years 3 months ago
Active Context-Free Games
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
Anca Muscholl, Thomas Schwentick, Luc Segoufin
CADE
2000
Springer
15 years 2 months ago
Two Techniques to Improve Finite Model Search
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
Gilles Audemard, Belaid Benhamou, Laurent Henocque
HT
1999
ACM
15 years 2 months ago
Unifying Strategies for Web Augmentation
Since the beginning of the WWW, tools have been developed to augment the functionality of the Web. This paper provides an investigation of hypermedia tools and systems integrating...
Niels Olof Bouvin
WOLLIC
2010
Springer
15 years 2 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...
75
Voted
AMAST
2008
Springer
14 years 11 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...