Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
94
Automated discovery of loop invariants for high assurance programs synthesized using ai planning techniques
- In HASE 2008: 11th High Assurance Systems Engineering Symposium
, 2008
"... The discovery of loop invariants is a great challenge for the independent verification of automatically synthesized programs. This verification is needed to achieve high confidence in the correctness of the synthesized code, i.e., assurance that no latent defects in the synthesizer itself could have ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
have led to the synthesis of an incorrect program. To address this problem, we present an automated loop invariant discovery approach for programs synthesized using a combination of AI planning and component-based software development techniques. Specifically, a plan (denoting the synthesized code
Article Bode optimal loop shaping with
, 2009
"... Ideal Bode characteristics give a classical answer to optimal loop design for linear time invariant feedback control systems in the frequency domain. This work recovers eight-parameter Bode optimal loop gains, providing a useful and simple theoretical reference for the best possible loop shaping fro ..."
Abstract
- Add to MetaCart
Ideal Bode characteristics give a classical answer to optimal loop design for linear time invariant feedback control systems in the frequency domain. This work recovers eight-parameter Bode optimal loop gains, providing a useful and simple theoretical reference for the best possible loop shaping
for Sparse Translation-Invariant Signals
"... Document Version Early version, also known as pre-print Link to publication from Aalborg University Citation for published version (APA): ..."
Abstract
- Add to MetaCart
Document Version Early version, also known as pre-print Link to publication from Aalborg University Citation for published version (APA):
Analysis and synthesis of attractive quantum Markovian dynamics
- Automatica
"... We propose a general framework for investigating a large class of stabilization problems in Markovian quantum systems. Building on the notions of invariant and attractive quantum subsystem, we characterize attractive subspaces by exploring the structure of the invariant sets for the dynamics. Our ge ..."
Abstract
-
Cited by 22 (8 self)
- Add to MetaCart
We propose a general framework for investigating a large class of stabilization problems in Markovian quantum systems. Building on the notions of invariant and attractive quantum subsystem, we characterize attractive subspaces by exploring the structure of the invariant sets for the dynamics. Our
SIMPLE APPROACH TO CONTROL OF MIMO CONTROL LOOPS
"... This paper describes one of possible approaches to control of MIMO control loops with utilisation of binding members and correction members. Binding members are used here for ensuring autonomy of control loop. Binding members are determined from so called main controllers, which are main diagonal el ..."
Abstract
- Add to MetaCart
elements of the transfer matrix of controller GR. The design of main controllers is carried out by any SISO method of synthesis. Correction members of transfer matrix of controller GKC serve for ensuring invariance of control loop and they are determined by using analogy of SISO branched control loops
Sequential Action Control for Tracking of Free Invariant Manifolds
"... This paper presents a hybrid control method that controls to unstable equilibria of nonlinear systems by taking advantage of systems ’ stable manifold of free dynamics. Resulting nonlinear controllers are closed-loop and can be computed in real-time. Thus, we present a computationally efficient appr ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
This paper presents a hybrid control method that controls to unstable equilibria of nonlinear systems by taking advantage of systems ’ stable manifold of free dynamics. Resulting nonlinear controllers are closed-loop and can be computed in real-time. Thus, we present a computationally efficient
Coordinated Parallelizing Compiler Optimizations and High-Level Synthesis
- ACM Trans. Des. Autom. Electron. Syst
, 2002
"... We present a framework for high-level synthesis that enables the designer to explore the best choice of source level and low level parallelizing transformations for improved synthesis. Within this framework, we have implemented a methodology that applies a set of parallelizing code transformations, ..."
Abstract
-
Cited by 21 (2 self)
- Add to MetaCart
that include common sub-expression elimination (CSE), copy propagation, dead code elimination and loop-invariant code motion, along with more coarse level code restructuring transformations such as loop unrolling. We then explore scheduling techniques that use a set of aggressive speculative code motions
Stability Preserving Interpolation Methods for the Synthesis of Gain Scheduled Controllers
- AUTOMATICA
, 1997
"... Synthesis of gain scheduled controllers often requires that a parameter-varying controller be generated from a finite set of linear time-invariant controllers. We propose interpolation methods for this task with the property that stability of the linearized closed-loop system is preserved for each f ..."
Abstract
-
Cited by 15 (1 self)
- Add to MetaCart
Synthesis of gain scheduled controllers often requires that a parameter-varying controller be generated from a finite set of linear time-invariant controllers. We propose interpolation methods for this task with the property that stability of the linearized closed-loop system is preserved for each
Toward Synthesis of Network Updates
"... Updates to network configurations are notoriously difficult to implement correctly. Even if the old and new configurations are correct, the update process can introduce transient errors such as forwarding loops, dropped packets, and access control violations. The key factor that makes updates diffic ..."
Abstract
-
Cited by 9 (2 self)
- Add to MetaCart
Updates to network configurations are notoriously difficult to implement correctly. Even if the old and new configurations are correct, the update process can introduce transient errors such as forwarding loops, dropped packets, and access control violations. The key factor that makes updates
Synthesizing software verifiers from proof rules
- IN PLDI
, 2012
"... Automatically generated tools can significantly improve programmer productivity. For example, parsers and dataflow analyzers can be automatically generated from declarative specifications in the form of grammars, which tremendously simplifies the task of implementing a compiler. In this paper, we pr ..."
Abstract
-
Cited by 46 (11 self)
- Add to MetaCart
present a method for the automatic synthesis of software verification tools. Our synthesis procedure takes as input a description of the employed proof rule, e.g., program safety checking via inductive invariants, and produces a tool that automatically discovers the auxiliary assertions required
Results 11 - 20
of
94
