On the public citation graph
Multiple counters automata, safety analysis and presburger arithmetic
0 signed · 190 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/3-540-53507-1_77openalex-snapshot
A closed form for datalog queries with integer order
inferredcites →https://doi.org/10.1007/3-540-56922-7_28openalex-snapshot
Delay analysis in synchronous programs
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-58179-0_50openalex-snapshot
An automata-theoretic approach to branching-time model checking (Extended abstract)
inferredcites →https://doi.org/10.1007/3-540-62718-9_2openalex-snapshot
Symbolic verification with gap-order constraints
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-4615-5515-5_4openalex-snapshot
A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters
inferredcites →https://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
inferredcites →https://doi.org/10.1007/s002360050074openalex-snapshot
Decidability of model checking for infinite-state concurrent systems
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/s0743-1066(97)10008-5openalex-snapshot
Datalog with integer periodicity constraints
inferredcites →https://doi.org/10.1023/a:1009747629591openalex-snapshot
A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters
inferredcites →https://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118602638.ch8openalex-snapshot
Verification of Infinite‐State Systems
inferred← citeshttps://doi.org/10.1007/10722167_32openalex-snapshot
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems
inferred← citeshttps://doi.org/10.1007/10722167_9openalex-snapshot
Binary Reachability Analysis of Discrete Pushdown Timed Automata
inferred← citeshttps://doi.org/10.1007/11539452_39openalex-snapshot
Verification of Qualitative ℤ Constraints
inferred← citeshttps://doi.org/10.1007/11562436_8openalex-snapshot
Fast Generic Model-Checking for Data-Based Systems
inferred← citeshttps://doi.org/10.1007/11562948_35openalex-snapshot
Flat Acceleration in Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/11562948_36openalex-snapshot
Flat Counter Automata Almost Everywhere!
inferred← citeshttps://doi.org/10.1007/11823230_10openalex-snapshot
Combining Widening and Acceleration in Linear Relation Analysis
inferred← citeshttps://doi.org/10.1007/11901914_36openalex-snapshot
Towards a Model-Checker for Counter Systems
inferred← citeshttps://doi.org/10.1007/11916277_14openalex-snapshot
Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_10openalex-snapshot
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_14openalex-snapshot
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_48openalex-snapshot
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_38openalex-snapshot
Counter Machines: Decidable Properties and Applications to Verification Problems
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_15openalex-snapshot
Reachability Analysis for Some Models of Infinite-State Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_40openalex-snapshot
Well-Abstracted Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_12openalex-snapshot
Reachability and Safety in Queue Systems
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_13openalex-snapshot
Generalizing the Discrete Timed Automaton
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_59openalex-snapshot
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_53openalex-snapshot
A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_54openalex-snapshot
Monadic Second-Order Logics with Cardinalities
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_18openalex-snapshot
Automatic Verification of Multi-queue Discrete Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_12openalex-snapshot
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_14openalex-snapshot
Beyond Regular Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45619-8_9openalex-snapshot
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
inferred← citeshttps://doi.org/10.1007/3-540-45622-8_12openalex-snapshot
An Algebraic Framework for Abstract Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_22openalex-snapshot
On Removing the Pushdown Stack in Reachability Constructions
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_9openalex-snapshot
Regular Model Checking Made Simple and Effcient*
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_29openalex-snapshot
Decidability of Reachability Problems for Classes of Two Counters Automata
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_8openalex-snapshot
Compositional Termination Analysis of Symbolic Forward Analysis
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-48320-9_18openalex-snapshot
Timed Automata and the Theory of Real Numbers
inferred← citeshttps://doi.org/10.1007/978-1-4020-8052-4_8openalex-snapshot
How to Compute the Refinement Relation for Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_17openalex-snapshot
Separation Logic with Linearly Compositional Inductive Predicates and Set Data Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-11245-5_24openalex-snapshot
Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_4openalex-snapshot
A Calculus for Modular Loop Acceleration
inferred← citeshttps://doi.org/10.1007/978-3-030-62536-8_1openalex-snapshot
Mutually Accepting Capacitated Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_3openalex-snapshot
Algebraic Program Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-91384-7_5openalex-snapshot
Regular Model Checking: Evolution and Perspectives
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_4openalex-snapshot
CTL$$^*$$ Model Checking for Data-Aware Dynamic Systems with Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_10openalex-snapshot
Coverability in 2-VASS with One Unary Counter is in NP
inferred← citeshttps://doi.org/10.1007/978-3-031-44245-2_13openalex-snapshot
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_9openalex-snapshot
Accelerating Loops with Arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_24openalex-snapshot
Checking Liveness Properties of Presburger Counter Systems Using Reachability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-11439-2_7openalex-snapshot
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_19openalex-snapshot
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_4openalex-snapshot
Acceleration of Affine Hybrid Transformations
inferred← citeshttps://doi.org/10.1007/978-3-319-24246-0_11openalex-snapshot
A New Acceleration-Based Combination Framework for Array Properties
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_24openalex-snapshot
On the Capacity of Capacitated Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-40946-7_1openalex-snapshot
Decision Problems for Finite Automata over Infinite Algebraic Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_6openalex-snapshot
The Commutativity Problem of the MapReduce Framework: A Transducer-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-45994-3_12openalex-snapshot
Robot Games with States in Dimension One
inferred← citeshttps://doi.org/10.1007/978-3-319-95582-7_12openalex-snapshot
Optimal and Robust Controller Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-97879-6_17openalex-snapshot
Reasoning About Reversal-Bounded Counter Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-99725-4_3openalex-snapshot
Numerical Invariants via Abstract Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_48openalex-snapshot
Membership and Reachability Problems for Row-Monomial Transformations
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_26openalex-snapshot
On Flatness for 2-Dimensional Vector Addition Systems with States
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_3openalex-snapshot
A Survey of Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_17openalex-snapshot
Real-Counter Automata and Their Decision Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_29openalex-snapshot
From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_27openalex-snapshot
On Decidability Within the Arithmetic of Addition and Divisibility
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_8openalex-snapshot
Dense Counter Machines and Verification Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_9openalex-snapshot
On Flat Programs with Lists
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_16openalex-snapshot
Systematic Acceleration in Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_12openalex-snapshot
Accelerated Data-Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_12openalex-snapshot
Proving Termination of Tree Manipulating Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_43openalex-snapshot
Acceleration in Convex Data-Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-77966-7_8openalex-snapshot
Verifying Parametrised Hardware Designs Via Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_33openalex-snapshot
What Else Is Decidable about Integer Arrays?
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_39openalex-snapshot
A Logic of Singly Indexed Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_9openalex-snapshot
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_15openalex-snapshot
Automatic Verification of Integer Array Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_25openalex-snapshot
Reachability in Succinct and Parametric One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_16openalex-snapshot
Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-13374-9_16openalex-snapshot
Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_48openalex-snapshot
Model Checking Succinct and Parametric One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6openalex-snapshot
Computer Aided Verification, 22nd International Conference, CAV 2010, Edinburgh, UK, July 15-19, 2010. Proceedings
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_23openalex-snapshot
Fast Acceleration of Ultimately Periodic Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-21834-7_4openalex-snapshot
Forward Analysis and Model Checking for Trace Bounded WSTS
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_18openalex-snapshot
Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_27openalex-snapshot
Using Bounded Model Checking to Focus Fixpoint Iterations
inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_7openalex-snapshot
Verification of Gap-Order Constraint Abstractions of Counter Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_14openalex-snapshot
Strong Termination for Gap-Order Constraint Abstractions of Counter Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_17openalex-snapshot
Automatic Generation of Invariants for Circular Derivations in SUP(LA)
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_27openalex-snapshot
Branching-Time Model Checking of Parametric One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_37openalex-snapshot
Finite Automata over Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-29963-6_12openalex-snapshot
Automated Analysis of Infinite State Workflows with Access Control Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_16openalex-snapshot
Taming Past LTL and Flat Counter Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_15openalex-snapshot
When the Decreasing Sequence Fails
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_17openalex-snapshot
On the Complexity of Verifying Regular Properties on Flat Counter Systems,
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_37openalex-snapshot
Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-642-40537-2_1openalex-snapshot
Witness Runs for Counter Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_3openalex-snapshot
Definability of Accelerated Relations in a Theory of Arrays and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_9openalex-snapshot
Witness Runs for Counter Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_14openalex-snapshot
Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_2openalex-snapshot
Decision Procedures for Flat Array Properties
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_42openalex-snapshot
PTIME Computation of Transitive Closures of Octagonal Relations
inferred← citeshttps://doi.org/10.1007/s00165-020-00521-4openalex-snapshot
Optimal and robust controller synthesis using energytimed automata with uncertainty
inferred← citeshttps://doi.org/10.1007/s10009-008-0064-3openalex-snapshot
FAST: acceleration from theory to practice
inferred← citeshttps://doi.org/10.1007/s10009-011-0206-xopenalex-snapshot
Domain-specific regular acceleration
inferred← citeshttps://doi.org/10.1007/s10009-022-00670-2openalex-snapshot
A calculus for modular loop acceleration and non-termination proofs
inferred← citeshttps://doi.org/10.1007/s100090100049openalex-snapshot
Constraint-based deductive model checking
inferred← citeshttps://doi.org/10.1007/s10703-017-0310-yopenalex-snapshot
Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
inferred← citeshttps://doi.org/10.1007/s10817-015-9323-7openalex-snapshot
Decision Procedures for Flat Array Properties
inferred← citeshttps://doi.org/10.1007/s10817-020-09567-8openalex-snapshot
Decidable $${\exists }^*{\forall }^*$$ First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.02.022openalex-snapshot
From Discrete Duration Calculus to Symbolic Automata
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.038openalex-snapshot
Reachability in Timed Counter Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.002openalex-snapshot
A Modular Static Analysis Approach to Affine Loop Invariants Detection
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.014openalex-snapshot
Accelerated Invariant Generation for C Programs with Aspic and C2fsm
inferred← citeshttps://doi.org/10.1016/j.ic.2006.09.006openalex-snapshot
An automata-theoretic approach to constraint LTL
inferred← citeshttps://doi.org/10.1016/j.ic.2015.03.007openalex-snapshot
Taming past LTL and flat counter systems
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104451openalex-snapshot
Capacitated automata and systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.01.014openalex-snapshot
On selective unboundedness of VASS
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.08.003openalex-snapshot
On decidability and complexity of low-dimensional robot games
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.051openalex-snapshot
Applying abstract acceleration to (co-)reachability analysis of reactive programs
inferred← citeshttps://doi.org/10.1016/j.scico.2013.09.016openalex-snapshot
Abstract acceleration in linear relation analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.019openalex-snapshot
LTL over integer periodicity constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.07.023openalex-snapshot
Verification of qualitative Z constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.12.002openalex-snapshot
Verification of gap-order constraint abstractions of counter systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.04.029openalex-snapshot
Dense-choice Counter Machines revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.007openalex-snapshot
Equivalence between model-checking flat counter systems and Presburger arithmetic
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00268-7openalex-snapshot
Counter Machines and Verification Problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00269-9openalex-snapshot
Augmenting the discrete timed automaton with other data structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00076-2openalex-snapshot
Verification in loosely synchronous queue-connected discrete timed automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00545-5openalex-snapshot
Eliminating the storage tape in reachability constructions
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00743-0openalex-snapshot
Pushdown timed automata: a binary reachability characterization and safety verification
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)00027-5openalex-snapshot
Well-abstracted transition systems: application to FIFO automata
inferred← citeshttps://doi.org/10.1017/jsl.2015.4openalex-snapshot
PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS
inferred← citeshttps://doi.org/10.1051/ita:2003001openalex-snapshot
About the decision of reachability for register machines
inferred← citeshttps://doi.org/10.1093/logcom/exp037openalex-snapshot
The Effects of Bounding Syntactic Resources on Presburger LTL
inferred← citeshttps://doi.org/10.1109/memcod.2003.1210095openalex-snapshot
How to compute the refinement relation for parameterized systems
inferred← citeshttps://doi.org/10.1109/sefm.2010.37openalex-snapshot
SMT-based Verification of LTL Specification with Integer Constraints and its Application to Runtime Checking of Service Substitutability
inferred← citeshttps://doi.org/10.1109/time.2006.18openalex-snapshot
In time alone: on the computational power of querying the history
inferred← citeshttps://doi.org/10.1109/time.2007.63openalex-snapshot
The Effects of Bounding Syntactic Resources on Presburger LTL
inferred← citeshttps://doi.org/10.1109/time.2010.21openalex-snapshot
Bounded Reachability for Temporal Logic over Constraint Systems
inferred← citeshttps://doi.org/10.1142/s0129054102000984openalex-snapshot
VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
inferred← citeshttps://doi.org/10.1145/1101908.1101915openalex-snapshot
Efficient temporal-logic query checking for presburger systems
inferred← citeshttps://doi.org/10.1145/3519939.3523714openalex-snapshot
Warping cache simulation of polyhedral programs
inferred← citeshttps://doi.org/10.1145/3762178openalex-snapshot
Coverability in VASS Revisited: Improving Rackoff’s Bounds to Obtain Conditional Optimality
inferred← citeshttps://doi.org/10.15479/at:ista:th_730openalex-snapshot
Statistical and logical methods for property checking
inferred← citeshttps://doi.org/10.17638/03018108openalex-snapshot
Reachability games and related matrix and word problems
inferred← citeshttps://doi.org/10.29007/wpg3openalex-snapshot
LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
inferred← citeshttps://doi.org/10.29007/xf2nopenalex-snapshot
Acceleration-based safety decision procedure for programs with arrays
inferred← citeshttps://doi.org/10.3103/s014641161207005xopenalex-snapshot
Approximating bisimulation in one-counter nets
inferred← citeshttps://doi.org/10.3166/jancl.16.311-347openalex-snapshot
Linear-time temporal logics with Presburger constraints: an overview ★
inferred← citeshttps://doi.org/10.3233/fi-2009-0049openalex-snapshot
On the Computational Power of Querying the History
inferred← citeshttps://doi.org/10.4204/eptcs.10.1openalex-snapshot
Dense-choice Counter Machines revisited
inferred← citeshttps://doi.org/10.4204/eptcs.168.1openalex-snapshot
Monotonic Abstraction Techniques: from Parametric to Software Model Checking
inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.37openalex-snapshot
On Flat Lossy Channel Machines
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.313openalex-snapshot
Accelerating tree-automatic relations
inferred← citeshttps://doi.org/10.47749/t/unicamp.2011.787718openalex-snapshot
Uma abordagem modelo-teórica da computabilidade de Turing clássica
inferred← citeshttps://doi.org/10.48550/arxiv.1004.1077openalex-snapshot
Bounded Reachability for Temporal Logic over Constraint Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1106.2637openalex-snapshot
Using Bounded Model Checking to Focus Fixpoint Iterations
inferred← citeshttps://doi.org/10.48550/arxiv.1304.4499openalex-snapshot
Abstraction and Acceleration in SMT-based Model-Checking for Array Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1070openalex-snapshot
Checking Temporal Properties of Presburger Counter Systems using Reachability Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1402.2102openalex-snapshot
PTIME Computation of Transitive Closures of Octagonal Relations
inferred← citeshttps://doi.org/10.5287/ora-gpjjqxr6jopenalex-snapshot
On the complexity of model checking counter automata
inferred← citeshttps://doi.org/10.5555/823453.823826openalex-snapshot
How to compute the refinement relation for parameterized systems
inferred← citeshttps://doi.org/10.70675/1b0bfe3bzfe7bz4748za9a1zc38ebd508e3fopenalex-snapshot
Parity games and reachability in infinite-state systems with parameters
inferred← citeshttps://doi.org/10.70675/3b17a406zc9dbz4a47z853czb9ebaaa90425openalex-snapshot
Verification of timed automata : reachability, liveness and modelling
inferred← citeshttps://doi.org/10.70675/ca78c9eaz034dz4fefzbd5bz0d2137ea8d47openalex-snapshot
Vérification relationnelle pour des programmes avec des données entières
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.