Mooly Sagiv

From MaRDI portal
Person:671678

Available identifiers

zbMath Open sagiv.moolyMaRDI QIDQ671678

List of research outcomes





PublicationDate of PublicationType
Inferring inductive invariants from phase structures2024-02-16Paper
Precise interprocedural dataflow analysis with applications to constant propagation2022-08-18Paper
Verifying equivalence of Spark programs2022-08-12Paper
Temporal prophecy for proving temporal properties of infinite-state systems2021-12-08Paper
Bounded Quantifier Instantiation for Checking Inductive Invariants2020-08-05Paper
Some complexity results for stateful network verification2019-11-18Paper
https://portal.mardi4nfdi.de/entity/Q52329002019-09-13Paper
Constrained image generation using binarized neural networks with decision procedures2018-08-10Paper
On the Automated Verification of Web Applications with Embedded SQL2018-07-18Paper
A framework for numeric analysis of array operations2017-07-14Paper
A semantics for procedure local heaps and its abstractions2017-07-14Paper
Logical characterizations of heap abstractions2017-07-12Paper
Property Directed Reachability for Proving Absence of Concurrent Modification Errors2017-02-21Paper
Conjunctive Abstract Interpretation Using Paramodulation2017-02-21Paper
Decidability of inferring inductive invariants2016-10-24Paper
Decentralizing SDN policies2016-09-29Paper
A combination framework for tracking partition sizes2015-07-03Paper
Specifying and verifying sparse matrix codes2015-03-05Paper
Checking Linearizability of Encapsulated Extended Operations2014-04-16Paper
Modular reasoning about heap paths via effectively propositional formulas2014-04-10Paper
Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning2014-01-17Paper
Automatically verifying concurrent queue algorithms2013-08-30Paper
Synthesis of Circular Compositional Program Proofs via Abduction2013-08-05Paper
Eventually Consistent Transactions2012-06-22Paper
Reasoning about Lock Placements2012-06-22Paper
Statically Inferring Complex Heap, Array, and Numeric Invariants2010-10-01Paper
Decidable fragments of many-sorted logic2009-12-03Paper
Generalizing DPLL to Richer Logics2009-06-30Paper
Simulating reachability using first-order logic with applications to verification of linked data structures2009-06-30Paper
Verification, Model Checking, and Abstract Interpretation2009-05-15Paper
Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm2009-03-12Paper
Labelled Clauses2009-03-06Paper
Heap Decomposition for Concurrent Shape Analysis2008-08-28Paper
Proving Conditional Termination2008-07-15Paper
Thread Quantification for Concurrent Shape Analysis2008-07-15Paper
Local Reasoning for Storable Locks and Threads2008-05-15Paper
Decidable Fragments of Many-Sorted Logic2008-05-15Paper
Ranking Abstractions2008-04-11Paper
Constructing Specialized Shape Analyses for Uniform Change2008-04-04Paper
Comparison Under Abstraction for Verifying Linearizability2007-11-29Paper
Leaping Loops in the Presence of Abstraction2007-11-29Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-09-28Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-09-28Paper
Self-stabilization Preserving Compiler2007-09-25Paper
Abstract Counterexample-Based Refinement for Powerset Domains2007-09-24Paper
An Appreciation of the Work of Reinhard Wilhelm2007-09-24Paper
Refinement-Based Verification for Possibly-Cyclic Lists2007-09-24Paper
Shape Analysis by Graph Decomposition2007-09-03Paper
A logic of reachable patterns in linked data-structures2007-08-23Paper
Scaling model checking of dataraces using dynamic information2007-05-23Paper
Foundations of Software Science and Computation Structures2007-05-02Paper
Verification, Model Checking, and Abstract Interpretation2007-02-12Paper
Static Analysis2006-10-31Paper
Computer Aided Verification2006-01-10Paper
Verification, Model Checking, and Abstract Interpretation2005-12-06Paper
Establishing local temporal heap safety properties with applications to compile-time memory management2005-10-10Paper
Computer Aided Verification2005-08-25Paper
Computer Aided Verification2005-08-25Paper
Static Analysis2005-08-24Paper
Static Analysis2005-08-24Paper
Computer Science Logic2005-08-22Paper
Finding circular attributes in attribute grammars2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q48134172004-08-13Paper
https://portal.mardi4nfdi.de/entity/Q47383752004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44178952003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44179062003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44119592003-07-13Paper
https://portal.mardi4nfdi.de/entity/Q47787032002-11-19Paper
https://portal.mardi4nfdi.de/entity/Q27640692002-01-22Paper
https://portal.mardi4nfdi.de/entity/Q27290572001-11-06Paper
https://portal.mardi4nfdi.de/entity/Q27220672001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q27220522001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q42309261999-02-17Paper
A logic-based approach to program flow analysis1998-11-08Paper
Precise interprocedural dataflow analysis with applications to constant propagation1997-02-27Paper

Research outcomes over time

This page was built for person: Mooly Sagiv