Sciweavers

652 search results - page 23 / 131
» Linear Explicit Substitutions
Sort
View
FASE
2001
Springer
14 years 1 days ago
A Hoare Calculus for Verifying Java Realizations of OCL-Constrained Design Models
Abstract. The Object Constraint Language OCL offers a formal notation for constraining the modelling elements occurring in UML diagrams. In this paper we apply OCL for developing ...
Bernhard Reus, Martin Wirsing, Rolf Hennicker
TLCA
2001
Springer
13 years 12 months ago
Strong Normalisation for a Gentzen-like Cut-Elimination Procedure
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
Christian Urban
FPCA
1987
13 years 11 months ago
Categorical multi-combinators
: Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of Catego...
Rafael Dueire Lins
FORTE
2001
13 years 9 months ago
Patterns and Rules for Behavioural Subtyping
Abstract Subtyping relations for object-oriented formalisms describe relationships between super- and subclasses which satisfy the substitutability requirement imposed on types and...
Heike Wehrheim
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...