Sciweavers

205 search results - page 16 / 41
» Testing the Equivalence of Regular Languages
Sort
View
ICDE
2003
IEEE
209views Database» more  ICDE 2003»
15 years 10 months ago
An Evaluation of Regular Path Expressions with Qualifiers against XML Streams
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
Dan Olteanu, François Bry, Tobias Kiesling
78
Voted
KBSE
2010
IEEE
14 years 7 months ago
How did you specify your test suite
Although testing is central to debugging and software certification, there is no adequate language to specify test suites over source code. Such a language should be simple and c...
Andreas Holzer, Christian Schallhart, Michael Taut...
85
Voted
ADG
2006
Springer
191views Mathematics» more  ADG 2006»
15 years 1 months ago
Automatic Verification of Regular Constructions in Dynamic Geometry Systems
We present an application of an automatic theorem proving (ATP) in the verification of constructions made with dynamic geometry software (DGS). Given a specification language for g...
Predrag Janicic, Pedro Quaresma
77
Voted
FOSSACS
2004
Springer
15 years 2 months ago
safeDpi: A Language for Controlling Mobile Code
safeDpi is a distributed version of the Picalculus, in which processes are located at dynamically created sites. Parametrised code may be sent between sites using so-called ports, ...
Matthew Hennessy, Julian Rathke, Nobuko Yoshida
SSIRI
2010
14 years 7 months ago
A Formal Framework for Mutation Testing
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
Fevzi Belli, Mutlu Beyazit