Titlebook: Software Engineering and Formal Methods; 15th International C Alessandro Cimatti,Marjan Sirjani Conference proceedings 2017 Springer Intern

avarice

Modeling and Reasoning on Requirements Evolution with Constrained Goal Models, For example, users of a system may want new functionality or performance enhancements to cope with growing user population (changing requirements). Alternatively, vendors of a system may want to minimize costs in implementing requirements changes (evolution requirements). We propose to use Constrai

GRIN

吸引人的花招

An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions,he traditional (point-based) temporal logic MC, which can be recovered as a special case. Most results have been obtained by imposing suitable restrictions on interval labeling. In this paper, we overcome such limitations by using regular expressions to define the behavior of proposition letters ove

Resign

PART,: From Partial Analysis Results to a Proof Witness,ugs, . are used to increase the trust in program correctness, e.g., in Proof-Carrying Code (PCC). Correctness arguments are well-studied for single analyses, but not when a . together verifies a program, each of the analyses checking only a particular part. Such a set of partial, complementary analy

无瑕疵

郊外

Munificent

假设

,Using Shared Memory Abstractions to Design Eager Sequentializations for Weak Memory Models,nger need to be handled explicitly. However, existing sequentializations assume sequential consistency, which modern hardware architectures no longer guarantee. Here we describe a new approach to embed weak memory models within eager sequentializations. Our approach is based on the separation of int

Limousine

On Run-Time Enforcement of Authorization Constraints in Security-Sensitive Workflows,access control policies and authorization constraints, such as Separation of Duties. The synthesized enforcement mechanisms are able to guarantee both termination and compliance to security requirements, i.e. solving the run-time version of the Workflow Satisfiability Problem (WSP). No systematic ap

丰满中国