Petri nets: an introduction
Haskell overloading is DEXPTIME-complete
Information Processing Letters
Paths vs. trees in set-based program analysis
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
On Liveness in Extended non Self-Controlling Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Approximating Dependency Graphs Using Tree Automata Techniques
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Splitting without backtracking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
New characterization for live and reversible augmented marked graphs
Information Processing Letters
A petri-net-based synthesis methodology for use-case-driven system design
Journal of Systems and Software
Program Analysis through Finite Tree Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Property-preserving composition of distributed system components
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Cryptographic protocol verification using tractable classes of horn clauses
Program analysis and compilation, theory and practice
Finite models for formal security proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Rigid tree automata and applications
Information and Computation
Normalization of linear horn clauses
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Extending H1-clauses with disequalities
Information Processing Letters
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Tree automata with equality constraints modulo equational theories
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Automated verification of equivalence properties of cryptographic protocols
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Extending H1-clauses with path disequalities
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Crossing the syntactic barrier: hom-disequalities for H1-clauses
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.89 |
Nielson, Nielson and Seidl's class H"1 is a decidable class of first-order Horn clause sets, describing strongly regular relations. We give another proof of decidability, and of the regularity of the defined languages, based on fairly standard automated deduction techniques.