The power of "why" and "why not": enriching scenario exploration with provenance

Nelson, Tim; Danas, Natasha; Dougherty, Daniel J.; Krishnamurthi, Shriram

doi:10.1145/3106237.3106272

Cited by 32 publications

(18 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The resulting system would not outright reject goals or configurations, but rather return a minimally-edited "counter-offer". This may need to be wedded to principled output forms like "why" and "why not" modalities [39]. Semantics The impact of disobeying the envelope varies between domains.…”

Section: Discussionmentioning

confidence: 99%

Solver-Aided Multi-Party Configuration

Dackow

Wagner

Nelson

et al. 2020

Proceedings of the 19th ACM Workshop on Hot Topics in Networks

Self Cite

View full text Add to dashboard Cite

Configuring a service mesh often involves multiple parties, each of whom is responsible for separate portions of the overall system. This can result in miscommunication, silent and sudden errors, or a failure to meet goals. We identify two distinct modes of configuration that call for different solutions. We use synthesis algorithms to extract a set of properties-the envelope-that each party needs the other to obey. Administrators can use the envelope to aid verification and synthesis or to support fault-localization and negotiation when goals conflict. This paper introduces the problem, lays out the modes, presents algorithms for to each, and gives a prototype implementation. We use this to show the feasibility of the approach in the microservices access-control domain and raise new research questions.

show abstract

Section: Discussionmentioning

confidence: 99%

Solver-Aided Multi-Party Configuration

Dackow

Wagner

Nelson

et al. 2020

Proceedings of the 19th ACM Workshop on Hot Topics in Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…Several techniques attempt to explore specification instances derived from Alloy's relational logic constraints [18,33,44,45,56]. Macedo et al [33] examine scenario explorations in the context of relational logic.…”

Section: Related Workmentioning

confidence: 99%

Platinum: Reusing Constraint Solutions in Bounded Analysis of Relational Logic

Zheng

Bagheri

Rothermel

et al. 2020

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Alloy is a lightweight specification language based on relational logic, with an analysis engine that relies on SAT solvers to automate bounded verification of specifications. In spite of its strengths, the reliance of the Alloy Analyzer on computationally heavy solvers means that it can take a significant amount of time to verify software properties, even within limited bounds. This challenge is exacerbated by the ever-evolving nature of complex software systems. This paper presents PLATINUM, a technique for efficient analysis of evolving Alloy specifications, that recognizes opportunities for constraint reduction and reuse of previously identified constraint solutions. The insight behind PLATINUM is that formula constraints recur often during the analysis of a single specification and across its revisions, and constraint solutions can be reused over sequences of analyses performed on evolving specifications. Our empirical results show that PLATINUM substantially reduces (by 66.4% on average) the analysis time required on specifications extracted from real-world software systems.

show abstract

“…Montaghami et al (2017) desenvolveram o protótipo Bordeaux, que tem como objetivo encontrar exemplos externos para ajudar o usuário a encontrar bugs com restrição excessiva em seu modelo. Nelson et al (2017) apresentam Amalgam, que implementa busca de cenários e fornece uma exploração interativa de exemplos desta busca. Já Milicevic et al (2015) mostraram como estender um solucionador de primeira ordem (neste caso, Kodkod, um localizador de modelo para lógica relacional usada como o mecanismo do Alloy Analyzer) para que ele possa lidar com quantificações de mais alta ordem.…”

Section: Trabalhos Relacionadosunclassified

Uma Estratégia baseada em Regras para Instanciação, Validação e Simulação de Modelos de Processos intensivos em Conhecimento

Barboza

Baião

Santoro

2019

iSys

View full text Add to dashboard Cite

Com o recente avanço da pesquisa e prática em Gestão de Processos de Negócio (Business Process Management – BPM), organizações vêm mudando o seu foco para processos críticos que tipicamente são pouco estruturados, dinâmicos e de alta complexidade, denominados Processos intensivos em Conhecimento (Knowledge-intensive Processes – KiP). Em função de tais características, atividades típicas de BPM como modelagem, instanciação, validação e simulação de processos apresentam muitos desafios. Este artigo propõe uma estratégia baseada em regras para instanciar, validar e simular modelos de KiPs. A proposta considera a ontologia de processos intensivos em conhecimento (KiPO) como um metamodelo para modelar um KiP, e transforma as suas regras em especificações na linguagem Alloy. A aplicabilidade de proposta foi avaliada em um estudo de caso com 4 cenários, e os resultados evidenciam os benefícios para modeladores de processos.Palavras-Chave. Validação de Modelos; Processos intensivos em Conhecimento; Modelagem Conceitual; BPM.

show abstract

The power of "why" and "why not": enriching scenario exploration with provenance

Cited by 32 publications

References 25 publications

Solver-Aided Multi-Party Configuration

Solver-Aided Multi-Party Configuration

Platinum: Reusing Constraint Solutions in Bounded Analysis of Relational Logic

Uma Estratégia baseada em Regras para Instanciação, Validação e Simulação de Modelos de Processos intensivos em Conhecimento

Contact Info

Product

Resources

About