Inferring Network Invariants Automatically

Grinchtein, Olga; Leucker, Martin; Piterman, Nir

doi:10.1007/11814771_40

Cited by 37 publications

(42 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The use of auxiliary variables by this transformation results in a significant improvement in the number of required clauses with respect to the current stateof-the-art in translating DFA identification to SAT [12] and [13]. Our transformation only requires O(k 2 |V |) clauses for a DFA identification problem, where k is the size of the sought DFA and V are the states of the APTA constructed from the input sample.…”

Section: Discussionmentioning

confidence: 99%

“…This encoding is identical to the CSP-based translation given in [13], and can be considered as the current state-of-the-art in translations of DFA identification to SAT. Notice that the size of the direct encoding is O(|C| 2 |V | 2 ).…”

Section: Direct Encodingmentioning

confidence: 99%

“…An alternative approach [13] uses the well-known translation of DFA identification to an integer constraint satisfaction problem (CSP) from [14]. It translates this CSP into SAT in two ways: a unary and a binary encoding of the integers.…”

Section: Introductionmentioning

confidence: 99%

“…A naive direct encoding [15] of these constraints would lead to O(k 2 |V | 2 ) clauses, where k is the size of the identified DFA, and V is the set of labeled examples. Such a direct encoding is in fact identical to the unary encoding from [13], which can be considered the current state-of-the-art in translations of DFA identification to SAT. Our encoding, however, requires only O(k 2 |V |) clauses.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Exact DFA Identification Using SAT Solvers

Heule

Verwer

2010

Grammatical Inference: Theoretical Results and Applications

View full text Add to dashboard Cite

Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level SAT representation, our approach is competitive with alternative techniques. Our contributions are fourfold: First, we propose a compact translation of DFA identification into SAT. Second, we reduce the SAT search space by adding lower bound information using a fast max-clique approximation algorithm. Third, we include many redundant clauses to provide the SAT solver with some additional knowledge about the problem. Fourth, we show how to use the flexibility of our translation in order to apply it to very hard problems. Experiments on a well-known suite of random DFA identification problems show that SAT solvers can efficiently tackle all instances. Moreover, our algorithm outperforms state-of-the-art techniques on several hard problems.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Direct Encodingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Exact DFA Identification Using SAT Solvers

Heule

Verwer

2010

Grammatical Inference: Theoretical Results and Applications

View full text Add to dashboard Cite

show abstract

“…Recent work on parameterized verification includes [11,7]. The former paper [11] proposes a method to find network invariants using finite automata learning algorithms due to Angluin and Beirmann.…”

Section: Related Workmentioning

confidence: 99%

Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems

Clarke

Talupur

Veith

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. The parameterized verification of concurrent algorithms and protocols has been addressed by a variety of recent methods. Experience shows that there is a trade-off between techniques which are widely applicable but depend on nontrivial human guidance, and fully automated approaches which are tailored for narrow classes of applications. In this spectrum, we propose a new framework based on environment abstraction which exhibits a large degree of automation and can be easily adjusted to different fields of application. Our approach is based on two insights: First, we argue that natural abstractions for concurrent software are derived from the "Ptolemaic" perspective of a human engineer who focuses on a single reference process. For this class of abstractions, we demonstrate soundness of abstraction under very general assumptions. Second, most protocols in given a class of protocols -for instance, cache coherence protocols and mutual exclusion protocols -can be modeled by small sets of high level compound statements. These two insights allow to us efficiently build precise abstract models for given protocols which can then be model checked. We demonstrate the power of our method by applying it to various well known classes of protocols.

show abstract

Minimal Synthesis of String to String Functions from Examples

Hamza

Kunčak

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Inferring Network Invariants Automatically

Cited by 37 publications

References 20 publications

Exact DFA Identification Using SAT Solvers

Exact DFA Identification Using SAT Solvers

Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems

Minimal Synthesis of String to String Functions from Examples

Contact Info

Product

Resources

About