Beyond traditional program slicing
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Reduction and slicing of hierarchical state machines
ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
Slicing Software for Model Construction
Higher-Order and Symbolic Computation
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
ICSE '81 Proceedings of the 5th international conference on Software engineering
Slicing object-z specifications for verification
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Dynamic Slicing Techniques for Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Decompositional Petri Net Reductions
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Actor-based slicing techniques for efficient reduction of Rebeca models
Science of Computer Programming
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
A Model Slicing Method for Workflow Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Reducing the verification cost of evolving product families using static analysis techniques
Science of Computer Programming
| Hi-index | 0.01 |
We introduce the notion of net-slice to describe a subnet of a marked Petri net Σ that approximates σ's temporal behaviour with respect to a set of places P. We consider slices Σ′ whose set of places comprises the places referred to by a CTL* formula φ. If Σ is fair w.r.t. the transitions of a slice, φ |= φ can be verified and falsified by examining the slice, given φ is a CTL* formula built without using the next-time operator. Verification of LTL-X formulas is thus possible under these very weak fairness assumptions, though LTL formulas using next-time can be falsified.