On the public citation graph

Using integer programming to verify general safety and liveness properties

0 signed · 82 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.1007/3-540-52148-8_10openalex-snapshot

Verification by abstraction and bisimulation

inferredcites →https://doi.org/10.1007/3-540-55179-4openalex-snapshot

Computer Aided Verification

inferredcites →https://doi.org/10.1007/3-540-55179-4_10openalex-snapshot

Integer programming in the analysis of concurrent systems

inferredcites →https://doi.org/10.1007/3-540-55179-4_32openalex-snapshot

Using partial orders for the efficient verification of deadlock freedom and safety properties

inferredcites →https://doi.org/10.1007/3-540-56689-9_54openalex-snapshot

Compositional state space generation

inferredcites →https://doi.org/10.1007/bf00709154openalex-snapshot

A stubborn attack on state explosion

inferredcites →https://doi.org/10.1007/bf01383879openalex-snapshot

Using partial orders for the efficient verification of deadlock freedom and safety properties

inferredcites →https://doi.org/10.1007/bfb0023728openalex-snapshot

Using partial-order semantics to avoid the state explosion problem in asynchronous systems

inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot

Communication and concurrency

inferredcites →https://doi.org/10.1016/0169-7552(94)00016-mopenalex-snapshot

On communicating sequential processes

inferredcites →https://doi.org/10.1016/0304-3975(85)90088-xopenalex-snapshot

Algebra of communicating processes with abstraction

inferredcites →https://doi.org/10.1016/0377-2217(88)90012-4openalex-snapshot

The equal flow problem

inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot

Symbolic model checking: 1020 States and beyond

inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot

Automata on Infinite Objects

inferredcites →https://doi.org/10.1090/dimacs/003/04openalex-snapshot

A stubborn attack on state explosion

inferredcites →https://doi.org/10.1109/32.106975openalex-snapshot

Automated analysis of concurrent systems with the constrained expression toolset

inferredcites →https://doi.org/10.1109/lics.1989.39190openalex-snapshot

Compositional model checking

inferredcites →https://doi.org/10.1109/lics.1990.113767openalex-snapshot

Symbolic model checking: 10/sup 20/ states and beyond

inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot

Graph-Based Algorithms for Boolean Function Manipulation

inferredcites →https://doi.org/10.1145/120807.120812openalex-snapshot

Compositional reachability analysis using process algebra

inferredcites →https://doi.org/10.1145/143165.143235openalex-snapshot

Model checking and abstraction

inferredcites →https://doi.org/10.1145/151646.151648openalex-snapshot

The concurrency workbench

inferredcites →https://doi.org/10.1145/4221.4223openalex-snapshot

How to assign votes in a distributed system

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11783565_7openalex-snapshot

Architectural Building Blocks for Plug-and-Play System Design

inferred← citeshttps://doi.org/10.1007/11817949_6openalex-snapshot

A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems

inferred← citeshttps://doi.org/10.1007/3-540-44988-4_14openalex-snapshot

Liveness Verification of Discrete Event Systems Modeled by n-Safe Ordinary Petri Nets

inferred← citeshttps://doi.org/10.1007/3-540-48118-4_11openalex-snapshot

Software verification based on linear programming

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_8openalex-snapshot

Applying static analysis to software architectures

inferred← citeshttps://doi.org/10.1007/978-0-387-73947-2_21openalex-snapshot

Engineering Medical Processes to Improve Their Safety

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-322-95382-7_1openalex-snapshot

Einleitung

inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_26openalex-snapshot

A Scalable Incomplete Test for the Boundedness of UML RT Models

inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_20openalex-snapshot

Verification of MPI-Based Software for Scientific Computation

inferred← citeshttps://doi.org/10.1007/978-3-540-69073-3_14openalex-snapshot

Rigorously Defining and Analyzing Medical Processes: An Experience Report

inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_14openalex-snapshot

Dependency Analysis for Control Flow Cycles in Reactive Communicating Processes

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-19823-6_21openalex-snapshot

Analyzing Medical Processes

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/s100090050038openalex-snapshot

Benchmarking finite-state verifiers

inferred← citeshttps://doi.org/10.1007/s10472-007-9085-yopenalex-snapshot

On a decision procedure for quantified linear programs

inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.005openalex-snapshot

An Improvement of Software Architecture Verification

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.1049/ip-cdt:20041046openalex-snapshot

Word-level symbolic simulation in processor verification

inferred← citeshttps://doi.org/10.1109/32.489078openalex-snapshot

Evaluating deadlock detection methods for concurrent software

inferred← citeshttps://doi.org/10.1109/32.988494openalex-snapshot

Improving the precision of INCA by eliminating solutions with spurious cycles

inferred← citeshttps://doi.org/10.1109/aiccsa.2003.1227480openalex-snapshot

Evaluating software architectures: development, stability, and evolution

inferred← citeshttps://doi.org/10.1109/aspdac.2006.1594637openalex-snapshot

Word level functional coverage computation

inferred← citeshttps://doi.org/10.1109/csd.2004.1309113openalex-snapshot

Property checking based on hierarchical integer equations

inferred← citeshttps://doi.org/10.1109/icse.1999.841031openalex-snapshot

Patterns in property specifications for finite-state verification

inferred← citeshttps://doi.org/10.1109/icse.2002.1007952openalex-snapshot

PROPEL: an approach supporting property elucidation

inferred← citeshttps://doi.org/10.1109/tac.2002.800641openalex-snapshot

Liveness-enforcing supervision of bounded ordinary Petri nets using partial order methods

inferred← citeshttps://doi.org/10.1109/tse.2011.1openalex-snapshot

Integer Linear Programming-Based Property Checking for Asynchronous Reactive Systems

inferred← citeshttps://doi.org/10.1109/tsmc.2014.2311757openalex-snapshot

Ordinary Differential Equation-Based Deadlock Detection

inferred← citeshttps://doi.org/10.1145/1040291.1040292openalex-snapshot

Flow analysis for verifying properties of concurrent software systems

inferred← citeshttps://doi.org/10.1145/1062455.1062609openalex-snapshot

Second international workshop on software engineering for high performance computing system applications

inferred← citeshttps://doi.org/10.1145/1118299.1118304openalex-snapshot

Word level functional coverage computation

inferred← citeshttps://doi.org/10.1145/1145319.1145340openalex-snapshot

Finite-state verification for high performance computing

inferred← citeshttps://doi.org/10.1145/1146238.1146250openalex-snapshot

Breaking up is hard to do

inferred← citeshttps://doi.org/10.1145/1181775.1181801openalex-snapshot

User guidance for creating precise and accessible property specifications

inferred← citeshttps://doi.org/10.1145/1348250.1348253openalex-snapshot

Breaking up is hard to do

inferred← citeshttps://doi.org/10.1145/1368088.1368175openalex-snapshot

Analyzing medical processes

inferred← citeshttps://doi.org/10.1145/193173.195294openalex-snapshot

Towards scalable compositional analysis

inferred← citeshttps://doi.org/10.1145/195274.195294openalex-snapshot

Towards scalable compositional analysis

inferred← citeshttps://doi.org/10.1145/2648511.2648533openalex-snapshot

Generation, composition, and verification of families of human-intensive systems

inferred← citeshttps://doi.org/10.1145/267895.267904openalex-snapshot

Applying static analysis to software architectures

inferred← citeshttps://doi.org/10.1145/267896.267904openalex-snapshot

Applying static analysis to software architectures

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.302461openalex-snapshot

Analysis of a scheduler for a CAD framework

inferred← citeshttps://doi.org/10.1145/302405.302663openalex-snapshot

Data flow analysis for checking properties of concurrent Java programs

inferred← citeshttps://doi.org/10.1145/302405.302672openalex-snapshot

Patterns in property specifications for finite-state verification

inferred← citeshttps://doi.org/10.1145/347324.348876openalex-snapshot

Verifying properties of process definitions

inferred← citeshttps://doi.org/10.1145/347324.349130openalex-snapshot

Improving the precision of INCA by preventing spurious cycles

inferred← citeshttps://doi.org/10.1145/347636.348876openalex-snapshot

Verifying properties of process definitions

inferred← citeshttps://doi.org/10.1145/347636.349130openalex-snapshot

Improving the precision of INCA by preventing spurious cycles

inferred← citeshttps://doi.org/10.1145/581339.581345openalex-snapshot

PROPEL

inferred← citeshttps://doi.org/10.1147/sj.411.0140openalex-snapshot

FLAVERS: A finite state verification technique for software systems

inferred← citeshttps://doi.org/10.1504/ijcat.2013.052795openalex-snapshot

Model checking-based safety verification for railway signal safety protocol-I

inferred← citeshttps://doi.org/10.54337/aau429765826openalex-snapshot

Time For Stubborn Game Reductions

inferred← citeshttps://doi.org/10.5555/1367832.1367846openalex-snapshot

Specifying and verifying requirements for election processes

inferred← citeshttps://doi.org/10.70675/3db1f148za160z4470za8afz62f0852ce55aopenalex-snapshot

An Integrative Framework for Model-Driven Systems Engineering : Towards the Co-Evolution of Simulation, Formal Analysis and Enactment Methodologies for Discrete Event Systems

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.