Dynamic analysis helps to extract important information about software systems useful in testing, debugging and maintenance activities. Popular dynamic analysis techniques synthesize either information on the values of the variables or information on relations between invocation of methods. Thus, these approaches do not capture the important re-lations that exist between data values and invocation se-quences. In this paper, we introduce a technique, called GK-tail, for generating models that represent the interplay between program variables and method invocations. GK-tail extends the k-tail algorithm for extracting finite state automata from execution traces, to the case of finite state automata with parameters. The paper presents the techn...
AbstractTemporal logic is a valuable tool for specifying correctness properties of reactive programs...
This paper presents an approach to checking a running program against Linear Temporal Logic (LTL) sp...
The challenge of inferring state machines from log data or execution traces is well-established, and...
Many testing and analysis techniques use finite state mod-els to validate and verify the quality of ...
This article presents a method for the application of model checking, i.e., verifying a finite state...
We present a new active model-learning approach to generating abstractions of a system implementatio...
Finite state machine-based abstractions of software behaviour are popular because they can be used a...
peer reviewedWe describe an automata-theoretic approach to the automatic verification of concurrent...
Formal models are often used to describe the behavior of a computer program or component. Behavioral...
Abstract: This paper presents a method for the application of model checking, i.e. verifying a finit...
Checking infinite-state systems is frequently done by encoding infinite sets of states as regular la...
AbstractChecking infinite-state systems is frequently done by encoding infinite sets of states as re...
Abstract. State explosion in model checking continues to be the primary obstacle to widespread use o...
Abstract. Alternating automata have been commonly used as a basis for static verification of reactiv...
International audienceVerification is decisive for embedded software. The goal of this work is to ve...
AbstractTemporal logic is a valuable tool for specifying correctness properties of reactive programs...
This paper presents an approach to checking a running program against Linear Temporal Logic (LTL) sp...
The challenge of inferring state machines from log data or execution traces is well-established, and...
Many testing and analysis techniques use finite state mod-els to validate and verify the quality of ...
This article presents a method for the application of model checking, i.e., verifying a finite state...
We present a new active model-learning approach to generating abstractions of a system implementatio...
Finite state machine-based abstractions of software behaviour are popular because they can be used a...
peer reviewedWe describe an automata-theoretic approach to the automatic verification of concurrent...
Formal models are often used to describe the behavior of a computer program or component. Behavioral...
Abstract: This paper presents a method for the application of model checking, i.e. verifying a finit...
Checking infinite-state systems is frequently done by encoding infinite sets of states as regular la...
AbstractChecking infinite-state systems is frequently done by encoding infinite sets of states as re...
Abstract. State explosion in model checking continues to be the primary obstacle to widespread use o...
Abstract. Alternating automata have been commonly used as a basis for static verification of reactiv...
International audienceVerification is decisive for embedded software. The goal of this work is to ve...
AbstractTemporal logic is a valuable tool for specifying correctness properties of reactive programs...
This paper presents an approach to checking a running program against Linear Temporal Logic (LTL) sp...
The challenge of inferring state machines from log data or execution traces is well-established, and...