1000 search results - page 61 / 200 » Nominal rewriting systems |
CSL
2009
Springer
15 years 6 months ago
2009
Springer
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...
CSL
2010
Springer
15 years 1 days ago
2010
Springer
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...
CDC
2009
IEEE
14 years 9 months ago
2009
IEEE
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...
180
click to vote
CONCUR
2012
Springer
13 years 2 months ago
2012
Springer
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...
SAS
2009
Springer
16 years 12 days ago
2009
Springer
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...