Counter machines and verification Problems
Theoretical Computer Science
Augmenting the discrete timed automaton with other data structures
Theoretical Computer Science
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
An Algebraic Framework for Abstract Model Checking
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
On Removing the Pushdown Stack in Reachability Constructions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Decidability of Reachability Problems for Classes of Two Counters Automata
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Compositional Termination Analysis of Symbolic Forward Analysis
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Timed Automata and the Theory of Real Numbers
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Well-Abstracted Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Reachability Analysis for Some Models of Infinite-State Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Regular Model Checking Made Simple and Efficient
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Reachability and Safety in Queue Systems
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Generalizing the Discrete Timed Automaton
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Verification in loosely synchronous queue-connected discrete timed automata
Theoretical Computer Science
Eliminating the storage tape in reachability constructions
Theoretical Computer Science
Pushdown timed automata: a binary reachability characterization and safety verification
Theoretical Computer Science
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
Efficient temporal-logic query checking for presburger systems
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
How to compute the refinement relation for parameterized systems
Formal methods and models for system design
LTL Over integer periodicity constraints
Theoretical Computer Science
An automata-theoretic approach to constraint LTL
Information and Computation
Verification of qualitative Z constraints
Theoretical Computer Science
A Logic of Singly Indexed Arrays
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Flat Parametric Counter Automata
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Reachability in Timed Counter Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Automatic Verification of Integer Array Programs
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Reachability in Succinct and Parametric One-Counter Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
From Discrete Duration Calculus to Symbolic Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic verification of multi-queue discrete timed automata
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Monadic second-order logics with cardinalities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Systematic acceleration in regular model checking
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Proving termination of tree manipulating programs
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Acceleration in convex data-flow analysis
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Verifying parametrised hardware designs via counter automata
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
What else is decidable about integer arrays?
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Accelerated Invariant Generation for C Programs with Aspic and C2fsm
Electronic Notes in Theoretical Computer Science (ENTCS)
A Modular Static Analysis Approach to Affine Loop Invariants Detection
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking succinct and parametric one-counter automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Forward analysis and model checking for trace bounded WSTS
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Transitive closures of affine integer tuple relations and their overapproximations
SAS'11 Proceedings of the 18th international conference on Static analysis
Using bounded model checking to focus fixpoint iterations
SAS'11 Proceedings of the 18th international conference on Static analysis
Combining widening and acceleration in linear relation analysis
SAS'06 Proceedings of the 13th international conference on Static Analysis
Branching-time temporal logic extended with qualitative presburger constraints
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Flat parametric counter automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Flat acceleration in symbolic model checking
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
The power of hybrid acceleration
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Fast acceleration of ultimately periodic relations
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
On decidability within the arithmetic of addition and divisibility
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Synchronization-Free automatic parallelization: beyond affine iteration-space slicing
LCPC'09 Proceedings of the 22nd international conference on Languages and Compilers for Parallel Computing
Real-Counter automata and their decision problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Fast generic model-checking for data-based systems
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Automatic generation of invariants for circular derivations in SUP(LA)
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Strong termination for gap-order constraint abstractions of counter systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Branching-Time model checking of parametric one-counter automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Applying abstract acceleration to (co-)reachability analysis of reactive programs
Journal of Symbolic Computation
Finite automata over structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Taming past LTL and flat counter systems
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Flat Parametric Counter Automata
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Accelerated data-flow analysis
SAS'07 Proceedings of the 14th international conference on Static Analysis
When the decreasing sequence fails
SAS'12 Proceedings of the 19th international conference on Static Analysis
On selective unboundedness of VASS
Journal of Computer and System Sciences
On the complexity of verifying regular properties on flat counter systems,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Presburger arithmetic, rational generating functions, and quasi-polynomials
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Verification of gap-order constraint abstractions of counter systems
Theoretical Computer Science
Hi-index | 0.01 |