| Publication | Date of Publication | Type |
|---|
Combining sequential test cases into an equivalent set of adaptive test cases
Journal of Logical and Algebraic Methods in Programming | 2025-12-30 | Paper |
| An Implementation Relation for Cyclic Systems with Refusals and Discrete Time | 2024-03-14 | Paper |
Testing using CSP Models: Time, Inputs, and Outputs
ACM Transactions on Computational Logic | 2023-04-05 | Paper |
Removing redundant refusals: minimal complete test suites for failure trace semantics
Information and Computation | 2023-03-07 | Paper |
Inputs and Outputs in CSP
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
Normalised squeeziness and failed error propagation
Information Processing Letters | 2019-09-20 | Paper |
Passive testing with asynchronous communications and timestamps
Distributed Computing | 2018-08-10 | Paper |
Decidability and complexity for quiescent consistency
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Decidability and complexity for quiescent consistency
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Decidability and complexity for quiescent consistency and its variations
Information and Computation | 2017-11-16 | Paper |
Correction to "Reduced Length Checking Sequences" [Sep 02 93-99]
IEEE Transactions on Computers | 2017-08-08 | Paper |
Controllable Testing from Nondeterministic Finite State Machines with Multiple Ports
IEEE Transactions on Computers | 2017-07-27 | Paper |
Verifying and Comparing Finite State Machines for Systems that Have Distributed Interfaces
IEEE Transactions on Computers | 2017-07-12 | Paper |
Parallel Algorithms for Generating Harmonised State Identifiers and Characterising Sets
IEEE Transactions on Computers | 2017-05-16 | Paper |
An extended framework for passive asynchronous testing
Journal of Logical and Algebraic Methods in Programming | 2016-11-30 | Paper |
Complexity of data dependence problems for program schemas with concurrency
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Timed implementation relations for the distributed test architecture
Distributed Computing | 2014-07-11 | Paper |
Bayesian inference and optimal release times. For two software failure models
Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales (España) | 2014-01-15 | Paper |
Checking sequences for distributed test architectures
Distributed Computing | 2013-06-28 | Paper |
Using schedulers to test probabilistic distributed systems
Formal Aspects of Computing | 2013-03-22 | Paper |
Implementation relations and test generation for systems with distributed interfaces
Distributed Computing | 2013-02-04 | Paper |
Overcoming controllability problems in distributed testing from an input output transition system
Distributed Computing | 2013-02-04 | Paper |
Using Time to Add Order to Distributed Testing
FM 2012: Formal Methods | 2012-11-08 | Paper |
The complexity of asynchronous model based testing
Theoretical Computer Science | 2012-10-11 | Paper |
Squeeziness: an information theoretic measure for avoiding fault masking
Information Processing Letters | 2012-07-20 | Paper |
On the computational complexity of dynamic slicing problems for program schemas
Mathematical Structures in Computer Science | 2011-12-08 | Paper |
Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas
The Journal of Logic and Algebraic Programming | 2011-12-02 | Paper |
Reaching and Distinguishing States of Distributed Systems
SIAM Journal on Computing | 2011-04-04 | Paper |
Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas
The Journal of Logic and Algebraic Programming | 2011-02-09 | Paper |
Checking experiments for stream X-machines
Theoretical Computer Science | 2010-08-24 | Paper |
Formal Techniques for Networked and Distributed Systems - FORTE 2003
Lecture Notes in Computer Science | 2010-05-26 | Paper |
A trajectory-based strict semantics for program slicing
Theoretical Computer Science | 2010-03-29 | Paper |
Applying adaptive test cases to nondeterministic implementations
Information Processing Letters | 2010-01-18 | Paper |
Overcoming observability problems in distributed test architectures
Information Processing Letters | 2010-01-18 | Paper |
Canonical finite state machines for distributed systems
Theoretical Computer Science | 2009-12-15 | Paper |
Using a minimal number of resets when testing from a finite state machine
Information Processing Letters | 2009-07-21 | Paper |
Formal Approaches to Software Testing
Lecture Notes in Computer Science | 2009-06-04 | Paper |
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
Formal Aspects of Computing | 2009-05-27 | Paper |
Overcoming controllability problems with fewest channels between testers
Computer Networks | 2009-04-17 | Paper |
Testing from a stochastic timed system with a fault model
The Journal of Logic and Algebraic Programming | 2009-02-19 | Paper |
Controllable Test Cases for the Distributed Test Architecture
Automated Technology for Verification and Analysis | 2008-11-20 | Paper |
Reduced length checking sequences
IEEE Transactions on Computers | 2007-01-09 | Paper |
Reducing the cost of applying adaptive test cases
Computer Networks | 2006-12-07 | Paper |
Formal Techniques for Networked and Distributed Systems - FORTE 2005
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Formal Techniques for Networked and Distributed Systems – FORTE 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
Theoretical Computer Science | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2040802 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 2040801 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 2013593 (Why is no real title available?) | 2003-12-04 | Paper |
Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine
The Computer Journal | 2003-08-07 | Paper |
Testing conformance to a quasi-non-deterministic stream X-machine
Formal Aspects of Computing | 2003-06-26 | Paper |
The Zero-Free Intervals for Characteristic Polynomials of Matroids
Combinatorics, Probability and Computing | 1999-08-23 | Paper |
Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
The Computer Journal | 1999-05-31 | Paper |
