scientific article; zbMATH DE number 1956591

Dimitra Giannakopoulou, Jamieson M. Cobleigh, Corina S. Păsăreanu

Publication date: 30 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2619/26190331.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Learning and adaptive systems in artificial intelligence (68T05) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (51)

Assume, Guarantee or Repair ⋮ Regression Verification for Multi-threaded Programs ⋮ Local Symmetry and Compositional Verification ⋮ Compositional analysis for verification of parameterized systems ⋮ Compositional Reasoning ⋮ AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee ⋮ Learning regular omega languages ⋮ Learning to verify branching time properties ⋮ Unnamed Item ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Active learning for deterministic bottom-up nominal tree automata ⋮ Automated program repair using formal verification techniques ⋮ The Birth of Model Checking ⋮ Synthesizing history and prophecy variables for symbolic model checking ⋮ Automated Assume-Guarantee Reasoning by Abstraction Refinement ⋮ Concurrent Kleene algebra with observations: from hypotheses to completeness ⋮ Learning Meets Verification ⋮ Active learning of nondeterministic finite state machines ⋮ Modular Verification of Higher-Order Functional Programs ⋮ Learning register automata: from languages to program structures ⋮ Verification of asynchronous systems with an unspecified component ⋮ Learning to divide and conquer: applying the $L^*$ algorithm to automate assume-guarantee reasoning ⋮ Automated assumption generation for compositional verification ⋮ Automatic symbolic compositional verification by learning assumptions ⋮ Compositionality Entails Sequentializability ⋮ A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees ⋮ Interpolation-Based GR(1) Assumptions Refinement ⋮ From invariant checking to invariant inference using randomized search ⋮ Polynomial Identification of $$\omega $$-Automata ⋮ Compositional CSP Traces Refinement Checking ⋮ Compositional verification and 3-valued abstractions join forces ⋮ Generating models of infinite-state communication protocols using regular inference with abstraction ⋮ Compositional analysis of C/C++ programs with veriSoft ⋮ Automated Compositional Reasoning of Intuitionistically Closed Regular Properties ⋮ An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets ⋮ Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys ⋮ Automatic Synthesis of Assumptions for Compositional Model Checking ⋮ Grey-Box Checking ⋮ Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation) ⋮ Automated Circular Assume-Guarantee Reasoning ⋮ A weakness measure for GR(1) formulae ⋮ Learning Minimal Separating DFA’s for Compositional Verification ⋮ A weakness measure for GR(1) formulae ⋮ Automata Learning with Automated Alphabet Abstraction Refinement ⋮ Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists ⋮ A novel learning algorithm for Büchi automata based on family of DFAs and classification trees ⋮ Abstract Contract Synthesis and Verification in the Symbolic 𝕂 Framework ⋮ A verification-driven framework for iterative design of controllers ⋮ Learning residual alternating automata ⋮ A framework for compositional verification of multi-valued systems via abstraction-refinement ⋮ Verifying time partitioning in the DEOS scheduling kernel

This page was built for publication: