On the public citation graph

A comparison of Presburger engines for EFSM reachability

https://doi.org/10.1007/bfb0028752
0 signed · 67 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_30openalex-snapshot
Verification of synchronous sequential machines based on symbolic execution
inferredcites →https://doi.org/10.1007/3-540-58179-0_43openalex-snapshot
Symbolic verification with periodic sets
inferredcites →https://doi.org/10.1007/3-540-60360-3_30openalex-snapshot
An automata-theoretic approach to Presburger arithmetic constraints
inferredcites →https://doi.org/10.1007/3-540-60630-0_5openalex-snapshot
Mona: Monadic second-order logic in practice
inferredcites →https://doi.org/10.1007/3-540-61064-2_27openalex-snapshot
Diophantine equations, Presburger arithmetic and finite automata
inferredcites →https://doi.org/10.1007/3-540-61474-5_95openalex-snapshot
VIS: A system for verification and synthesis
inferredcites →https://doi.org/10.1007/3-540-61648-9_56openalex-snapshot
Mona: Decidable arithmetic in practice
inferredcites →https://doi.org/10.1007/3-540-63166-6_39openalex-snapshot
Symbolic model checking of infinite state systems using presburger arithmetic
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-1-4684-9999-5_1openalex-snapshot
Linear Algebra
inferredcites →https://doi.org/10.1007/978-3-642-78077-6_6openalex-snapshot
The Omega Library
inferredcites →https://doi.org/10.1016/0022-0000(78)90021-1openalex-snapshot
A 222pn upper bound on the complexity of Presburger Arithmetic
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1109/43.277617openalex-snapshot
Comparing two-level and ordered binary decision diagram representations of logic functions
inferredcites →https://doi.org/10.1109/iccd.1991.139892openalex-snapshot
Design verification and reachability analysis using algebraic manipulation
inferredcites →https://doi.org/10.1145/135226.135233openalex-snapshot
A practical algorithm for exact array dependence analysis
inferredcites →https://doi.org/10.1145/157485.164585openalex-snapshot
Automatic functional test generation using the extended finite state machine model
inferredcites →https://doi.org/10.1145/266021.266071openalex-snapshot
Symbolic timing verification of timing diagrams using Presburger formulas
inferredcites →https://doi.org/10.1145/271771.271799openalex-snapshot
Verifying systems with integer constraints and Boolean predicates

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36126-x_11openalex-snapshot
Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods
inferred← citeshttps://doi.org/10.1007/3-540-36390-4_4openalex-snapshot
Counting the Solutions of Presburger Equations without Enumerating Them
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_15openalex-snapshot
MONA Implementation Secrets
inferred← citeshttps://doi.org/10.1007/3-540-44977-9_30openalex-snapshot
Automata-Based Representations for Arithmetic Constraints in Automated Verification
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_2openalex-snapshot
Constraint Solving on Terms
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_1openalex-snapshot
Little Engines of Proof
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_50openalex-snapshot
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_1openalex-snapshot
On the Construction of Automata from Linear Arithmetic Constraints
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_30openalex-snapshot
BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_14openalex-snapshot
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_35openalex-snapshot
A Theory of Restrictions for Logics and Automata
inferred← citeshttps://doi.org/10.1007/3-540-49059-0_16openalex-snapshot
Model Checking in CLP
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_30openalex-snapshot
Techniques for Implicit State Enumeration of EFSMs
inferred← citeshttps://doi.org/10.1007/978-1-4615-0817-5_15openalex-snapshot
The Future of Logic Synthesis and Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-34175-6_24openalex-snapshot
Succinct Determinisation of Counting Automata via Sphere Construction
inferred← citeshttps://doi.org/10.1007/978-3-031-40247-0_6openalex-snapshot
Universal First-Order Quantification over Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31848-4_7openalex-snapshot
Testing Deadlock-Freeness in Real-Time Systems: A Formal Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_2openalex-snapshot
Model Checking as Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-70889-6_5openalex-snapshot
Verification of Data Paths Using Unbounded Integers: Automata Strike Back
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_17openalex-snapshot
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
inferred← citeshttps://doi.org/10.1007/978-3-662-04031-7_13openalex-snapshot
Linear Repeating Points
inferred← citeshttps://doi.org/10.1007/s100090100049openalex-snapshot
Constraint-based deductive model checking
inferred← citeshttps://doi.org/10.1007/s10703-006-0019-9openalex-snapshot
Bounded model checking of infinite state systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.002openalex-snapshot
Counting the solutions of Presburger equations without enumerating them
inferred← citeshttps://doi.org/10.1109/aspdac.2002.995022openalex-snapshot
RTL-datapath verification using integer linear programming
inferred← citeshttps://doi.org/10.1109/aspdac.2003.1195129openalex-snapshot
Don't cares in logic minimization of extended finite state machines
inferred← citeshttps://doi.org/10.1109/icse.2007.75openalex-snapshot
Sequential Circuits for Relational Analysis
inferred← citeshttps://doi.org/10.1109/lics.2004.1319605openalex-snapshot
On the automata size for Presburger arithmetic
inferred← citeshttps://doi.org/10.1109/lics.2004.1319606openalex-snapshot
From automata to formulas: convex integer polyhedra
inferred← citeshttps://doi.org/10.1109/sefm.2004.1347504openalex-snapshot
Global vs. local model checking: a comparison of verification techniques for infinite state systems
inferred← citeshttps://doi.org/10.1109/sefm.2004.23openalex-snapshot
Global vs. local model checking: a comparison of verification techniques for infinite state systems
inferred← citeshttps://doi.org/10.1109/tcad.2003.819893openalex-snapshot
Common-Case Computation: A High-Level Energy and Performance Optimization Technique
inferred← citeshttps://doi.org/10.1142/s0129054125410011openalex-snapshot
Universal First-Order Quantification over Automata
inferred← citeshttps://doi.org/10.1145/1071596.1071601openalex-snapshot
An effective decision procedure for linear arithmetic over the integers and reals
inferred← citeshttps://doi.org/10.1145/1119772.1119951openalex-snapshot
Don't cares in logic minimization of extended finite state machines
inferred← citeshttps://doi.org/10.1145/1321631.1321650openalex-snapshot
Sequential circuits for program analysis
inferred← citeshttps://doi.org/10.1145/1342991.1342995openalex-snapshot
Bounds on the automata size for Presburger arithmetic
inferred← citeshttps://doi.org/10.1145/1839764.1839767openalex-snapshot
Discrete causal model view of biological networks
inferred← citeshttps://doi.org/10.1145/325478.325480openalex-snapshot
Model-checking concurrent systems with unbounded integer variables
inferred← citeshttps://doi.org/10.1145/3428286openalex-snapshot
Regex matching with counting-set automata
inferred← citeshttps://doi.org/10.1145/378795.378851openalex-snapshot
The pointer assertion logic engine
inferred← citeshttps://doi.org/10.48550/arxiv.1910.01996openalex-snapshot
Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0303019openalex-snapshot
An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables
inferred← citeshttps://doi.org/10.5555/1756384.1756417openalex-snapshot
Automata-based representations for arithmetic constraints in automated verification
inferred← citeshttps://doi.org/10.5555/832284.835389openalex-snapshot
RTL-Datapath Verification using Integer Linear Programming
inferred← citeshttps://doi.org/10.70675/a28d98bczab30z4882z83c1z71f503117cfbopenalex-snapshot
Etude de l'influence du PAI-1 matriciel sur la régulation de la transition Mésenchymo-Amiboïde des cellules cancéreuses
inferred← citeshttps://doi.org/10.7146/brics.v7i39.20205openalex-snapshot
The Pointer Assertion Logic Engine
inferred← citeshttps://doi.org/10.7146/brics.v7i40.20206openalex-snapshot
MONA Implementation Secrets
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.