|
Search the dblp DataBase
Mooly Sagiv:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- Greta Yorsh, Thomas Ball, Mooly Sagiv
Testing, abstraction, theorem proving: better together! [Citation Graph (0, 0)][DBLP] ISSTA, 2006, pp:145-156 [Conf]
- 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]
- 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]
- Noam Rinetzky, Mooly Sagiv, Eran Yahav
Interprocedural Shape Analysis for Cutpoint-Free Programs. [Citation Graph (0, 0)][DBLP] SAS, 2005, pp:284-302 [Conf]
- Shlomi Dolev, Yinnon A. Haviv, Mooly Sagiv
Self-stabilization Preserving Compiler. [Citation Graph (0, 0)][DBLP] Self-Stabilizing Systems, 2005, pp:81-95 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Tal Lev-Ami, Christoph Weidenbach, Thomas W. Reps, Mooly Sagiv
Labelled Clauses. [Citation Graph (0, 0)][DBLP] CADE, 2007, pp:311-327 [Conf]
- Thomas Ball, Orna Kupferman, Mooly Sagiv
Leaping Loops in the Presence of Abstraction. [Citation Graph (0, 0)][DBLP] CAV, 2007, pp:491-503 [Conf]
- 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]
- 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]
- 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]
- Aharon Abadi, Alexander Rabinovich, Mooly Sagiv
Decidable Fragments of Many-Sorted Logic. [Citation Graph (0, 0)][DBLP] LPAR, 2007, pp:17-31 [Conf]
- Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sagiv
Thread-modular shape analysis. [Citation Graph (0, 0)][DBLP] PLDI, 2007, pp:266-277 [Conf]
- Guy Gueta, Cormac Flanagan, Eran Yahav, Mooly Sagiv
Cartesian Partial-Order Reduction. [Citation Graph (0, 0)][DBLP] SPIN, 2007, pp:95-112 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
Local Reasoning for Storable Locks and Threads. [Citation Graph (, )][DBLP]
Abstract Transformers for Thread Correlation Analysis. [Citation Graph (, )][DBLP]
Generalizing DPLL to Richer Logics. [Citation Graph (, )][DBLP]
Proving Conditional Termination. [Citation Graph (, )][DBLP]
Ranking Abstractions. [Citation Graph (, )][DBLP]
Customization change impact analysis for erp professionals via program slicing. [Citation Graph (, )][DBLP]
A combination framework for tracking partition sizes. [Citation Graph (, )][DBLP]
Statically Inferring Complex Heap, Array, and Numeric Invariants. [Citation Graph (, )][DBLP]
Heap Decomposition for Concurrent Shape Analysis. [Citation Graph (, )][DBLP]
Constructing Specialized Shape Analyses for Uniform Change. [Citation Graph (, )][DBLP]
Thread-Modular Shape Analysis. [Citation Graph (, )][DBLP]
Automatic Verification of Strongly Dynamic Software Systems. [Citation Graph (, )][DBLP]
Simulating reachability using first-order logic with applications to verification of linked data structures [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs
|