Limits for automatic verification of finite-state concurrent systems
Information Processing Letters
Introduction to algorithms
Reasoning about systems with many processes
Journal of the ACM (JACM)
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A structural induction theorem for processes
Information and Computation
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
Exploiting symmetry in temporal logic model checking
Formal Methods in System Design - Special issue on symmetry in automatic verification
Formal Methods in System Design - Special issue on symmetry in automatic verification
Synthesis of concurrent systems with many similar processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying Systems with Replicated Components in Mur&b.phiv;
Formal Methods in System Design
Automatic verification of parameterized networks of processes
Theoretical Computer Science
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Database Management Systems
A New Structural Induction Theorem for Rings of Temporal Petri Nets
IEEE Transactions on Software Engineering
Verifying Properties of Large Sets of Processes with Network Invariants
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Reducing Model Checking of the Many to the Few
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
An efficient infrastructure for native transactional XML processing
Data & Knowledge Engineering
Implementing and Optimizing Fine-Granular Lock Management for XML Document Trees
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
The Real Performance Drivers behind XML Lock Protocols
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Algorithmic Verification with Multiple and Nested Parameters
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Essential Performance Drivers in Native XML DBMSs
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
taDOM* protocols are designed to provide lock-based approach to handle multiple access to XML databases. The notion of ta-DOM+ protocol is formalized and generalized and a formal model of taDOM+ lock manager that is parameterized in the number of transactions and in the size of database is represented. An important class of safety properties of taDOM+ lock managers were proven to be checked by examining just a small number of finite-state instances of the parameterized model. Our results were applied to prove a generalized mutual exclusion property, known as repeatable-read, of taDOM2+ and taDOM3+ lock managers by model-checking.