Sciweavers

1000 search results - page 55 / 200
» Nominal rewriting systems
Sort
View
ICFP
2010
ACM
13 years 8 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
AUTOMATICA
2005
126views more  AUTOMATICA 2005»
13 years 7 months ago
Relations between uncertainty structures in identification for robust control
Various techniques of system identification exist that provide a nominal model and an uncertainty bound. An important question is what the implications are for the particular choi...
Sippe G. Douma, Paul M. J. Van den Hof
DAGSTUHL
2006
13 years 9 months ago
Modeling and Simulating Biological Processes with Stochastic Multiset Rewriting
ed Abstract Membrane systems are models of computation inspired by the structure and the function of biological cells. The model was introduced in 1998 by Gh. Paun and since then m...
Matteo Cavaliere, Sean Sedwards
ENTCS
2007
96views more  ENTCS 2007»
13 years 7 months ago
Deduction, Strategies, and Rewriting
Automated deduction methods should be speciļ¬ed not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, diļ...
Steven Eker, Narciso Martí-Oliet, Jos&eacut...
WRLA
2010
13 years 6 months ago
The Linear Temporal Logic of Rewriting Maude Model Checker
Abstract. This paper presents the foundation, design, and implementation of the Linear Temporal Logic of Rewriting model checker as an extension of the Maude system. The Linear Tem...
Kyungmin Bae, José Meseguer