#### Filter Results:

- Full text PDF available (117)

#### Publication Year

1992

2017

- This year (1)
- Last 5 years (24)
- Last 10 years (52)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Key Phrases

#### Method

Learn More

- Stefan Edelkamp, Alberto Lluch-Lafuente, Stefan Leue
- SPIN
- 2001

We present the explicit state model checker HSF-SPIN which is based on the model checker SPIN and its Promela modeling language. HSF-SPIN incorporates directed search algorithms for checking safety and a large class of LTL-specified liveness properties. We start off from the A* algorithm and define heuristics to accelerate the search into the direction of a… (More)

- Hanêne Ben-Abdallah, Stefan Leue
- TACAS
- 1997

Message Sequence Charts (MSCs) are increasingly used in software engineering methodologies and tools to capture, for instance, system requirements, test scenarios, and simulation traces. They have been standardized by ITU-T in Recommendation Z.120 IT96]. However, various aspects of environment behavior remain underspeciied in MSCs, e.g., the presence of… (More)

- Giuseppe Di Fatta, Stefan Leue, Evghenia Stegantova
- SOQUA
- 2006

We present a method to enhance fault localization for software systems based on a frequent pattern mining algorithm. Our method is based on a large set of test cases for a given set of programs in which faults can be detected. The test executions are recorded as function call trees. Based on test oracles the tests can be classified into successful and… (More)

- Stefan Edelkamp, Stefan Leue, Alberto Lluch-Lafuente
- International Journal on Software Tools for…
- 2002

The success of model checking is largely based on its ability to efficiently locate errors in software designs. If an error is found, a model checker produces a trail that shows how the error state can be reached, which greatly facilitates debugging. However, while current model checkers find error states efficiently, the counterexamples are often… (More)

- Husain Aljazzar, Stefan Leue
- IEEE Transactions on Software Engineering
- 2010

Current stochastic model checkers do not make counterexamples for property violations readily available. In this paper, we apply directed explicit state-space search to discrete and continuous-time Markov chains in order to compute counterexamples for the violation of PCTL or CSL properties. Directed explicit state-space search algorithms explore the state… (More)

- Peter B. Ladkin, Stefan Leue
- Formal Aspects of Computing
- 1995

We give a semantics for Message Flow Graphs (MFGs), which play the role for interprocess communication that Program Dependence Graphs play for control flow in parallel processes. MFGs have been used to analyse parallel code, and are closely related to Message Sequence Charts and Time Sequence Diagrams in telecommunications systems. Our requirements are… (More)

- Hanêne Ben-Abdallah, Stefan Leue
- TACAS
- 1998

The latest ITU-T standard syntax of Message Sequence Charts (MSCs) 16] ooers several operators to compose MSCs in a hierarchical , iterating, and nondeterministic way. However, current tools operate on MSCs that describe nite, deterministic behavior. In this paper, we describe the architecture and the partial implementation of Mesa, an MSC-based tool that… (More)

- Hanêne Ben-Abdallah, Stefan Leue
- FORTE
- 1997

When dealing with timing constraints, the Z.120 standard of Message Sequence Charts (MSCs) is still evolving along with several proposals. This paper rst reviews proposed extensions of MSCs to describe timing constraints. Secondly, the paper describes an analysis technique for timing consistency in iterating and branching MSC speciications. The analysis… (More)

We present an approach to reconcile explicit state model checking and heuristic directed search and provide experimental evidence that the model checking problem for concurrent systems, such as communications protocols, can be solved more efficiently, since finding a state violating a property can be understood as a directed search problem. In our work we… (More)

- Husain Aljazzar, Stefan Leue
- Artif. Intell.
- 2011

We present a directed search algorithm, called K∗, for finding the k shortest paths between a designated pair of vertices in a given directed weighted graph. K∗ has two advantages compared to current k-shortest-paths algorithms. First, K∗ operates on-the-fly, which means that it does not require the graph to be explicitly available and stored in main… (More)