Sciweavers

1000 search results - page 12 / 200
» Nominal rewriting systems
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell
CADE
2009
Springer
14 years 8 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
AUTOMATICA
2007
104views more  AUTOMATICA 2007»
13 years 7 months ago
Improving off-line approach to robust MPC based-on nominal performance cost
This paper gives two alternative off-line synthesis approaches to robust model predictive control (RMPC) for systems with polytopic description. In each approach, a sequence of ex...
BaoCang Ding, YuGeng Xi, Marcin T. Cychowski, Thom...
COLING
1996
13 years 8 months ago
Interpretation of Nominal Compounds: Combining Domain-Independent and Domain-Specific Information
A domain independent model is proposed for the automated interpretation of nominal compounds in English. This model is meant to account for productive rules of interpretation whic...
Cécile Fabre
IJACT
2008
64views more  IJACT 2008»
13 years 7 months ago
An efficient one-move Nominative Signature scheme
Abstract. A signer in a Nominative Signature (NS) scheme can arbitrarily choose a nominee, then jointly generate a signature in such a way that the signature can only be verified w...
Qiong Huang, Dennis Y. W. Liu, Duncan S. Wong