Sciweavers

1000 search results - page 61 / 200
» Nominal rewriting systems
Sort
View
CSL
2009
Springer
14 years 2 months ago
On the Relation between Sized-Types Based Termination and Semantic Labelling
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
Frédéric Blanqui, Cody Roux
CSL
2010
Springer
13 years 7 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
13 years 5 months ago
Output-feedback control of feedforward nonlinear delayed systems through dynamic high-gain scaling
Abstract-- The output-feedback control problem for nonlinear systems with state and input delays is addressed. Both state and input delays are allowed to be time-varying and uncert...
Prashanth Krishnamurthy, Farshad Khorrami
CONCUR
2012
Springer
11 years 10 months ago
Decidability Problems for Actor Systems
We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a relevant feature: the dynamic creation of names...
Frank S. de Boer, Mahdi Mahdi Jaghoori, Cosimo Lan...
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
14 years 8 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin