Combining Induction, Deduction, and Structure for Verification and Synthesis

Seshia, Sanjit A.

doi:10.1109/jproc.2015.2471838

Cited by 44 publications

(50 citation statements)

References 86 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Paul A. et al proposed a general formal framework for architecture composability based on an associative, commutative and idempotent architecture composition operator [53]. Sanjit A.S presented a formal methodology and a theoretical verification and synthesis framework that integrates inductive learning with deductive reasoning [54]. Stavros T. detailed the key principles of compositionality focusing on interface design for MDD [55].…”

Section: Dependabilitymentioning

confidence: 99%

A Comprehensive Technological Survey on Dependable Self-Managing CPS: The Decade of Researches on Correctness and Dependability

Zhou¹,

Hou²,

Zhang³

et al. 2017

Preprint

View full text Add to dashboard Cite

Though Cyber Physical Systems (CPS) become very popular in last the decade, dependability of CPS is still a critical issue and related survey is rare. We try to spell out the jigsaw of technologies and figure out the technical trends of dependable self-managing CPS. This survey first recalls the motivation and the similar concepts. By analyzing four generic architectures, we summarize the common characteristics and related assurance technologies, and propose a more generic environment-in-loop processing flow of CPS and a formal interaction flow between physical space and cyber space. Further, the similarity between correctness and dependability is formally analyzed and the new five research questions of dependable self-managing CPS are presented. Then we review the critical technologies and related correctness verification & validation (V&V) methods, the architectures for dependable self-managing CPS. Further, the detail dependability management and V&V technologies are surveyed, which covers the areas of running-time fault management methods and whole life cycle V&V technologies, maintenance and available tool sets. For holistic CPS development, Modeling techniques and MDE (model driven engineering) based V&V methods are analyzed in detail. Then we complete the jigsaw of technologies and figure out the missing part. Further, we propose the technical challenges and the further direction. To our best knowledge, this is the first comprehensive survey on dependable self-managing CPS development and evaluation.

show abstract

Section: Dependabilitymentioning

confidence: 99%

A Comprehensive Technological Survey on Dependable Self-Managing CPS: The Decade of Researches on Correctness and Dependability

Zhou¹,

Hou²,

Zhang³

et al. 2017

Preprint

View full text Add to dashboard Cite

show abstract

“…Much research effort targets fault detection, diagnosis, and repair, some looking to combine verification and machine learning in different ways; for example, Seshia [17] showed tight integration of induction and deduction helps complete incomplete models through synthesis, and Model checking and logic-based reasoning are used for program repair; for example, Buccafurri et al [8] used abductive reasoning to locate errors in concurrent programs and suggest repairs for very specific types of errors (such as variable assignment and flipped consecutive statements). This limitation was due to the lack of a reasoning framework that generalizes from ground facts.…”

Section: Related Workmentioning

confidence: 99%

Automated support for diagnosis and repair

et al. 2015

View full text Add to dashboard Cite

show abstract

“…In reactive synthesis, a finite-state controller is derived from correctness requirements in temporal logic, but this problem becomes undecidable when synthesizing a distributed protocol (see [28] for a survey and [6,21] for recent approaches aimed at coping with the high computational complexity of the synthesis problem). An interesting recent approach to distributed protocol design relies on genetic programming [14]: given an initial protocol and correctness requirements, if the model checker finds that the protocol does not satisfy the requirements, the tool tries multiple mutations of the guards and updates used in the protocol, ranks the resulting versions by estimating how close they are to satisfying the requirements using state-space analysis, and iterates by probabilistically selecting a variant with weights proportional to ranks.…”

Section: Related Workmentioning

confidence: 99%

Transit

et al. 2013

View full text Add to dashboard Cite

With the maturing of technology for model checking and constraint solving, there is an emerging opportunity to develop programming tools that can transform the way systems are specified. In this paper, we propose a new way to program distributed protocols using concolic snippets. Concolic snippets are sample execution fragments that contain both concrete and symbolic values. The proposed approach allows the programmer to describe the desired system partially using the traditional model of communicating extended finite-state-machines (EFSM), along with high-level invariants and concrete execution fragments. Our synthesis engine completes an EFSM skeleton by inferring guards and updates from the given fragments which is then automatically analyzed using a model checker with respect to the desired invariants. The counterexamples produced by the model checker can then be used by the programmer to add new concrete execution fragments that describe the correct behavior in the specific scenario corresponding to the counterexample.We describe TRANSIT, a language and prototype implementation of the proposed specification methodology for distributed protocols. Experimental evaluations of TRANSIT to specify cache coherence protocols show that (1) the algorithm for expression inference from concolic snippets can synthesize expressions of size 15 involving typical operators over commonly occurring types, (2) for a classical directory-based protocol, TRANSIT automatically generates, in a few seconds, a complete implementation from a specification consisting of the EFSM structure and a few concrete examples for every transition, and (3) a published partial description of the SGI Origin cache coherence protocol maps directly to symbolic examples and leads to a complete implementation in a few iterations, with the programmer correcting counterexamples resulting from underspecified transitions by adding concrete examples in each iteration.

show abstract

Combining Induction, Deduction, and Structure for Verification and Synthesis

Cited by 44 publications

References 86 publications

A Comprehensive Technological Survey on Dependable Self-Managing CPS: The Decade of Researches on Correctness and Dependability

A Comprehensive Technological Survey on Dependable Self-Managing CPS: The Decade of Researches on Correctness and Dependability

Automated support for diagnosis and repair

Transit

Contact Info

Product

Resources

About