Context-Aided Variable Elimination for Requirement Engineering

05/27/2023
by   Inigo Incer, et al.
0

Deriving system-level specifications from component specifications usually involves the elimination of variables that are not part of the interface of the top-level system. This paper presents algorithms for eliminating variables from formulas by computing refinements or relaxations of these formulas in a context. We discuss a connection between this problem and optimization and give efficient algorithms to compute refinements and relaxations of linear inequality constraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2023

Bounds on BDD-Based Bucket Elimination

We study BDD-based bucket elimination, an approach to satisfiability tes...
research
11/23/2010

Covered Clause Elimination

Generalizing the novel clause elimination procedures developed in [M. He...
research
01/23/2013

Quantifier Elimination for Statistical Problems

Recent improvement on Tarski's procedure for quantifier elimination in t...
research
11/10/2020

Computational Design and Fabrication of Corrugated Mechanisms from Behavioral Specifications

Orthogonally assembled double-layered corrugated (OADLC) mechanisms are ...
research
07/16/2021

Adelfa: A System for Reasoning about LF Specifications

We present a system called Adelfa that provides mechanized support for r...
research
09/09/2011

On the Practical use of Variable Elimination in Constraint Optimization Problems: 'Still-life' as a Case Study

Variable elimination is a general technique for constraint processing. I...
research
09/24/2021

How to write a coequation

There is a large amount of literature on the topic of covarieties, coequ...

Please sign up or login with your details

Forgot password? Click here to reset