| Probabilistic Total Store Ordering | 0 | 0.34 | 2021 |
| Solving Not-Substring Constraint with Flat Abstraction | 0 | 0.34 | 2021 |
| Deciding reachability under persistent x86-TSO | 1 | 0.35 | 2021 |
| On the Separability Problem of String Constraints | 0 | 0.34 | 2020 |
| Parameterized verification under TSO is PSPACE-complete | 0 | 0.34 | 2020 |
| Efficient handling of string-number conversion | 1 | 0.36 | 2020 |
| On the State Reachability Problem for Concurrent Programs Under Power. | 0 | 0.34 | 2020 |
| Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding | 0 | 0.34 | 2019 |
| Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial). | 0 | 0.34 | 2019 |
| Special Issue on NETYS’2016 | 0 | 0.34 | 2019 |
| Optimal stateless model checking for reads-from equivalence under sequential consistency | 0 | 0.34 | 2019 |
| Complexity of Reachability for Data-Aware Dynamic Systems | 0 | 0.34 | 2018 |
| Universal Safety for Timed Petri Nets is PSPACE-complete. | 0 | 0.34 | 2018 |
| Verification of Timed Asynchronous Programs. | 0 | 0.34 | 2018 |
| Trau: SMT solver for string constraints | 2 | 0.37 | 2018 |
| Mending Fences with Self-Invalidation and Self-Downgrade. | 0 | 0.34 | 2018 |
| An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures. | 3 | 0.38 | 2017 |
| Context-Bounded Analysis for POWER. | 4 | 0.39 | 2017 |
| What is Decidable about Perfect Timed Channels? | 0 | 0.34 | 2017 |
| The Benefits of Duality in Verifying Concurrent Programs under TSO. | 2 | 0.38 | 2017 |
| Recency-Bounded Verification of Dynamic Database-Driven Systems. | 1 | 0.35 | 2016 |
| Parameterized verification. | 0 | 0.34 | 2016 |
| Automated Verification of Linearization Policies. | 3 | 0.37 | 2016 |
| Fencing Programs with Self-Invalidation and Self-Downgrade. | 0 | 0.34 | 2016 |
| Preface | 0 | 0.34 | 2016 |
| Counter-Example Guided Program Verification. | 0 | 0.34 | 2016 |
| Norn: An Smt Solver For String Constraints | 13 | 0.60 | 2015 |
| What's Decidable about Availability Languages?. | 3 | 0.40 | 2015 |
| Verification of buffered dynamic register automata | 0 | 0.34 | 2015 |
| Stateless Model Checking for TSO and PSO. | 24 | 1.04 | 2015 |
| Zenoness for Timed Pushdown Automata. | 1 | 0.35 | 2014 |
| Block Me If You Can! - Context-Sensitive Parameterized Verification. | 4 | 0.39 | 2014 |
| Verification of Dynamic Register Automata. | 6 | 0.43 | 2014 |
| MPass: An Efficient Tool for the Analysis of Message-Passing Programs. | 0 | 0.34 | 2014 |
| String Constraints for Verification. | 10 | 0.51 | 2014 |
| Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata. | 2 | 0.38 | 2014 |
| Stochastic Parity Games on Lossy Channel Systems | 0 | 0.34 | 2014 |
| Tools for software verification | 0 | 0.34 | 2013 |
| Priced Timed Petri Nets. | 0 | 0.34 | 2013 |
| Push-Down Automata with Gap-Order Constraints. | 4 | 0.43 | 2013 |
| Analysis of Message Passing Programs Using SMT-Solvers. | 3 | 0.41 | 2013 |
| An integrated specification and verification technique for highly concurrent data structures | 18 | 0.63 | 2013 |
| Verification of Directed Acyclic Ad Hoc Networks. | 6 | 0.44 | 2013 |
| Solving parity games on integer vectors | 15 | 0.75 | 2013 |
| Stochastic Parity Games on Lossy Channel Systems. | 3 | 0.41 | 2013 |
| Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. | 6 | 0.50 | 2013 |
| All for the Price of Few. | 37 | 0.98 | 2013 |
| MEMORAX, a precise and sound tool for automatic fence insertion under TSO | 14 | 0.57 | 2013 |
| Regular model checking | 6 | 0.46 | 2012 |
| Petri Nets With Time And Cost (Tutorial) | 2 | 0.43 | 2012 |
