Exact analysis of the cache behavior of nested loops
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Constraints in computational logics
The first-order theory of subtyping constraints
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Representing Arithmetic Constraints with Finite Automata: An Overview
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Techniques for Implicit State Enumeration of EFSMs
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
On the Construction of Automata from Linear Arithmetic Constraints
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Counting the Solutions of Presburger Equations without Enumerating Them
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Automatic verification of recursive procedures with one integer parameter
Theoretical Computer Science - Mathematical foundations of computer science
On iterating linear transformations over recognizable sets of integers
Theoretical Computer Science
Counting the solutions of Presburger equations without enumerating them
Theoretical Computer Science - Implementation and application automata
Abstraction of assembler programs for symbolic worst case execution time analysis
Proceedings of the 41st annual Design Automation Conference
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Information Processing Letters
A class of polynomially solvable range constraints for interval analysis without widenings
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Fast verification of the class of stop-and-wait protocols modelled by coloured Petri nets
Nordic Journal of Computing
Bounded model checking of infinite state systems
Formal Methods in System Design
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic (TOCL)
Computing Convex Hulls by Automata Iteration
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Structural Presburger digit vector automata
Theoretical Computer Science
Formalizing the Logic-Automaton Connection
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
The Non-Interference Protection in BML
Electronic Notes in Theoretical Computer Science (ENTCS)
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Information Processing Letters
Automata-based representations for arithmetic constraints in automated verification
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Verification of data paths using unbounded integers: automata strike back
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
Static guard analysis in timed automata verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
On the use of non-deterministic automata for presburger arithmetic
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Computing affine hulls over Q and Z from sets represented by number decision diagrams
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Presburger arithmetic, rational generating functions, and quasi-polynomials
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |