The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mooly Sagiv: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
    A Logic of Reachable Patterns in Linked Data-Structures. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:94-110 [Conf]
  2. Greta Yorsh, Thomas Ball, Mooly Sagiv
    Testing, abstraction, theorem proving: better together! [Citation Graph (0, 0)][DBLP]
    ISSTA, 2006, pp:145-156 [Conf]
  3. Ohad Shacham, Mooly Sagiv, Assaf Schuster
    Scaling model checking of dataraces using dynamic information. [Citation Graph (0, 0)][DBLP]
    PPOPP, 2005, pp:107-118 [Conf]
  4. Alexey Loginov, Thomas W. Reps, Mooly Sagiv
    Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm. [Citation Graph (0, 0)][DBLP]
    SAS, 2006, pp:261-279 [Conf]
  5. Noam Rinetzky, Mooly Sagiv, Eran Yahav
    Interprocedural Shape Analysis for Cutpoint-Free Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:284-302 [Conf]
  6. Shlomi Dolev, Yinnon A. Haviv, Mooly Sagiv
    Self-stabilization Preserving Compiler. [Citation Graph (0, 0)][DBLP]
    Self-Stabilizing Systems, 2005, pp:81-95 [Conf]
  7. Gilad Arnold, Roman Manevich, Mooly Sagiv, Ran Shaham
    Combining Shape Analyses by Intersecting Abstractions. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2006, pp:33-48 [Conf]
  8. Ran Shaham, Eran Yahav, Elliot K. Kolodner, Mooly Sagiv
    Establishing local temporal heap safety properties with applications to compile-time memory management. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2005, v:58, n:1-2, pp:264-289 [Journal]
  9. Greta Yorsh, Thomas W. Reps, Mooly Sagiv, Reinhard Wilhelm
    Logical characterizations of heap abstractions. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2007, v:8, n:1, pp:- [Journal]
  10. Alexey Loginov, Thomas W. Reps, Mooly Sagiv
    Refinement-Based Verification for Possibly-Cyclic Lists. [Citation Graph (0, 0)][DBLP]
    Program Analysis and Compilation, 2006, pp:247-272 [Conf]
  11. Roman Manevich, John Field, Thomas A. Henzinger, G. Ramalingam, Mooly Sagiv
    Abstract Counterexample-Based Refinement for Powerset Domains. [Citation Graph (0, 0)][DBLP]
    Program Analysis and Compilation, 2006, pp:273-292 [Conf]
  12. Thomas W. Reps, Mooly Sagiv, Jörg Bauer
    An Appreciation of the Work of Reinhard Wilhelm. [Citation Graph (0, 0)][DBLP]
    Program Analysis and Compilation, 2006, pp:1-11 [Conf]
  13. Tal Lev-Ami, Christoph Weidenbach, Thomas W. Reps, Mooly Sagiv
    Labelled Clauses. [Citation Graph (0, 0)][DBLP]
    CADE, 2007, pp:311-327 [Conf]
  14. Thomas Ball, Orna Kupferman, Mooly Sagiv
    Leaping Loops in the Presence of Abstraction. [Citation Graph (0, 0)][DBLP]
    CAV, 2007, pp:491-503 [Conf]
  15. Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly Sagiv
    Revamping TVLA: Making Parametric Shape Analysis Competitive. [Citation Graph (0, 0)][DBLP]
    CAV, 2007, pp:221-225 [Conf]
  16. Daphna Amit, Noam Rinetzky, Thomas W. Reps, Mooly Sagiv, Eran Yahav
    Comparison Under Abstraction for Verifying Linearizability. [Citation Graph (0, 0)][DBLP]
    CAV, 2007, pp:477-490 [Conf]
  17. Noam Rinetzky, Arnd Poetzsch-Heffter, Ganesan Ramalingam, Mooly Sagiv, Eran Yahav
    Modular Shape Analysis for Dynamically Encapsulated Programs. [Citation Graph (0, 0)][DBLP]
    ESOP, 2007, pp:220-236 [Conf]
  18. Aharon Abadi, Alexander Rabinovich, Mooly Sagiv
    Decidable Fragments of Many-Sorted Logic. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:17-31 [Conf]
  19. Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sagiv
    Thread-modular shape analysis. [Citation Graph (0, 0)][DBLP]
    PLDI, 2007, pp:266-277 [Conf]
  20. Guy Gueta, Cormac Flanagan, Eran Yahav, Mooly Sagiv
    Cartesian Partial-Order Reduction. [Citation Graph (0, 0)][DBLP]
    SPIN, 2007, pp:95-112 [Conf]
  21. Roman Manevich, Josh Berdine, Byron Cook, G. Ramalingam, Mooly Sagiv
    Shape Analysis by Graph Decomposition. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:3-18 [Conf]
  22. Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
    A Logic of Reachable Patterns in Linked Data-Structures [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  23. Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
    A logic of reachable patterns in linked data-structures. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:73, n:1-2, pp:111-142 [Journal]
  24. Ohad Shacham, Mooly Sagiv, Assaf Schuster
    Scaling model checking of dataraces using dynamic information. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:5, pp:536-550 [Journal]
  25. Mooly Sagiv
    Introduction to special ESOP'05 issue. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2007, v:29, n:5, pp:- [Journal]

  26. Local Reasoning for Storable Locks and Threads. [Citation Graph (, )][DBLP]


  27. Abstract Transformers for Thread Correlation Analysis. [Citation Graph (, )][DBLP]


  28. Generalizing DPLL to Richer Logics. [Citation Graph (, )][DBLP]


  29. Proving Conditional Termination. [Citation Graph (, )][DBLP]


  30. Ranking Abstractions. [Citation Graph (, )][DBLP]


  31. Customization change impact analysis for erp professionals via program slicing. [Citation Graph (, )][DBLP]


  32. A combination framework for tracking partition sizes. [Citation Graph (, )][DBLP]


  33. Statically Inferring Complex Heap, Array, and Numeric Invariants. [Citation Graph (, )][DBLP]


  34. Heap Decomposition for Concurrent Shape Analysis. [Citation Graph (, )][DBLP]


  35. Constructing Specialized Shape Analyses for Uniform Change. [Citation Graph (, )][DBLP]


  36. Thread-Modular Shape Analysis. [Citation Graph (, )][DBLP]


  37. Automatic Verification of Strongly Dynamic Software Systems. [Citation Graph (, )][DBLP]


  38. Simulating reachability using first-order logic with applications to verification of linked data structures [Citation Graph (, )][DBLP]


Search in 0.024secs, Finished in 0.026secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002