A decidable class of bounded recursions
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of artificial intelligence
Principles of artificial intelligence
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Equivalences of logic programs
Foundations of deductive databases and logic programming
Efficient solution of linear diophantine equations
Journal of Symbolic Computation
Proof-tree transformation theorems and their applications
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Recursive query processing: the power of logic
Theoretical Computer Science
Termination proofs for logic programs based on predicate inequalities
Logic programming
A closed form for Datalog queries with integer order (preliminary version)
ICDT '90 Proceedings of the third international conference on database theory on Database theory
On the representation of infinite temporal data and queries (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A logic programming view of CLP
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
On the regularity of Petri net languages
Information and Computation
Deriving constraints among argument sizes in logic programs (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Handling infinite temporal data
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Temporal deductive databases and infinite objects
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Checking System Properties via Integer Programming
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Transformations and Decompositions of Nets
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I
Delay Analysis in Synchronous Programs
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Diophantine Equations, Presburger Arithmetic and Finite Automata
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Reformulation and Approximation in Model Checking
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Compositional Termination Analysis of Symbolic Forward Analysis
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
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
Verification of Sets of Infinite State Processes Using Program Transformation
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Safe Datalog Queries with Linear Constraints
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Petri nets with simple circuits
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
The constraint database approach to software verification
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Transformations of logic programs on infinite lists
Theory and Practice of Logic Programming
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Transformational verification of parameterized protocols using array formulas
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
Verifying the incorrectness of programs and automata
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Real-Counter automata and their decision problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Using real relaxations during program specialization
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
| Hi-index | 0.00 |
We present a method for characterizing the least fixed-pointsof a certain class of Datalog programs in Presburger arithmetic.The method consists in applying a set of rules that transformgeneral computation paths into “canonical” ones. We use themethod for treating the problem of reachability in the fieldof Petri nets, thus relating some unconnected results and extendingthem in several directions.