150 results on '"Pierre Wolper"'
Search Results
2. A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems.
3. A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems.
4. An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models.
5. Computing Convex Hulls by Automata Iteration.
6. Omega-Regular Model Checking.
7. Iterating Transducers in the Large (Extended Abstract).
8. Representing Arithmetic Constraints with Finite Automata: An Overview.
9. On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables.
10. Constructing Automata from Temporal Logic Formulas: A Tutorial.
11. On the Construction of Automata from Linear Arithmetic Constraints.
12. Linear Repeating Points.
13. On (Omega-)regular model checking.
14. Computing Convex Hulls by Automata Iteration.
15. On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract).
16. Verifying Systems with Infinite but Regular State Spaces.
17. Relative Liveness and Behavior Abstraction (Extended Abstract).
18. The Power of QDDs (Extended Abstract).
19. Partial-Order Methods for Model Checking: From Linear Time to Branching Time.
20. An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages.
21. Constraint-Generating Dependencies.
22. Simple on-the-fly automatic verification of linear temporal logic.
23. An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
24. On the Use of Automata-based Techniques in Symbolic Model Checking: Invited Address.
25. An effective decision procedure for linear arithmetic over the integers and reals.
26. Symbolic Verification with Periodic Sets.
27. An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract).
28. Constraint-Generating Dependencies.
29. Handling Liveness Properties in (omega-)Regular Model Checking.
30. Reliable Hashing without Collosion Detection.
31. Partial-Order Methods for Temporal Verification.
32. On the Representation of Infinite Temporal Data and Queries.
33. Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties.
34. A Partial Approach to Model Checking
35. Module Checking.
36. Handling Infinite Temporal Data.
37. Memory Efficient Algorithms for the Verification of Temporal Properties.
38. An automata-theoretic approach to branching-time model checking.
39. An efficient automata approach to some problems on context-free grammars.
40. Constraint-Generating Dependencies.
41. Preface -- Workshop Trustworthy Software 2006.
42. An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages.
43. A direct symbolic approach to model checking pushdown systems.
44. Handling Infinite Temporal Data.
45. Reasoning About Infinite Computations
46. A Partial Approach to Model Checking
47. Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties.
48. Memory-Efficient Algorithms for the Verification of Temporal Properties.
49. A Framework to Handle Linear Temporal Properties in (\omega-)Regular Model Checking
50. On (Omega-)Regular Model Checking
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.