Inferring Network Invariants Automatically
From MaRDI portal
Publication:3613429
DOI10.1007/11814771_40zbMath1222.68379OpenAlexW1506935337MaRDI QIDQ3613429
Martin Leucker, Nir Piterman, Olga Grinchtein
Publication date: 12 March 2009
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11814771_40
Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (10)
Inferring regular languages and \(\omega\)-languages ⋮ Learning Meets Verification ⋮ Regular inference as vertex coloring ⋮ Verification of asynchronous systems with an unspecified component ⋮ Fundamental results for learning deterministic extended finite state machines from queries ⋮ Learning Transparent Data Automata ⋮ FSM inference from long traces ⋮ Learning Minimal Separating DFA’s for Compositional Verification ⋮ Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems ⋮ Network invariants for real-time systems
This page was built for publication: Inferring Network Invariants Automatically
