A Model-Driven Environment for Service Design, Simulation and Prototyping

Bajic-Bizumic, Biljana; Petitpierre, Claude; Huynh, Hieu Chi; Wegmann, Alain

doi:10.1007/978-3-642-36356-6_15

Cited by 5 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The .. notation is a short hand notation to define a range of tuples. 3 Declaring constraints The next part of the specification, lines 6 to 31, describes constraints on the relations. Specifications have no directionality but for clarity of the example we artificially split the constraints in two parts.…”

Section: Modeling a File System In Alleallementioning

confidence: 99%

“…In other words, it might contain tuples tying non-existing directories to other non-existing directories or files. Since the relation 3 The range <d0>..<d2> denotes the tuples <d0>,<d1>,<d2>. Likewise, the range <d0,f0>..<d1,f1> denotes the tuples <d0,f0>,<d0,f1>,< d1,f0>,<d1,f1>.…”

Section: Modeling a File System In Alleallementioning

confidence: 99%

“…In the last decades relational modeling and model finding has been used to solve problems in a wide range of domains, from security [8], program verification and testing [14,16], to enterprise modeling [3]. 1 Since many computational problems have relational structures relational model finding has shown to be a powerful and useful method.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

AlleAlle: bounded relational model finding with unbounded data

Stoel

Storm

Vinju

2019

Proceedings of the 2019 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Sof

View full text Add to dashboard Cite

Relational model finding is a successful technique which has been used in a wide range of problems during the last decade. This success is partly due to the fact that many problems contain relational structures which can be explored using relational model finders. Although these model finders allow for the exploration of such structures they often struggle with incorporating the non-relational elements. In this paper we introduce AlleAlle, a method and language that integrates reasoning on both relational structure and non-relational elements-the data-of a problem. By combining first order logic with Codd's relational algebra, transitive closure, and optimization criteria, we obtain a rich input language for expressing constraints on both relational and scalar values. We present the semantics of AlleAlle and the translation of AlleAlle specifications to SMT constraints, and use the off-the-shelf SMT solver Z3 to find solutions. We evaluate AlleAlle by comparing its performance with Kodkod, a state-of-the-art relational model finder, and by encoding a solution to the optimal package resolution problem. Initial benchmarking show that although the translation times of AlleAlle can be improved, the resulting SMT constraints can efficiently be solved by the underlying solver. CCS Concepts • Theory of computation → Constraint and logic programming; • Software and its engineering → Specification languages.

show abstract

Section: Modeling a File System In Alleallementioning

confidence: 99%

Section: Modeling a File System In Alleallementioning

confidence: 99%

See 1 more Smart Citation

AlleAlle: bounded relational model finding with unbounded data

Stoel

Storm

Vinju

2019

Proceedings of the 2019 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Sof

View full text Add to dashboard Cite

show abstract

“…We provide the formalization and simulation of both the Goal-Belief and the Behavior model [13] in the Alloy language [14]. In addition to the Alloy simulation, we provide also the prototyping of the behavior models into the given target language, e.g., Java [15]. In addition to the previous contribution, this allows business experts to review the prototype of the application corresponding to the behavior model in SEAM.…”

Section: Step 4: Solution Description With the Behavior "To-be" Modelmentioning

confidence: 99%

Requirements modeling in SEAM: The example of a car crash management system

Wegmann

Bajic-Bizumic

Golnam

et al. 2013

2013 3rd International Workshop on Comparing Requirements Modeling Approaches (CMA@RE)

Self Cite

View full text Add to dashboard Cite

Abstract-This paper presents how business and IT requirements are captured with the Systemic Enterprise Architecture Methodology (SEAM). The method is applied to the Car Crash Management System (CMS) -Software Product Line (SPL) case study. The existing business situation is analyzed. We identify the problems and list relevant solutions. We select one of these solutions for which we define the business and the IT requirements. We then present the two components of SEAM used in this paper, goal-belief and behavior modeling. We end the paper by presenting the systemic foundations of SEAM.

show abstract

“…The translated SAT formula is then solved by off-theshelf SAT solvers, which have seen noteworthy advances over the last two decades [9]. Alloy's intuitive language design, its efficient translation, and powerful backend solving have enabled a wide range of Alloy applications, including design and modeling [3,6,7], hardware and software security [1,32], system analysis and verification [12,19,23], and software testing [28].…”

Section: Introductionmentioning

confidence: 99%

AlloyMC: Alloy meets model counting

Yang

Wang

Marinov

et al. 2020

Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Softw

View full text Add to dashboard Cite

Specifying and analyzing desired properties of software systems can play an important role in the development of more dependable systems. Alloy is a mature tool-set that provides a first-order, relational logic with transitive closure for writing specifications, and a fully automatic backend based on propositional satisfiability (SAT) solvers for analyzing them. Alloy's intuitive notation and support for modern solvers make it an effective specification and analysis tool, which has led it to be applied in several domains, including verification, security, and synthesis. This paper introduces a new backend for Alloy, which complements SAT solvers, and provides a new method to assist Alloy users to more effectively use the tool-set, specifically in scenarios where multiple solutions to the same formula are desired. We add to the Alloy backend support for model counting, i.e., computing the number of solutions to the given formula. We extend the Alloy grammar to add a new command for model counting, and extend the Alloy GUI to customize it. Our implementation, called AlloyMC, supports two state-of-the-art model counters: the approximate model counter ApproxMC and the exact model counter ProjMC. AlloyMC runs on Linux, Mac, and Windows. To use AlloyMC, users just download and run its integrated JAR file with no need to install dependencies (e.g., model counters and their dependent libraries). The AlloyMC source code, the JAR file, and the data set are available publicly. CCS CONCEPTS • Software and its engineering → Software creation and management.

show abstract

A Model-Driven Environment for Service Design, Simulation and Prototyping

Cited by 5 publications

References 14 publications

AlleAlle: bounded relational model finding with unbounded data

AlleAlle: bounded relational model finding with unbounded data

Requirements modeling in SEAM: The example of a car crash management system

AlloyMC: Alloy meets model counting

Contact Info

Product

Resources

About