Model Checking

Peled, Doron; Spoletini, Paola

doi:10.1002/9780470050118.ecse247

Cited by 20 publications

(16 citation statements)

References 74 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Traditionally, iterative fixed-point computation based techniques like data-flow analyses [25], abstract interpretation [11] or model checking [13] have been used for discovering these invariants. An alternative is to use a constraint-based invariant generation [8,10,7,32] approach that translates (the second-order constraints represented by) a program into (first-order quantifier-free) satisfiability constraints that can be solved using off-the-shelf solvers.…”

Section: Introductionmentioning

confidence: 99%

Program analysis as constraint solving

Gulwani

Srivastava

Venkatesan

2008

Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation

149

113

View full text Add to dashboard Cite

A constraint-based approach to invariant generation in programs translates a program into constraints that are solved using off-theshelf constraint solvers to yield desired program invariants.In this paper we show how the constraint-based approach can be used to model a wide spectrum of program analyses in an expressive domain containing disjunctions and conjunctions of linear inequalities. In particular, we show how to model the problem of context-sensitive interprocedural program verification. We also present the first constraint-based approach to weakest precondition and strongest postcondition inference. The constraints we generate are boolean combinations of quadratic inequalities over integer variables. We reduce these constraints to SAT formulae using bitvector modeling and use off-the-shelf SAT solvers to solve them.Furthermore, we present interesting applications of the above analyses, namely bounds analysis and generation of most-general counter-examples for both safety and termination properties. We also present encouraging preliminary experimental results demonstrating the feasibility of our technique on a variety of challenging examples.

show abstract

Section: Introductionmentioning

confidence: 99%

Program analysis as constraint solving

Gulwani

Srivastava

Venkatesan

2008

Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation

149

113

View full text Add to dashboard Cite

show abstract

“…Model Checking. Model checking [CGP01,PPS09] was proposed in the 1980s independently by Clarke and Emerson [CE82], and Quielle and Sifakis [QS82]. It assumes an available mathematical model of a system and a property to check against the model expressed in a formal logic, such as Linear Temporal Logic (LTL) [Pnu81] or Computational Tree Logic (CTL) [BAMP81].…”

Section: Classifying Assurance Methods According To Techniquesmentioning

confidence: 99%

Using Models at Runtime to Address Assurance for Self-Adaptive Systems

et al. 2014

Self Cite

View full text Add to dashboard Cite

Abstract.A self-adaptive software system modifies its behavior at runtime in response to changes within the system or in its execution environment. The fulfillment of the system requirements needs to be guaranteed even in the presence of adverse conditions and adaptations. Thus, a key challenge for self-adaptive software systems is assurance. Traditionally, confidence in the correctness of a system is gained through a variety of activities and processes performed at development time, such as design analysis and testing. In the presence of selfadaptation, however, some of the assurance tasks may need to be performed at runtime. This need calls for the development of techniques that enable continuous assurance throughout the software life cycle. Fundamental to the development of runtime assurance techniques is research into the use of models at runtime (M@RT). This chapter explores the state of the art for using M@RT to address the assurance of self-adaptive software systems. It defines what information can be captured by M@RT, specifically for the purpose of assurance, and puts this definition into the context of existing work. We then outline key research challenges for assurance at runtime and characterize assurance methods. The chapter concludes with an exploration of selected application areas where M@RT could provide significant benefits beyond existing assurance techniques for adaptive systems.

show abstract

“…We divide them into two categories. Rule-based approaches use web rule languages (e.g., SWRL 1 , RIF 2 , RuleML 3 , WSML 4 ), modeling constraint languages such as OCL [7], languages coming from the business rule engine vendors or related bodies (e.g., PRR 5 ) and modal languages (temporal such as CTL and LTL [8], deontic, etc.). Policybased approaches make the management of the typically high number of rules to be followed by enterprises easier by grouping, structuring and prioritizing rules into policies.…”

Section: Existing Approaches To Business Process Compliance Managmentioning

confidence: 99%

“…Liu et al [18] provide a comprehensive approach for static compliance checking of BPEL 7 processes with a graphical language for modeling LTL-based compliance requirements and using a model checker. Another class of works uses formal representations of process modeling notations (e.g., Petri Nets [19], or the REO coordination language 8 , which supports a powerful language for temporal logic). Temporal rules are verified by using model checking techniques on these formal representations.…”

Section: B Related Approachesmentioning

confidence: 99%

CoReL: Policy-Based and Model-Driven Regulatory Compliance Management

Kharbili

Kelsen

et al. 2011

2011 IEEE 15th International Enterprise Distributed Object Computing Conference

View full text Add to dashboard Cite

Abstract-Regulatory compliance management is now widely recognized as one of the main challenges still to be efficiently dealt with in information systems. In the discipline of business process management in particular, compliance is considered as an important driver of the efficiency, reliability and market value of companies. It consists of ensuring that enterprise systems behave according to some guidance provided in the form of regulations. This paper gives a definition of the research problem of regulatory compliance. We show why we expect a formal policy-based and model-driven approach to provide significant advantages in allowing enterprises to flexibly manage decision-making related to regulatory compliance. For this purpose, we contribute CoReL, a domain-specific modeling language for representing compliance requirements that has a graphical concrete syntax. Informal semantics of CoReL are introduced and its use is illustrated on an example. CoReL allows to leverage business process compliance modeling and checking, enhancing it with regard to, among other dimensions, user-friendliness, genericity, and traceability.

show abstract

Model Checking

Cited by 20 publications

References 74 publications

Program analysis as constraint solving

Program analysis as constraint solving

Using Models at Runtime to Address Assurance for Self-Adaptive Systems

CoReL: Policy-Based and Model-Driven Regulatory Compliance Management

Contact Info

Product

Resources

About