default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTal Lev-Ami
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[b1]Tal Lev-Ami:
Automatic maintenance of transitive properties with applications to shape analysis. Tel Aviv University, Israel, 2009- [j2]Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh:
Simulating reachability using first-order logic with applications to verification of linked data structures. Log. Methods Comput. Sci. 5(2) (2009) - [c15]Michal Segalov, Tal Lev-Ami, Roman Manevich, Ganesan Ramalingam, Mooly Sagiv:
Abstract Transformers for Thread Correlation Analysis. APLAS 2009: 30-46 - [c14]Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv:
A combination framework for tracking partition sizes. POPL 2009: 239-251 - 2008
- [c13]Byron Cook, Sumit Gulwani, Tal Lev-Ami, Andrey Rybalchenko, Mooly Sagiv:
Proving Conditional Termination. CAV 2008: 328-340 - [c12]Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Ramalingam, Shmuel Sagiv:
Thread Quantification for Concurrent Shape Analysis. CAV 2008: 399-413 - [c11]Nurit Dor, Tal Lev-Ami, Shay Litvak, Mooly Sagiv, Dror Weiss:
Customization change impact analysis for erp professionals via program slicing. ISSTA 2008: 97-108 - [c10]Roman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, Josh Berdine:
Heap Decomposition for Concurrent Shape Analysis. SAS 2008: 363-377 - 2007
- [c9]Tal Lev-Ami, Christoph Weidenbach, Thomas W. Reps, Mooly Sagiv:
Labelled Clauses. CADE 2007: 311-327 - [c8]Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly Sagiv:
Revamping TVLA: Making Parametric Shape Analysis Competitive. CAV 2007: 221-225 - [c7]Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W. Reps:
Constructing Specialized Shape Analyses for Uniform Change. VMCAI 2007: 215-233 - 2006
- [c6]Tal Lev-Ami, Neil Immerman, Shmuel Sagiv:
Abstraction for Shape Analysis with Fast and Precise Transformers. CAV 2006: 547-561 - 2005
- [c5]Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, Siddharth Srivastava, Greta Yorsh:
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures. CADE 2005: 99-115 - [c4]Nurit Dor, John Field, Denis Gopan, Tal Lev-Ami, Alexey Loginov, Roman Manevich, G. Ramalingam, Thomas W. Reps, Noam Rinetzky, Mooly Sagiv, Reinhard Wilhelm, Eran Yahav, Greta Yorsh:
Automatic Verification of Strongly Dynamic Software Systems. VSTTE 2005: 82-92 - 2004
- [c3]Tal Lev-Ami, Roman Manevich, Shmuel Sagiv:
TVLA: A system for generating abstract interpreters. IFIP Congress Topical Sessions 2004: 367-375 - 2003
- [j1]Tal Lev-Ami, Shmuel S. Tyszberowicz:
Reactive and Real-Time Systems Course: How to Get the Most Out of it. Real Time Syst. 25(2-3): 231-253 (2003) - 2000
- [c2]Tal Lev-Ami, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm:
Putting static analysis to work for verification: A case study. ISSTA 2000: 26-38 - [c1]Tal Lev-Ami, Shmuel Sagiv:
TVLA: A System for Implementing Static Analyses. SAS 2000: 280-301
Coauthor Index
aka: Mooly Sagiv
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-06 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
