Model Checking Partial State Spaces with 3-Valued Temporal Logics

Bruns, Glenn; Godefroid, Patrice

doi:10.1007/3-540-48683-6_25

Cited by 175 publications

(163 citation statements)

References 11 publications

Supporting

Mentioning

161

Contrasting

Unclassified

Order By: Relevance

“…Our technique, which combines three-valued temporal logic with interval arithmetic techniques, allows us to apply multivalued model checking to analog systems (rather than classic 2-valued model checking). We show that in the context of analog circuit verification, the gain of using multivalued model checking is the same achieved for digital (infinite) systems [1]: Namely both truth and falsity of general branching temporal formulae are preserved.…”

Section: Motivationmentioning

confidence: 82%

“…In fact, it allows to apply 3-valued model checking techniques-rather than classical (2-valued) model checking-for the automated reasoning on analog circuits. In the context of digital systems, three-valued abstractions and model checking [1] have the advantage of preserving both truth and falsity of totally branching temporal logic from so called partial Kripke structures (playing the rule of abstract systems) to complete Kripke structures (playing the role of concrete digital systems). On the contrary, classical model checking allows only the preservation of formulae containing exclusively universal path quantifiers and evaluating to the truth over the abstraction.…”

Section: Relating Abstract and Concrete Semantics: Preservation Resultsmentioning

confidence: 99%

“…In order to formalize the above ideas, we introduce the notion of preserving box modal abstractions for a given analog model C = X D , X I , D, I . The conditions ensuring a box modal abstraction to be preserving for C naturally extends the notion of completeness preorder in [1], to the case in which the concrete system evolves according to continuous trajectories (rather than following discrete paths). Let ≺ to be the partial relation on {tt, ff, ⊥} such that ⊥ ≺ tt, ⊥ ≺ ff ∧ ∀a ∈ {tt, ff, ⊥}(a ≺ a).…”

Section: Relating Abstract and Concrete Semantics: Preservation Resultsmentioning

confidence: 99%

“…Traditionally, the above task relies largely on the cooperation of expert knowledge, manual calculation, and numerical circuit simulation [4]. A quite recent and active research field, named as symbolic analysis of analog circuits, aims at (1) endowing the verification process of some degree of automation (2) coping with variability of parameters and input signals [10,6,11]. The above objectives are fullfilled by providing computer algebra algorithms to simplify the mathematical model of an analog circuit.…”

Section: Motivationmentioning

confidence: 99%

“…The problem of checking, for each box b ∈ B, whether b|= 3 φ can be easily solved on 1 Here, we assume to deal with a input model such that input variables maintain a constant (arbitrary) value overall the execution of the system. However, a symmetrical extreme parameter model in which input variables are admitted to assume any value while the system evolves, could be also easily considered for the abstraction generation.…”

Section: Ctlf Model Checkingmentioning

confidence: 99%

See 4 more Smart Citations

Three-valued automated reasoning on analog properties

Gentilini

Schneider

Deisting

2007

Proceedings of the 17th ACM Great Lakes Symposium on VLSI

View full text Add to dashboard Cite

We deal with the problem of designing suitable languages for the modeling and the automatic verification of properties over analog circuits. To this purpose, we suitably enrich classical temporal logics with basic formulae allowing to model arbitrary functions relating analog variables. We show how to automatically check the resulting CTL f formulae on analog circuits. In particular, we rely on interval arithmetic methods and we extend to the analog context a number of techniques for the abstraction and the verification of digital systems, based on three-valued temporal logics. Categories and Subject Descriptors MOTIVATIONAnalog circuit design is of great importance in nowadays microelectronics [4,6]. In order to avoid a large number of defective prototypes, it is necessary to check significant properties of an analog circuit before manufacturing it. Traditionally, the above task relies largely on the cooperation of expert knowledge, manual calculation, and numerical circuit simulation [4]. A quite recent and active research field, named as symbolic analysis of analog circuits, aims at (1) endowing the verification process of some degree of automation (2) coping with variability of parameters and input signals [10,6,11]. The above objectives are fullfilled by providing computer algebra algorithms to simplify the mathematical model of an analog circuit. Typically, such procedures Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. work by detecting and deleting subformulae whose influence on the evolution of the system is insignificant. Despite the promising developments, system analysis is still far from being a completely automatic method for the verification of analog circuits.On the contrary, in the context of digital circuits, model checking allows to verify (1) entirely automatically (2) along all possible executions of the systems, properties that are formally stated in a temporal logic. A natural way to apply model checking to the context of analog circuits verification is the extraction of some finite digital abstraction from the corresponding analog model. Such an approach has been adopted in [5], where the authors qualitatively proved its effectiveness by applying it to some concrete (and well-understood) examples. As part of their work, the authors proposed an enrichment of classical temporal logic languages, recognizing the inadequacy of the latter to model analog properties. However, their extension is still not satisfactory: As an example, simple properties comparing the values of analog variables along their evolution can still not be dealt with in [5]. Indeed, even if a constraint of the kind x < y could be expressed in [5], a major pr...

show abstract

Section: Motivationmentioning

confidence: 82%

Section: Relating Abstract and Concrete Semantics: Preservation Resultsmentioning

confidence: 99%

Section: Relating Abstract and Concrete Semantics: Preservation Resultsmentioning

confidence: 99%

Section: Motivationmentioning

confidence: 99%

Section: Ctlf Model Checkingmentioning

confidence: 99%

See 3 more Smart Citations

Three-valued automated reasoning on analog properties

Gentilini

Schneider

Deisting

2007

Proceedings of the 17th ACM Great Lakes Symposium on VLSI

View full text Add to dashboard Cite

show abstract

Of software and change

Ghezzi

2017

J Softw Evol Proc

View full text Add to dashboard Cite

Change has been recognized as the distinguishing feature that makes software different from any other human-produced artifacts. Initial reflections on the urgent and unavoidable need to master change date back to the 1970s. However, despite the continuous progress that characterized software technology since, in practice, software change is still often handled as an afterthought, in an ad hoc and unprincipled manner. Agile development methods have been proposed and are now widely adopted to accommodate change during development. Recent extensions to also include operation-known as DevOps-are increasingly and successfully adopted by industry. Still, principled and rigorous foundations that can be taught, practiced, and replicated systematically are lacking.This paper argues that change has to become a first-class concept and that the development tools used by engineers and the runtime environment supporting software execution should be structured in a way that naturally accommodates change. It also provides a perspective along which several research approaches that were investigated by the community in the past decade might be integrated and extended to make this vision become true.Two main change categories are identified-evolution and adaptation-along with the forces that drive them. The paper discusses when and how the developed software can be designed in a way that it can self-adapt. It also discusses how the software itself can cooperate with humans in-the-loop to help them in their design and development efforts. Finally, it outlines a roadmap of future work needed to progress in the direction of supporting and automating software change that would lead to dependable adaptation and evolution.

show abstract

Tracing Integration Analysis in Component-Based Formal Specifications

López‐Nores

Pazos‐Arias

García‐Duque

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The correctness of a component-based specification is not guaranteed by the correctness of its components alone; on the contrary, integration analysis is needed to observe their conjoint behavior. Existing approaches often leave the results of the analysis at the level of the integrated system, without tracing them onto the corresponding components. This effectively results in loss of architecture, as it is no longer possible to reason over those components and evolve their specification while keeping the results of integration analysis. This paper presents a formal approach to automatically translate changes on the integrated system into revisions of the components and the architecture initially defined by the developers. Several architectural alternatives are provided that, besides allowing developers to reason about the system from different points of view, promote its correct modularization in two overlapping perspectives: the encapsulation of crosscutting concerns and the elaboration of the architecture desired for the final implementation.

show abstract

Model Checking Partial State Spaces with 3-Valued Temporal Logics

Cited by 175 publications

References 11 publications

Three-valued automated reasoning on analog properties

Three-valued automated reasoning on analog properties

Of software and change

Tracing Integration Analysis in Component-Based Formal Specifications

Contact Info

Product

Resources

About