An Automated Formal Approach to Managing Dynamic Reconfiguration

Warren, Ian; Sun, Jing; S, None Krishnamohan; Weerasinghe, Thiranjith

doi:10.1109/ase.2006.12

Cited by 33 publications

(14 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Warren et al compile software architecture specifications to Alloy to check their consistency before performing a proposed software architecture reconfiguration (Warren et al 2006). Khurshid and Jackson discovered bugs in the Intentional Naming System (INS) by modeling and checking it with Alloy (Khurshid and Jackson 2000).…”

Section: Related Workmentioning

confidence: 99%

Scalable satisfiability checking and test data generation from modeling diagrams

Smaragdakis

Csallner

Subramanian³

2008

Autom Softw Eng

View full text Add to dashboard Cite

We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling (ORM) language. ORM is a popular conceptual modeling language, primarily targeting database applications, with significant uses in practice. The general problem of even checking whether an ORM diagram is satisfiable is quite hard: restricted forms are easily NP-hard and the problem is undecidable for some expressive formulations of ORM. Brute-force mapping to input for constraint and SAT solvers does not scale: state-of-the-art solvers fail to find data to satisfy uniqueness and mandatory constraints in realistic time even for small examples. We instead define a restricted subset of ORM that allows efficient reasoning yet contains most constraints overwhelmingly used in practice. We show that the problem of deciding whether these constraints are consistent (i.e., whether we can generate appropriate test data) is solvable in polynomial time, and we produce a highly efficient (interactive speed) checker. Additionally, we analyze over 160 ORM diagrams that capture data models from industrial practice and demonstrate that our subset of ORM is expressive enough to handle their vast majority.

show abstract

Section: Related Workmentioning

confidence: 99%

Scalable satisfiability checking and test data generation from modeling diagrams

Smaragdakis

Csallner

Subramanian³

2008

Autom Softw Eng

View full text Add to dashboard Cite

show abstract

“…Some existing research approaches have applied Alloy for system configurations [16], [17], [26]. These approaches have aimed at finding correct static configurations at specific points in time or detecting possible constraint violations.…”

Section: Related Workmentioning

confidence: 99%

Synthesis of Configuration Change Procedure Using Model Finder

Kikuchi

Tsuchiya

Hiraishi

2013

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYManaging the configurations of complex systems consisting of various components requires the combined efforts by multiple domain experts. These experts have extensive knowledge about different components in the system they need to manage but little understanding of the issues outside their individual areas of expertise. As a result, the configuration constraints, changes, and procedures specified by those involved in the management of a complex system are often interrelated with one another without being noticed, and their integration into a coherent procedure for configuration represents a major challenge. The method of synthesizing the configuration procedure introduced in this paper addresses this challenge using a combination of formal specification and model finding techniques. We express the knowledge on system management with this method, which is provided by domain experts as first-order logic formulas in the Alloy specification language, and combine it with system-configuration information and the resulting specification. We then employ the Alloy Analyzer to find a system model that satisfies all the formulas in this specification. The model obtained corresponds to a procedure for system configurations that satisfies all expert-specified constraints. In order to reduce the resources needed in the procedure synthesis, we reduce the length of procedures to be synthesized by defining and using intermediate goal states to divide operation procedures into shorter steps. Finally, we evaluate our method through a case study on a procedure to consolidate virtual machines.

show abstract

“…A couple of existing research approaches have applied Alloy to system configurations [16,17]. These approaches have aimed at finding correct static configurations at specific points in time or detecting possible constraint violations.…”

Section: Related Workmentioning

confidence: 99%

Configuration Procedure Synthesis for Complex Systems Using Model Finder

Kikuchi

Tsuchiya

2010

2010 15th IEEE International Conference on Engineering of Complex Computer Systems

View full text Add to dashboard Cite

Managing the configurations of complex systems consisting of various components requires combined efforts by multiple domain experts. These experts have extensive knowledge about different components in the system they need to manage, but little understanding of the issues outside their individual areas of expertise. As a result, the configuration constraints, changes, and procedures specified by those involved in the management of a complex system are often interrelated with one another without being noticed, and their integration into a coherent procedure for configuration represents a major challenge. The method of synthesizing the configuration procedure introduced in this paper addresses this challenge using a combination of formal specification and model finding techniques. We express the knowledge on system management with this method, which is provided by domain experts as first-order logic formulas in the Alloy specification language, and combine it with system-configuration information and the resulting specification. We then employ the Alloy Analyzer tool to find a system model that satisfies all the formulas in this specification. The model obtained corresponds to a procedure for system configurations that satisfies all expert-specified constraints. Finally, we evaluate our method through a case study on a procedure to consolidate virtual machines.

show abstract

An Automated Formal Approach to Managing Dynamic Reconfiguration

Abstract: Abstract

Cited by 33 publications

References 20 publications

Scalable satisfiability checking and test data generation from modeling diagrams

Scalable satisfiability checking and test data generation from modeling diagrams

Synthesis of Configuration Change Procedure Using Model Finder

Configuration Procedure Synthesis for Complex Systems Using Model Finder

Contact Info

Product

Resources

About