On the public citation graph

Formal methods for generating protocol conformance test sequences

0 signed · 99 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230060305openalex-snapshot
On general routing problems
inferredcites →https://doi.org/10.1007/978-1-4615-6698-4_20openalex-snapshot
A Survey of Formal Methods
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1016/0140-3664(87)90104-6openalex-snapshot
Protocol testing techniques
inferredcites →https://doi.org/10.1016/0140-3664(87)90137-xopenalex-snapshot
Test sequence selection based on static data flow analysis
inferredcites →https://doi.org/10.1016/0169-7552(87)90087-0openalex-snapshot
OSI conformance testing
inferredcites →https://doi.org/10.1016/0169-7552(88)90064-5openalex-snapshot
A protocol test generation procedure
inferredcites →https://doi.org/10.1016/s0019-9958(61)80003-xopenalex-snapshot
State-identification experiments in finite automata
inferredcites →https://doi.org/10.1017/cbo9780511816239openalex-snapshot
Switching and Finite Automata Theory
inferredcites →https://doi.org/10.1109/26.111442openalex-snapshot
An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours
inferredcites →https://doi.org/10.1109/infcom.1988.12900openalex-snapshot
An experience in estimating fault coverage of a protocol test
inferredcites →https://doi.org/10.1109/infcom.1988.12901openalex-snapshot
Fault coverage of protocol test methods
inferredcites →https://doi.org/10.1109/infcom.1988.12902openalex-snapshot
A computer-aided design tool for protocol testing
inferredcites →https://doi.org/10.1109/proc.1983.12792openalex-snapshot
Testing OSI protocols at the national bureau of standards
inferredcites →https://doi.org/10.1109/swct.1964.8openalex-snapshot
Fault detecting experiments for sequential circuits
inferredcites →https://doi.org/10.1109/t-c.1970.222975openalex-snapshot
A Method for the Design of Fault Detection Experiments
inferredcites →https://doi.org/10.1109/t-c.1971.223100openalex-snapshot
Checking Experiments ror Sequential Machines
inferredcites →https://doi.org/10.1109/tcom.1984.1096074openalex-snapshot
Synchronization and Specification Issues in Protocol Testing
inferredcites →https://doi.org/10.1109/tse.1978.231496openalex-snapshot
Testing Software Design Modeled by Finite-State Machines
inferredcites →https://doi.org/10.1145/318951.319003openalex-snapshot
A new technique for generating protocol test
inferredcites →https://doi.org/10.1145/319056.319003openalex-snapshot
A new technique for generating protocol test
inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot
Efficient Algorithms for Shortest Paths in Sparse Networks
inferredcites →https://doi.org/10.82308/38129openalex-snapshot
Test design for computer network protocols

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.3230250105openalex-snapshot
Lower bounds for the length of test sequences using UIOs
inferred← citeshttps://doi.org/10.1007/11754008_18openalex-snapshot
Reducing the Lengths of Checking Sequences by Overlapping
inferred← citeshttps://doi.org/10.1007/978-0-387-34867-4_8openalex-snapshot
Design of Reliable Architecture for Testing Timed Behavior of OSI Protocols
inferred← citeshttps://doi.org/10.1007/978-0-387-34988-6_1openalex-snapshot
Testing Through the Ages
inferred← citeshttps://doi.org/10.1007/978-0-387-34988-6_25openalex-snapshot
Synchronizable Checking Sequences Based on UIO Sequences
inferred← citeshttps://doi.org/10.1007/978-0-387-35497-2_27openalex-snapshot
A New Approach to Checking Sequence Generation for Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-030-40914-2_4openalex-snapshot
Minimizing Characterizing Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-06200-6_5openalex-snapshot
Distinguishing Sequences for Partially Specified FSMs
inferred← citeshttps://doi.org/10.1007/978-3-319-25945-1_2openalex-snapshot
Using Multiple Adaptive Distinguishing Sequences for Checking Sequence Generation
inferred← citeshttps://doi.org/10.1007/978-3-540-30583-5_30openalex-snapshot
Timed I/O Test Sequences for Discrete Event Model Verification
inferred← citeshttps://doi.org/10.1007/bf01384135openalex-snapshot
Test case verification by model checking
inferred← citeshttps://doi.org/10.1007/bf01976186openalex-snapshot
A modified transition tour protocol test method
inferred← citeshttps://doi.org/10.1007/s00165-009-0135-6openalex-snapshot
Lower bounds on lengths of checking sequences
inferred← citeshttps://doi.org/10.1007/s10703-014-0205-0openalex-snapshot
Hardness and inapproximability of minimizing adaptive distinguishing sequences
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90168-9openalex-snapshot
Exact solutions for the construction of optimal length test sequences
inferred← citeshttps://doi.org/10.1016/0140-3664(92)90092-sopenalex-snapshot
Formal methods for test sequence generation
inferred← citeshttps://doi.org/10.1016/0140-3664(95)92852-nopenalex-snapshot
Fault detection and diagnosis capabilities of test sequence selection methods based on the FSM model
inferred← citeshttps://doi.org/10.1016/0140-3664(95)94376-mopenalex-snapshot
Analysis and representation of test cases generated from LOTOS
inferred← citeshttps://doi.org/10.1016/0140-3664(96)81589-1openalex-snapshot
Construction of checking sequences based on characterization sets
inferred← citeshttps://doi.org/10.1016/0169-7552(94)00005-eopenalex-snapshot
Data flow oriented test selection for lotos
inferred← citeshttps://doi.org/10.1016/bs.adcom.2017.06.002openalex-snapshot
Testing the Control-Flow, Data-Flow, and Time Aspects of Communication Systems: A Survey
inferred← citeshttps://doi.org/10.1016/j.infsof.2005.04.008openalex-snapshot
DEVSpecL: DEVS specification language for modeling, simulation and analysis of discrete event systems
inferred← citeshttps://doi.org/10.1016/j.infsof.2011.06.004openalex-snapshot
An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models
inferred← citeshttps://doi.org/10.1016/j.infsof.2016.02.001openalex-snapshot
Effective algorithms for constructing minimum cost adaptive distinguishing sequences
inferred← citeshttps://doi.org/10.1016/j.ins.2016.07.059openalex-snapshot
A heuristic transition executability analysis method for generating EFSM-specified protocol test sequences
inferred← citeshttps://doi.org/10.1016/j.jnca.2020.102819openalex-snapshot
ReFSM: Reverse engineering from protocol packet traces to test generation by extended finite state machines
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102645openalex-snapshot
Minimizing Characterizing sets
inferred← citeshttps://doi.org/10.1016/s0140-3664(99)00227-3openalex-snapshot
Test generation based on control and data dependencies within system specifications in SDL
inferred← citeshttps://doi.org/10.1016/s0950-5849(03)00060-0openalex-snapshot
UIO sequence based checking sequences for distributed test architectures
inferred← citeshttps://doi.org/10.1016/s0950-5849(99)00038-5openalex-snapshot
Efficient checking sequences for testing finite state machines
inferred← citeshttps://doi.org/10.1016/s1383-7621(99)00003-xopenalex-snapshot
An extended-UIO-based method for protocol conformance testing
inferred← citeshttps://doi.org/10.1049/sej.1993.0024openalex-snapshot
A test generation algorithm for systems modelled as non-deterministic FSMs
inferred← citeshttps://doi.org/10.1093/comjnl/40.7.441openalex-snapshot
Designing Reliable Test Architectures for Communication Protocols
inferred← citeshttps://doi.org/10.1109/12.559807openalex-snapshot
On minimizing the lengths of checking sequences
inferred← citeshttps://doi.org/10.1109/12.844345openalex-snapshot
A matroid-theoretic solution to an assignment problem in the conformance testing of communication protocols
inferred← citeshttps://doi.org/10.1109/5.533956openalex-snapshot
Principles and methods of testing finite state machines-a survey
inferred← citeshttps://doi.org/10.1109/90.234857openalex-snapshot
Optimal length test sequence generation using distinguishing sequences
inferred← citeshttps://doi.org/10.1109/90.298437openalex-snapshot
Automated repair of complex systems by fault compensation
inferred← citeshttps://doi.org/10.1109/90.374116openalex-snapshot
Synchronizable test sequences based on multiple UIO sequences
inferred← citeshttps://doi.org/10.1109/ats.2003.1250812openalex-snapshot
Conformance test of distributed transaction service
inferred← citeshttps://doi.org/10.1109/cmpsac.1994.342812openalex-snapshot
Test sequence generation methods for protocol conformance testing
inferred← citeshttps://doi.org/10.1109/compsac.2013.89openalex-snapshot
Verification and Implementation of the Protocol Standard in Train Control System
inferred← citeshttps://doi.org/10.1109/dac.1997.597243openalex-snapshot
Toward Formalizing A Validation Methodology Using Simulation Coverage
inferred← citeshttps://doi.org/10.1109/greencom-ithings-cpscom.2013.111openalex-snapshot
A FSM-based Test Sequence Generation Method for RPL Conformance Testing
inferred← citeshttps://doi.org/10.1109/icaccs.2016.7586320openalex-snapshot
Security protocol for distributed networks using formal method specification
inferred← citeshttps://doi.org/10.1109/iccd.1999.808581openalex-snapshot
Verification of scheduling in the presence of loops using uninterpreted symbolic simulation
inferred← citeshttps://doi.org/10.1109/icnp.1993.340917openalex-snapshot
Reverse-engineering of communication protocols
inferred← citeshttps://doi.org/10.1109/icnp.1996.564905openalex-snapshot
Optimization problems from feature testing of communication protocols
inferred← citeshttps://doi.org/10.1109/icst.2009.29openalex-snapshot
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM)
inferred← citeshttps://doi.org/10.1109/icws.2009.97openalex-snapshot
An Abstract GFSM Model for Optimal and Incremental Conformance Testing of Web Services
inferred← citeshttps://doi.org/10.1109/infcom.1993.253241openalex-snapshot
Minimum-cost synchronizable test sequence generation via the duplexU digraph
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205002openalex-snapshot
Convergent transfer subgraph characterization and computation
inferred← citeshttps://doi.org/10.1109/iscc.2008.4625760openalex-snapshot
Formal automated transformation of SDL specifications to Lotos specifications
inferred← citeshttps://doi.org/10.1109/pccc.1992.200524openalex-snapshot
Testability-directed service definitions and their synthesis
inferred← citeshttps://doi.org/10.1109/sefm.2009.12openalex-snapshot
Checking Sequence Construction Using Adaptive and Preset Distinguishing Sequences
inferred← citeshttps://doi.org/10.1109/services-i.2009.38openalex-snapshot
A Combinatorial Approach to Multi-session Testing of Stateful Web Services
inferred← citeshttps://doi.org/10.1109/synasc.2017.00034openalex-snapshot
A Test Suite Generation Approach Based on EFSMs Using a Multi-objective Genetic Algorithm
inferred← citeshttps://doi.org/10.1109/tc.2002.1032630openalex-snapshot
Reduced length checking sequences
inferred← citeshttps://doi.org/10.1109/tc.2002.1032631openalex-snapshot
Computing the shortest network under a fixed topology
inferred← citeshttps://doi.org/10.1109/tc.2002.1032632openalex-snapshot
Computing the shortest network under a fixed topology
inferred← citeshttps://doi.org/10.1109/tie.2014.2316234openalex-snapshot
Design and Optimization of Multiclocked Embedded Systems Using Formal Techniques
inferred← citeshttps://doi.org/10.1109/tr.2015.2443392openalex-snapshot
Enhancing Conformance Testing Using Symbolic Execution for Network Protocols
inferred← citeshttps://doi.org/10.1109/wcre.2011.28openalex-snapshot
Reverse Engineering of Protocols from Network Traces
inferred← citeshttps://doi.org/10.1142/s0218194005002567openalex-snapshot
FORMAL METHOD FOR AUTOMATED TRANSFORMATION OF LOTOS SPECIFICATIONS TO ESTELLE SPECIFICATIONS
inferred← citeshttps://doi.org/10.1145/122419.122425openalex-snapshot
Experience with formal methods in protocol development
inferred← citeshttps://doi.org/10.1145/1363686.1363850openalex-snapshot
Using adaptive distinguishing sequences in checking sequence constructions
inferred← citeshttps://doi.org/10.1145/196092.196088openalex-snapshot
A reduced test suite for protocol conformance testing
inferred← citeshttps://doi.org/10.1145/225058.225161openalex-snapshot
Distinguishing tests for nondeterministic and probabilistic machines
inferred← citeshttps://doi.org/10.1145/266021.266359openalex-snapshot
Toward formalizing a validation methodology using simulation coverage
inferred← citeshttps://doi.org/10.1145/3051121openalex-snapshot
Parallel Algorithms for Generating Distinguishing Sequences for Observable Non-deterministic FSMs
inferred← citeshttps://doi.org/10.14232/actacyb.20.4.2012.1openalex-snapshot
Model-Driven Diagnostics of Underperforming Communicating Systems
inferred← citeshttps://doi.org/10.14279/depositonce-2502openalex-snapshot
Modeling and Model-based Testing of Service Choreographies
inferred← citeshttps://doi.org/10.1504/ijwet.2014.063041openalex-snapshot
Tool support for generating model-based test cases via web
inferred← citeshttps://doi.org/10.17661/jkiiect.2015.8.6.470openalex-snapshot
A Heuristic Technique for Generating the Synchronizable and Optimized Conformance Test Sequences
inferred← citeshttps://doi.org/10.3233/jcm-2006-6s109openalex-snapshot
Advanced method for cryptographic protocol verification
inferred← citeshttps://doi.org/10.5353/th_b3124518openalex-snapshot
Towards a new extension relation for compositional test case generation for CSP concurrent processes
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.