On the public citation graph
Automated analysis of concurrent systems with the constrained expression toolset
0 signed · 128 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00263928openalex-snapshot
Complexity of analyzing the synchronization structure of concurrent programs
inferredcites →https://doi.org/10.1007/bf00709154openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1007/bfb0023729openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1016/0164-1212(88)90027-1openalex-snapshot
A petri net framework for automated static analysis of Ada tasking behavior
inferredcites →https://doi.org/10.1016/0304-3975(90)90096-zopenalex-snapshot
Interleaving set temporal logic
inferredcites →https://doi.org/10.1016/0743-7315(89)90004-xopenalex-snapshot
A practical algorithm for static analysis of parallel programs
inferredcites →https://doi.org/10.1093/comjnl/8.3.250openalex-snapshot
A tree-search algorithm for mixed integer programming problems
inferredcites →https://doi.org/10.1109/32.21759openalex-snapshot
Detection of Ada static deadlocks using Petri net invariants
inferredcites →https://doi.org/10.1109/32.44363openalex-snapshot
Verifying general safety properties of Ada tasking programs
inferredcites →https://doi.org/10.1109/32.57622openalex-snapshot
Starvation and critical race analyzers for Ada
inferredcites →https://doi.org/10.1109/ms.1985.230351openalex-snapshot
Debugging Ada Tasking Programs
inferredcites →https://doi.org/10.1109/tse.1986.6312944openalex-snapshot
Constrained expressions: Adding analysis capabilities to design methods for concurrent software systems
inferredcites →https://doi.org/10.1145/358527.358537openalex-snapshot
An optimal algorithm for mutual exclusion in computer networks
inferredcites →https://doi.org/10.1145/361082.361093openalex-snapshot
A new solution of Dijkstra's concurrent programming problem
inferredcites →https://doi.org/10.1145/382256.382803openalex-snapshot
A graphical notation for describing executions of concurrent Ada programs
inferredcites →https://doi.org/10.1145/3916.3989openalex-snapshot
Describing and analyzing distributed software system designs
inferredcites →https://doi.org/10.1145/44501.44502openalex-snapshot
Constrained expressions: toward broad applicability of analysis methods for distributed software systems
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1145/69586.69587openalex-snapshot
A general-purpose algorithm for analyzing concurrent programs
inferredcites →https://doi.org/10.1145/75308.75323openalex-snapshot
Experiments in automated analysis of concurrent software systems
inferredcites →https://doi.org/10.1145/75308.75330openalex-snapshot
Testing the correctness of tasking supervisors with TSL specifications
inferredcites →https://doi.org/10.1145/75308.75331openalex-snapshot
Integrated concurrency analysis in a software development enviornment
inferredcites →https://doi.org/10.1145/75309.75323openalex-snapshot
Experiments in automated analysis of concurrent software systems
inferredcites →https://doi.org/10.1145/75309.75330openalex-snapshot
Testing the correctness of tasking supervisors with TSL specifications
inferredcites →https://doi.org/10.1145/75309.75331openalex-snapshot
Integrated concurrency analysis in a software development enviornment
inferredcites →https://doi.org/10.1145/800004.807944openalex-snapshot
Nesting in Ada programs is for the birds
inferredcites →https://doi.org/10.1145/948647.948651openalex-snapshot
Nesting in Ada programs is for the birds
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-024x(199906)29:7<577::aid-spe246>3.0.co;2-vopenalex-snapshot
A deadlock detection tool for concurrent Java programs
inferred← citeshttps://doi.org/10.1002/0471028959.sof094openalex-snapshot
Distributed Software Engineering
inferred← citeshttps://doi.org/10.1002/stvr.4370050104openalex-snapshot
Algebraic specifications and sequencing: A defect detection method
inferred← citeshttps://doi.org/10.1007/1-4020-8149-9_4openalex-snapshot
LTL’s Intuitive Representations and Its Automaton Translation
inferred← citeshttps://doi.org/10.1007/3-540-39953-4_13openalex-snapshot
Model Checking Generic Container Implementations
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_10openalex-snapshot
Integer programming in the analysis of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_28openalex-snapshot
Verifying general safety and liveness properties with integer programming
inferred← citeshttps://doi.org/10.1007/3-540-57209-0_20openalex-snapshot
Tractable flow analysis for anomaly detection in distributed programs
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_41openalex-snapshot
Checking system properties via integer programming
inferred← citeshttps://doi.org/10.1007/3-540-63531-9_17openalex-snapshot
Verification of liveness properties using compositional reachability analysis
inferred← citeshttps://doi.org/10.1007/3-540-63531-9_18openalex-snapshot
Model checking graphical user interfaces using abstractions
inferred← citeshttps://doi.org/10.1007/978-0-387-34945-9_31openalex-snapshot
Verification of Liveness Property for Communicating FSM’s with Conditional Transitions depending on State Visiting Numbers
inferred← citeshttps://doi.org/10.1007/978-1-4615-4016-8_8openalex-snapshot
Automated Analysis of Concurrent and Real-Time Software
inferred← citeshttps://doi.org/10.1007/978-3-319-91268-4_8openalex-snapshot
Simplification of CTL Formulae for Efficient Model Checking of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-75664-4_12openalex-snapshot
Safety Property Analysis Techniques for Cooperating Embedded Systems Using LTS
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_1openalex-snapshot
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
inferred← citeshttps://doi.org/10.1007/978-3-642-31588-6_61openalex-snapshot
Behavior Analysis of Software Systems Based on Petri Net Slicing
inferred← citeshttps://doi.org/10.1007/bf00871802openalex-snapshot
A specification-based approach to concurrency analysis
inferred← citeshttps://doi.org/10.1007/bf01384316openalex-snapshot
Using integer programming to verify general safety and liveness properties
inferred← citeshttps://doi.org/10.1007/bfb0023756openalex-snapshot
Model checking of persistent Petri nets
inferred← citeshttps://doi.org/10.1007/bfb0055632openalex-snapshot
Detecting deadlocks in concurrent systems
inferred← citeshttps://doi.org/10.1007/s00165-019-00483-2openalex-snapshot
Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
inferred← citeshttps://doi.org/10.1007/s10660-006-8676-8openalex-snapshot
The formal-CAFE methodology and model checking patterns in the specification of e-commerce systems
inferred← citeshttps://doi.org/10.1007/s11227-011-0724-zopenalex-snapshot
Parallel computation of continuous Petri nets based on hypergraph partitioning
inferred← citeshttps://doi.org/10.1016/j.compind.2003.10.005openalex-snapshot
Discovering models of behavior for concurrent workflows
inferred← citeshttps://doi.org/10.1016/j.jss.2004.04.029openalex-snapshot
Discovering thread interactions in a concurrent system
inferred← citeshttps://doi.org/10.1023/a:1008743212620openalex-snapshot
Verification of Safety Properties Using Integer Programming: Beyond the State Equation
inferred← citeshttps://doi.org/10.1023/a:1011235419951openalex-snapshot
Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset
inferred← citeshttps://doi.org/10.1109/32.317429openalex-snapshot
Automated derivation of time bounds in uniprocessor concurrent systems
inferred← citeshttps://doi.org/10.1109/32.489078openalex-snapshot
Evaluating deadlock detection methods for concurrent software
inferred← citeshttps://doi.org/10.1109/32.538604openalex-snapshot
Timing analysis of Ada tasking programs
inferred← citeshttps://doi.org/10.1109/32.553699openalex-snapshot
A compact Petri net representation and its implications for analysis
inferred← citeshttps://doi.org/10.1109/32.965343openalex-snapshot
Apportioning: a technique for efficient reachability analysis of concurrent object-oriented programs
inferred← citeshttps://doi.org/10.1109/32.99197openalex-snapshot
Temporal logic-based deadlock analysis for Ada
inferred← citeshttps://doi.org/10.1109/52.251208openalex-snapshot
Assessment of safety-critical specifications
inferred← citeshttps://doi.org/10.1109/70.282543openalex-snapshot
Petri net structural analysis for supervisory control
inferred← citeshttps://doi.org/10.1109/71.553301openalex-snapshot
An application of Petri net reduction for Ada tasking deadlock analysis
inferred← citeshttps://doi.org/10.1109/hipc.1998.737980openalex-snapshot
Apportioning: a technique for efficient reachability analysis of concurrent object-oriented programs
inferred← citeshttps://doi.org/10.1109/icpp.1994.84openalex-snapshot
Definitions and Detection of Deadlock, Livelock, and Starvation in Concurrent Programs
inferred← citeshttps://doi.org/10.1109/icse.1996.493410openalex-snapshot
Checking subsystem safety properties in compositional reachability analysis
inferred← citeshttps://doi.org/10.1109/icse.1998.671100openalex-snapshot
Modeling and analysis of a virtual reality system with time Petri nets
inferred← citeshttps://doi.org/10.1109/icse.1999.841031openalex-snapshot
Patterns in property specifications for finite-state verification
inferred← citeshttps://doi.org/10.1109/icsm.2001.972746openalex-snapshot
Measuring behavioral correspondence to a timed concurrent model
inferred← citeshttps://doi.org/10.1109/ieem.2008.4738182openalex-snapshot
Organizing project-based group communication events: A macro perspective
inferred← citeshttps://doi.org/10.1109/iwssd.1993.315504openalex-snapshot
An incremental approach to reachability analysis of distributed programs
inferred← citeshttps://doi.org/10.1109/iwssd.1993.315508openalex-snapshot
Identical tasks and counter variables in an integer programming-based approach to verification
inferred← citeshttps://doi.org/10.1109/pccc.1995.472472openalex-snapshot
Query-driven petri net reduction for analysis in Ada tasking
inferred← citeshttps://doi.org/10.1109/seke.1992.227925openalex-snapshot
Linear programming supporting Ada-tasking static analysis: a Petri net approach
inferred← citeshttps://doi.org/10.1109/spcon.1994.344426openalex-snapshot
Toward metrics for process validation
inferred← citeshttps://doi.org/10.1109/tase.2007.911688openalex-snapshot
Control Reconfiguration of Discrete Event Systems With Dynamic Control Specifications
inferred← citeshttps://doi.org/10.1109/tsmc.2014.2311757openalex-snapshot
Ordinary Differential Equation-Based Deadlock Detection
inferred← citeshttps://doi.org/10.1109/wcre.2002.1173083openalex-snapshot
Discovering thread interactions in a concurrent system
inferred← citeshttps://doi.org/10.1145/1040291.1040292openalex-snapshot
Flow analysis for verifying properties of concurrent software systems
inferred← citeshttps://doi.org/10.1145/120807.120823openalex-snapshot
Experiments with an improved constrained expression toolset
inferred← citeshttps://doi.org/10.1145/125489.122822openalex-snapshot
Interprocedural static analysis of sequencing constraints
inferred← citeshttps://doi.org/10.1145/154183.154197openalex-snapshot
Using state space reduction methods for deadlock analysis in Ada tasking
inferred← citeshttps://doi.org/10.1145/154183.154263openalex-snapshot
A practical technique for bounding the time between events in concurrent real-time systems
inferred← citeshttps://doi.org/10.1145/174146.154197openalex-snapshot
Using state space reduction methods for deadlock analysis in Ada tasking
inferred← citeshttps://doi.org/10.1145/174146.154263openalex-snapshot
A practical technique for bounding the time between events in concurrent real-time systems
inferred← citeshttps://doi.org/10.1145/186258.187206openalex-snapshot
An empirical evaluation of three methods for deadlock analysis of Ada tasking programs
inferred← citeshttps://doi.org/10.1145/193173.195294openalex-snapshot
Towards scalable compositional analysis
inferred← citeshttps://doi.org/10.1145/193173.195295openalex-snapshot
Data flow analysis for verifying properties of concurrent programs
inferred← citeshttps://doi.org/10.1145/195274.195294openalex-snapshot
Towards scalable compositional analysis
inferred← citeshttps://doi.org/10.1145/195274.195295openalex-snapshot
Data flow analysis for verifying properties of concurrent programs
inferred← citeshttps://doi.org/10.1145/201024.201038openalex-snapshot
Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada
inferred← citeshttps://doi.org/10.1145/210134.210180openalex-snapshot
Graph models for reachability analysis of concurrent programs
inferred← citeshttps://doi.org/10.1145/225014.225021openalex-snapshot
Automating process discovery through event-data analysis
inferred← citeshttps://doi.org/10.1145/225014.225028openalex-snapshot
A compact Petri net representation for concurrent programs
inferred← citeshttps://doi.org/10.1145/226295.226299openalex-snapshot
Improving the accuracy of Petri net-based analysis of concurrent programs
inferred← citeshttps://doi.org/10.1145/229000.226299openalex-snapshot
Improving the accuracy of Petri net-based analysis of concurrent programs
inferred← citeshttps://doi.org/10.1145/239098.239114openalex-snapshot
Verification of communication protocols using data flow analysis
inferred← citeshttps://doi.org/10.1145/250707.239114openalex-snapshot
Verification of communication protocols using data flow analysis
inferred← citeshttps://doi.org/10.1145/267895.267913openalex-snapshot
Verification of liveness properties using compositional reachability analysis
inferred← citeshttps://doi.org/10.1145/267895.267914openalex-snapshot
Model checking graphical user interfaces using abstractions
inferred← citeshttps://doi.org/10.1145/267896.267913openalex-snapshot
Verification of liveness properties using compositional reachability analysis
inferred← citeshttps://doi.org/10.1145/267896.267914openalex-snapshot
Model checking graphical user interfaces using abstractions
inferred← citeshttps://doi.org/10.1145/271771.271778openalex-snapshot
Constructing compact models of concurrent Java programs
inferred← citeshttps://doi.org/10.1145/271775.271778openalex-snapshot
Constructing compact models of concurrent Java programs
inferred← citeshttps://doi.org/10.1145/287000.287001openalex-snapshot
Discovering models of software processes from event-based data
inferred← citeshttps://doi.org/10.1145/288195.288214openalex-snapshot
Event-based detection of concurrency
inferred← citeshttps://doi.org/10.1145/288195.288307openalex-snapshot
Filter-based model checking of partial systems
inferred← citeshttps://doi.org/10.1145/289121.289143openalex-snapshot
Using partial evaluation to enable verification of concurrent software
inferred← citeshttps://doi.org/10.1145/291252.288214openalex-snapshot
Event-based detection of concurrency
inferred← citeshttps://doi.org/10.1145/291252.288307openalex-snapshot
Filter-based model checking of partial systems
inferred← citeshttps://doi.org/10.1145/295558.295570openalex-snapshot
Checking safety properties using compositional reachability analysis
inferred← citeshttps://doi.org/10.1145/298595.298598openalex-snapshot
Property specification patterns for finite-state verification
inferred← citeshttps://doi.org/10.1145/302405.302672openalex-snapshot
Patterns in property specifications for finite-state verification
inferred← citeshttps://doi.org/10.1145/332740.332741openalex-snapshot
Using shape analysis to reduce finite-state models of concurrent Java programs
inferred← citeshttps://doi.org/10.1147/sj.411.0140openalex-snapshot
FLAVERS: A finite state verification technique for software systems
inferred← citeshttps://doi.org/10.5121/ijdps.2010.1208openalex-snapshot
Detection Of Control Flow Errors In Parallel Programs At Compile Time
inferred← citeshttps://doi.org/10.54337/aau429765826openalex-snapshot
Time For Stubborn Game Reductions
inferred← citeshttps://doi.org/10.5555/227726.227755openalex-snapshot
Checking subsystem safety properties in compositional reachability analysis
inferred← citeshttps://doi.org/10.5555/302163.302167openalex-snapshot
Modeling and analysis of a virtual reality system with time Petri nets
inferred← citeshttps://doi.org/10.5555/951807.951825openalex-snapshot
Identical tasks and counter variables in an integer programming-based approach to verification
inferred← citeshttps://doi.org/10.5555/951807.951830openalex-snapshot
An incremental approach to reachability analysis of distributed programs
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.