Results 1  10
of
138
Enforcement Monitoring wrt. the SafetyProgress Classification of Properties
 In SAC ’09: Proceedings of the 2009 ACM symposium on Applied Computing
, 2009
"... Runtime enforcement is a powerful technique to ensure that a program will respect a given set of properties. We extend previous works on this topic in several directions. Firstly, we propose a generic notion of enforcement monitors based on a memory device and finite sets of control states and enfor ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
Runtime enforcement is a powerful technique to ensure that a program will respect a given set of properties. We extend previous works on this topic in several directions. Firstly, we propose a generic notion of enforcement monitors based on a memory device and finite sets of control states
Correctness of Methods w.r.t. Problems Specifications
"... . This paper proposes a framework for the formal specification of a knowledgebased system and its intramodel verification. At a conceptual level, a knowledgebased system is specified in terms of problems, methods, knowledge. In previous papers we had propose a formal language to specify problem g ..."
Abstract
 Add to MetaCart
based system specified at a conceptual level. Then, we present how the correctness proof of a process w.r.t a problem specification can be brought back to its relevance proof w.r.t this problem. 1. INTRODUCTION A large number of present engineering frameworks, referred as taskmethod frameworks, (e.g. TASK
A Generic Model for Diagram Syntax and Semantics
 In Proc. ICALP2000 Workshop on Graph Transformation and Visual Modelling Techniques, Geneva, Switzerland (2000). In this volume
, 2000
"... In this paper, we recall how the syntax of diagrams is captured by the diagram editor generator DIAGEN, and outline a visual, rulebased, and objectoriented programming language based on graph transformation by which DIAGEN can be extended to model the semantics of diagrams as well. This language i ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
is generic w.r.t. the diagram notation to be used in the programmed visual system and may thus be used for implementing arbitrary systems based on diagrammanipulation.
Synthesizing Enforcement Monitors wrt. the SafetyProgress Classification of Properties
, 2008
"... Runtime enforcement is a powerful technique to ensure that a program will respect a given security policy. We extend previous works on this topic in several directions. Firstly, we propose a generic notion of enforcement monitors based on a memory device and finite sets of control states and enfor ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Runtime enforcement is a powerful technique to ensure that a program will respect a given security policy. We extend previous works on this topic in several directions. Firstly, we propose a generic notion of enforcement monitors based on a memory device and finite sets of control states
title = { Synthesizing Enforcement Monitors wrt. the SafetyProgress Classification of
, 2009
"... Runtime enforcement is a powerful technique to ensure that a program will respect a given set of properties. We extend previous works on this topic in several directions. Firstly, we propose a generic notion of enforcement monitors based on a memory device and finite sets of control states and enfor ..."
Abstract
 Add to MetaCart
Runtime enforcement is a powerful technique to ensure that a program will respect a given set of properties. We extend previous works on this topic in several directions. Firstly, we propose a generic notion of enforcement monitors based on a memory device and finite sets of control states
Decomposition of Generic Multivariate Polynomials
"... We consider the composition f = g◦h of two systems g = (g0,...,gt) and h = (h0,...,hs) of homogeneous multivariate polynomials over a field K, where each g j ∈ K[y0,...,ys] has degree ℓ, each hk ∈ K[x0,...,xr] has degree m, and fi = gi(h0,...,hs) ∈ K[x0,...,xr] has degree n = ℓ ∙ m, for 0 ≤ i ≤ t. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
generic decomposable instance. The uniqueness is defined w.r.t. the “normal form " of a multivariate decomposition, a new notion introduced in this paper, which is of independent interest.
Superbranes and Generic Curved Spacetime
, 2005
"... Embedding of a bosonic and/or fermionic pbrane into a generic curved Ddimensional spacetime is considered. In contradistinction to the bosonic pbrane case, when there are no constraints on a generic curving whatsoever, the usual superbrane can be embedded into a curved spacetime of a restricted c ..."
Abstract
 Add to MetaCart
curving only. A generic curving is achieved by extending the odd sector of a superbrane as to transform w.r.t. SL(D,R), i.e. Diff(D,R) infinitecomponent spinorial representations. Relevant constructions in the D = 3 case are considered. 1 Generic curved target spacetime for superbrane In the conventional
Intervalbased Clock Synchronization
 RealTime Systems
, 1997
"... . In this paper, we develop and analyze a simple intervalbased algorithm suitable for faulttolerant external clock synchronization. Unlike usual internal synchronization approaches, our convergence functionbased algorithm provides approximately synchronized clocks maintaining both precision and a ..."
Abstract

Cited by 51 (17 self)
 Add to MetaCart
and accuracy w.r.t. external time. This is accomplished by means of a time representation relying on intervals that capture external time, providing accuracy information encoded in interval lengths. The algorithm, which is generic w.r.t. the convergence function and relies on either instantaneous correction
Generic proof synthesis for Presburger arithmetic
, 2003
"... We develop in complete detail an extension of Cooper’s decision procedure for Presburger arithmetic that returns a proof of the equivalence of the input formula to a quantifierfree formula. For closed input formulae this is a proof of their validity or unsatisfiability. The algorithm is formulated ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
as a functional program that makes only very minimal assumptions w.r.t. the underlying logical system and is therefore easily adaptable to specific theorem provers.
A Generic Solver For Aips++ Using Mns Trees
, 1997
"... Mns trees calculate corrected and predicted uvdata and their derivatives w.r.t. parameters of the Measurement Equation. This information can be used by a generic solver to solve for any subset of these parameters simultaneously. Such a solver is described in this document. ..."
Abstract
 Add to MetaCart
Mns trees calculate corrected and predicted uvdata and their derivatives w.r.t. parameters of the Measurement Equation. This information can be used by a generic solver to solve for any subset of these parameters simultaneously. Such a solver is described in this document.
Results 1  10
of
138