Experiments with Test Case Generation and Runtime Analysis

Artho, Cyrille; Drusinksy, D.; Goldberg, Allen; Havelund, Klaus; Lowry, Mike; Păsăreanu, Corina S.; Roşu, Grigore; Visser, Willem

doi:10.1007/3-540-36498-6_5

Cited by 35 publications

(22 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These times were computed for a runtime monitor the authors programmed in Java and running on an AMD Athlon XP 2200+ system under Cygwin. 1 The number of subformulae that needed to be stored by the watcher, and hence the memory footprint of the algorithm, remains within reasonable bounds and grows proportionnally to the trace length.…”

Section: Resultsmentioning

confidence: 99%

“…Time intervals are used for expressing time delays in business contracts, as the properties in [15] demonstrate. MTL formulae are also used in [1] to express monitoring properties on plan execution for NASA's planetary rover controller K9. For example, an expression like G (start(plan) → F 1,5 start(drive1)) indicates that if the plan starts, then task drive1 should begin execution within 1 and 5 time units.…”

Section: Metric Temporal Logicmentioning

confidence: 99%

See 1 more Smart Citation

Runtime Monitoring of Message-Based Workflows with Data

Hallé

Villemaire

2008

2008 12th International IEEE Enterprise Distributed Object Computing Conference

View full text Add to dashboard Cite

We present an algorithm for the runtime monitoring of business process properties with data parameterization. The properties are expressed in LTL-FO + , an extension to traditional Linear Temporal Logic that includes full firstorder quantification over the data inside a trace of XML messages. The algorithm works "on-the-fly": it keeps in memory only the states that are necessary at each step. Initial results indicate that LTL-FO + is an appropriate language for expressing data dependencies on message traces and that its processing overhead on sample traces is acceptable.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Metric Temporal Logicmentioning

confidence: 99%

Runtime Monitoring of Message-Based Workflows with Data

Hallé

Villemaire

2008

2008 12th International IEEE Enterprise Distributed Object Computing Conference

View full text Add to dashboard Cite

show abstract

“…Temporal logics have also been used in run-time checking, even for the functional language Haskell [66]. Examples of run-time checkers of temporal logic formulas for Java are JavaMOP [17] and Java Pathfinder [3].…”

Section: Context-free Grammarsmentioning

confidence: 99%

Combining Monitoring with Run-Time Assertion Checking

Boer

Gouw

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. According to a study in 2002 commisioned by a US Department, software bugs annually costs the US economy an estimated $59 billion 1 . A more recent study in 2013 by Cambridge University estimated that the global cost has risen to $312 billion globally 2 .There exists various ways to prevent, isolate and fix software bugs, ranging from lightweight methods that are (semi)-automatic, to heavyweight methods that require significant user interaction. Our own method described in this tutorial is based on automated run-time checking of a combination of protocol-and data-oriented properties of object-oriented programs. Run-Time Checking of Object-Oriented ProgramsGiven a program and a specification, a run-time verifier inserts checks in the code that determine whether the specification is satisfied. The checks are triggered during an actual execution of the program. In contrast to static verification, where properties are checked with respect to all executions (possibly there are infinitely many), run-time checkers only consider a single execution of the program. There is a wide range of specification languages used in run-time verification. They can be partitioned into two categories: languages that focus on the control-flow (these approaches are also called "monitoring"), and those focussing on data-flow.As an example, one can use regular expressions to specify the order in which functions or methods in a program should be called [18]. Such specifications describe the control-flow of the program. Other formalisms for specifying controlflow are temporal logics, various kinds of automata and context-free grammars. For these formalisms, checking whether a given property holds of the current execution involves parsing a word (where the word is some representation of the trace of method calls in the current execution) in an automata. Generally only formalisms are chosen with a decidable parsing problem (in particular, this is the case for regular expressions, context-free grammars and most automata), so Approaches that specify data-flow usually do so by annotating the source code with assertions: logical formulas that must be true whenever control passes them. The formulas constrain the values of the program variables. If assertions are expressed in first-order logic with arithmetic, it is in general undecidable due to unbounded quantification (i.e. ranging over an infinite number of values) whether the assertion is true, thus usually the assertions are restricted in some way. For instance, Java contains an assert-statement which restricts to quantifier-free formulas (i.e. Boolean expressions). Design by Contract [53] provides a systematic way of using assertions to specify classes, interfaces and methods with respectively class invariants and pre-and postconditions. It was first used in the programming language Eiffel, and subsequently has also been applied to many other programming languages. For example, JML [14] is one of the most popular specification languages for Java and supports Design by Contract. JML...

show abstract

“…Metric temporal logic (MTL) is an extension of regular temporal logic for expressing time delays in business contracts [3,18]. For example, Interaction Specification 4 specifies that some event (the first buyOrder message) must occur before some timeout whose value is specified dynamically at runtime.…”

Section: Metric Temporal Logicmentioning

confidence: 99%

Runtime monitoring of web service choreographies using streaming XML

Hallé

Villemaire

2009

Proceedings of the 2009 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

A wide range of web service choreography constraints on the content and sequentiality of messages can be translated into Linear Temporal Logic (LTL). Although they can be checked statically on abstractions of actual services, it is desirable that violations of these specifications be also detected at runtime. In this paper, we show that, given a suitable translation of LTL formulae into XQuery expressions, such runtime monitoring of choreography constraints is possible by feeding the trace of messages to a streaming XQuery processor. The forward-only fragment of LTL is introduced; it represents the fragment of LTL supported by available streaming engines.

show abstract

Experiments with Test Case Generation and Runtime Analysis

Abstract:
QC 20160103

Cited by 35 publications

References 13 publications

Runtime Monitoring of Message-Based Workflows with Data

Runtime Monitoring of Message-Based Workflows with Data

Combining Monitoring with Run-Time Assertion Checking

Runtime monitoring of web service choreographies using streaming XML

Contact Info

Product

Resources

About

Experiments with Test Case Generation and Runtime Analysis

Abstract: QC 20160103

Cited by 35 publications

References 13 publications

Runtime Monitoring of Message-Based Workflows with Data

Runtime Monitoring of Message-Based Workflows with Data

Combining Monitoring with Run-Time Assertion Checking

Runtime monitoring of web service choreographies using streaming XML

Contact Info

Product

Resources

About

Abstract:
QC 20160103