scientific article; zbMATH DE number 1956591
From MaRDI portal
Publication:4417936
zbMATH Open1031.68545MaRDI QIDQ4417936FDOQ4417936
Authors: Jamieson M. Cobleigh, Dimitra Giannakopoulou, 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 of this publication is not available (Why is that?)
Recommendations
- Computer Aided Verification
- Automatic symbolic compositional verification by learning assumptions
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Automated Assumption Generation for Compositional Verification
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)
Cited In (65)
- Assume, guarantee or repair
- Synthesizing history and prophecy variables for symbolic model checking
- A weakness measure for GR(1) formulae
- A weakness measure for GR(1) formulae
- Automated Technology for Verification and Analysis
- Title not available (Why is that?)
- Compositional automata learning of synchronous systems
- Learning assumptions for compositional verification of timed automata
- Automated circular assume-guarantee reasoning
- Regression verification for multi-threaded programs
- Abstract contract synthesis and verification in the symbolic \(\mathbb{K}\) framework
- Learning residual alternating automata
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- The Birth of Model Checking
- Compositional analysis of C/C++ programs with veriSoft
- Verification of asynchronous systems with an unspecified component
- SAT-Based Compositional Verification Using Lazy Learning
- Refining Interface Alphabets for Compositional Verification
- Learning Meets Verification
- Automated assumption generation for compositional verification
- Automatic symbolic compositional verification by learning assumptions
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Automatic Synthesis of Assumptions for Compositional Model Checking
- Assume-guarantee verification for probabilistic systems
- From invariant checking to invariant inference using randomized search
- Learning deterministic probabilistic automata from a model checking perspective
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Generating models of infinite-state communication protocols using regular inference with abstraction
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Active learning for deterministic bottom-up nominal tree automata
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Active learning of nondeterministic finite state machines
- Compositional verification and 3-valued abstractions join forces
- Learning regular omega languages
- Query learning of derived \(\omega\)-tree languages in polynomial time
- Compositional analysis for verification of parameterized systems
- Compositionality Entails Sequentializability
- Grey-Box Checking
- Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
- Learning to verify branching time properties
- Compositional CSP traces refinement checking
- Learning register automata: from languages to program structures
- Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation)
- AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee
- Modular verification of higher-order functional programs
- Automated program repair using formal verification techniques
- Automated Assumption Generation for Compositional Verification
- A Minimized Assumption Generation Method for Component-Based Software Verification
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Learning-based compositional verification for synchronous probabilistic systems
- Learning Minimal Separating DFA’s for Compositional Verification
- Polynomial identification of \(\omega \)-automata
- A verification-driven framework for iterative design of controllers
- Local symmetry and compositional verification
- Transformations for compositional verification of assumption-commitment properties
- Automata learning with automated alphabet abstraction refinement
- Compositional reasoning
- Abstraction and learning for infinite-state compositional verification
- Verifying time partitioning in the DEOS scheduling kernel
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists
- Computer Aided Verification
- An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets
- Interpolation-based GR(1) assumptions refinement
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417936)
