On the public citation graph
Formal Techniques for Networked and Distributed Systems – FORTE 2004
0 signed · 91 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.
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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/stvr.274openalex-snapshot
Combining formal verification and conformance testing for validating reactive systems
inferred← citeshttps://doi.org/10.1007/11430230_2openalex-snapshot
Passive Testing – A Constrained Invariant Checking Approach
inferred← citeshttps://doi.org/10.1007/11430230_9openalex-snapshot
Testing Communicating Systems: a Model, a Methodology, and a Tool
inferred← citeshttps://doi.org/10.1007/11494744_1openalex-snapshot
Expressiveness and Efficient Analysis of Stochastic Well-Formed Nets
inferred← citeshttps://doi.org/10.1007/11534310_121openalex-snapshot
Generating Minimal Synchronizable Test Sequence That Detects Output-Shifting Faults
inferred← citeshttps://doi.org/10.1007/11537328_14openalex-snapshot
Behavioural Models for Hierarchical Components
inferred← citeshttps://doi.org/10.1007/11561927_13openalex-snapshot
Proving Atomicity: An Assertional Approach
inferred← citeshttps://doi.org/10.1007/11562436_32openalex-snapshot
Hierarchical Decision Diagrams to Exploit Model Structure
inferred← citeshttps://doi.org/10.1007/11562948_30openalex-snapshot
An EFSM-Based Intrusion Detection System for Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/11569596_97openalex-snapshot
Recovering the Lattice of Repetitive Sub-functions
inferred← citeshttps://doi.org/10.1007/11754008_14openalex-snapshot
Detecting Observability Problems in Distributed Testing
inferred← citeshttps://doi.org/10.1007/11754008_16openalex-snapshot
FSM Test Translation Through Context
inferred← citeshttps://doi.org/10.1007/11767589_8openalex-snapshot
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
inferred← citeshttps://doi.org/10.1007/11817963_44openalex-snapshot
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
inferred← citeshttps://doi.org/10.1007/11888116_22openalex-snapshot
Composition of Use Cases Using Synchronization and Model Checking
inferred← citeshttps://doi.org/10.1007/11888116_32openalex-snapshot
Minimizing Coordination Channels in Distributed Testing
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-06410-9_44openalex-snapshot
The Wireless Fire Alarm System: Ensuring Conformance to Industrial Standards through Formal Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-10181-1_21openalex-snapshot
Verifying Linearizability on TSO Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-10181-1_22openalex-snapshot
A Compositional Proof Method for Linearizability Applied to a Wait-Free Multiset
inferred← citeshttps://doi.org/10.1007/978-3-319-13338-6_1openalex-snapshot
Using Coarse-Grained Abstractions to Verify Linearizability on TSO Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-15317-9_22openalex-snapshot
Admit Your Weakness: Verifying Correctness on TSO Architectures
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_13openalex-snapshot
Modelling and Initial Validation of the DYMO Routing Protocol for Mobile Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-68863-1_6openalex-snapshot
Mechanizing a Correctness Proof for a Lock-Free Concurrent Stack
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_37openalex-snapshot
Thread Quantification for Concurrent Shape Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-70952-7_4openalex-snapshot
”To Store or Not To Store” Reloaded: Reclaiming Memory on Demand
inferred← citeshttps://doi.org/10.1007/978-3-540-73035-4_23openalex-snapshot
A Visual Editor to Support the Use of Temporal Logic for ADL Monitoring
inferred← citeshttps://doi.org/10.1007/978-3-540-73066-8_12openalex-snapshot
Testing Input/Output Partial Order Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-73066-8_23openalex-snapshot
An EFSM-Based Passive Fault Detection Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-73066-8_9openalex-snapshot
Nodes Self-similarity to Test Wireless Ad Hoc Routing Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_29openalex-snapshot
dmcG: A Distributed Symbolic Model Checker Based on GreatSPN
inferred← citeshttps://doi.org/10.1007/978-3-540-73196-2_3openalex-snapshot
Recovering Repetitive Sub-functions from Observations
inferred← citeshttps://doi.org/10.1007/978-3-540-73210-5_11openalex-snapshot
Proving Linearizability Via Non-atomic Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-73547-2_15openalex-snapshot
Final Fantasy – Securing On-Line Gaming with Trusted Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-73547-2_37openalex-snapshot
Formal Analysis of Secure Bootstrap in Trusted Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-73597-7_24openalex-snapshot
Auto-Generating Test Sequences for Web Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_9openalex-snapshot
Verifying Lock-Freedom Using Well-Founded Orders
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_16openalex-snapshot
A Modal Deconstruction of Access Control Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-78917-8_5openalex-snapshot
Testing in the Distributed Test Architecture
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_5openalex-snapshot
Automated Evaluation of Secure Route Discovery in MANET Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-85289-6_16openalex-snapshot
A Specification Language for Distributed Components Implemented in GCM/ProActive
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_8openalex-snapshot
A Scalable and Oblivious Atomicity Assertion
inferred← citeshttps://doi.org/10.1007/978-3-540-88194-0_7openalex-snapshot
An Approach to Testing with Embedded Context Using Model Checker
inferred← citeshttps://doi.org/10.1007/978-3-540-89985-3_52openalex-snapshot
Modeling Routing Protocols in Adhoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-92188-2_6openalex-snapshot
Active Objects and Distributed Components: Theory and Implementation
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_27openalex-snapshot
Shape-Value Abstraction for Verifying Linearizability
inferred← citeshttps://doi.org/10.1007/978-3-642-03829-7_5openalex-snapshot
Logic in Access Control (Tutorial Notes)
inferred← citeshttps://doi.org/10.1007/978-3-642-04167-9_10openalex-snapshot
Specification and Verification for Grid Component-Based Applications: From Models to Tools
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_28openalex-snapshot
Nonblocking Algorithms and Backward Simulation
inferred← citeshttps://doi.org/10.1007/978-3-642-04856-2_5openalex-snapshot
On Modelling and Analysing the Dynamic MANET On-Demand (DYMO) Routing Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-04856-2_6openalex-snapshot
Modelling Mobile IP with Mobile Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_21openalex-snapshot
Model Checking Linearizability via Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-12566-9_9openalex-snapshot
Refinement of Components in Connection-Safe Assemblies with Synchronous and Asynchronous Communication
inferred← citeshttps://doi.org/10.1007/978-3-642-13321-3_21openalex-snapshot
Temporal Logic Verification of Lock-Freedom
inferred← citeshttps://doi.org/10.1007/978-3-642-13675-7_11openalex-snapshot
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_40openalex-snapshot
Automatically Proving Linearizability
inferred← citeshttps://doi.org/10.1007/978-3-642-16690-7_4openalex-snapshot
On Modelling User Observations in the UTP
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_12openalex-snapshot
Compiling Information-Flow Security to Minimal Trusted Computing Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-21834-7_20openalex-snapshot
Crocodile: A Symbolic/Symbolic Tool for the Analysis of Symmetric Nets with Bag
inferred← citeshttps://doi.org/10.1007/978-3-642-23283-1_16openalex-snapshot
Formal Verification of a Lock-Free Stack with Hazard Pointers
inferred← citeshttps://doi.org/10.1007/978-3-642-24580-0_7openalex-snapshot
Using Testing Techniques for Vulnerability Detection in C Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-25283-9_5openalex-snapshot
Modeling TCG-Based Secure Systems with Colored Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-25789-6_64openalex-snapshot
Twice Rewritings to Reduce Test Case Generation with Model Checker
inferred← citeshttps://doi.org/10.1007/978-3-642-27257-8_3openalex-snapshot
A Formal Security Model of a Smart Card Web Server
inferred← citeshttps://doi.org/10.1007/978-3-642-29860-8_27openalex-snapshot
MONPOLY: Monitoring Usage-Control Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-30947-2_57openalex-snapshot
Modelling Trusted Web Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_21openalex-snapshot
How to Prove Algorithms Linearisable
inferred← citeshttps://doi.org/10.1007/978-3-642-34059-8_17openalex-snapshot
Extreme Symmetries in Complex Distributed Systems: The Bag-Oriented Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-35179-2_8openalex-snapshot
Report on the Model Checking Contest at Petri Nets 2011
inferred← citeshttps://doi.org/10.1007/978-3-642-35632-2_14openalex-snapshot
BabelTrace: A Collection of Transducers for Trace Validation
inferred← citeshttps://doi.org/10.1007/978-3-642-40196-1_32openalex-snapshot
Topology-Based Mobility Models for Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-41010-9_8openalex-snapshot
Formal Analysis of the ACE Specification for Cache Coherent Systems-on-Chip
inferred← citeshttps://doi.org/10.1007/978-3-642-54833-8_17openalex-snapshot
Checking Linearizability of Encapsulated Extended Operations
inferred← citeshttps://doi.org/10.1007/s10515-009-0061-0openalex-snapshot
Generating a checking sequence with a minimum number of reset transitions
inferred← citeshttps://doi.org/10.1007/s11277-013-1107-yopenalex-snapshot
A Framework for Testing of Wireless Underwater Robots
inferred← citeshttps://doi.org/10.1016/j.comnet.2019.106860openalex-snapshot
A hybrid of firefly and improved particle swarm optimization algorithms for load balancing in cloud environments: Performance evaluation
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.08.014openalex-snapshot
Simulations Up-to and Canonical Preorders
inferred← citeshttps://doi.org/10.1016/j.infsof.2012.03.004openalex-snapshot
An advanced approach for modeling and detecting software vulnerabilities
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.infsof.2020.106297openalex-snapshot
State identification sequences from the splitting tree
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.12.003openalex-snapshot
An efficient data exchange mechanism for chained network functions
inferred← citeshttps://doi.org/10.1016/j.jss.2022.111391openalex-snapshot
Using mutual information to test from Finite State Machines: Test suite generation
inferred← citeshttps://doi.org/10.1016/j.scico.2023.103005openalex-snapshot
Exhaustive property oriented model-based testing with symbolic finite state machines
inferred← citeshttps://doi.org/10.1016/j.simpat.2011.05.008openalex-snapshot
Automating the security analysis process of secure ad hoc routing protocols
inferred← citeshttps://doi.org/10.1145/2398857.2384683openalex-snapshot
Detecting problematic message sequences and frequencies in distributed systems
inferred← citeshttps://doi.org/10.1145/3627050.3627059openalex-snapshot
can-logic: Automotive Intrusion Detection via Temporal Logic
inferred← citeshttps://doi.org/10.1145/3728960openalex-snapshot
Tratto: A Neuro-Symbolic Approach to Deriving Axiomatic Test Oracles
inferred← citeshttps://doi.org/10.1186/s12918-016-0285-0openalex-snapshot
Qualitative dynamics semantics for SBGN process description
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.