СТ |
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics |
2004 |
Immerman N., Rabinovich A., Sagiv M., Yorsh G. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
23.12.2004 |
СТ |
Static Program Analysis via 3-Valued Logic |
2004 |
Reps T. W., Sagiv M., Wilhelm R. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
04.09.2004 |
СТ |
Verification via Structure Simulation |
2004 |
Immerman N., Rabinovich A., Reps T. W., Sagiv M., Yorsh G. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
04.09.2004 |
СТ |
Symbolic Implementation of the Best Transformer |
2004 |
Reps T., Sagiv M., Yorsh G. |
|
|
|
Lecture Notes in Computer Science |
12.02.2004 |
СТ |
Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory Management |
2003 |
Shaham R., Yahav E., Kolodner E. K., Sagiv M. |
|
|
|
Lecture Notes in Computer Science |
18.09.2003 |
СТ |
Verifying Temporal Heap Properties Specified via Evolution Logic |
2003 |
Yahav E., Reps T., Sagiv M., Wilhelm R. |
|
|
|
Lecture Notes in Computer Science |
16.04.2003 |
СТ |
Online Subpath Profiling |
2002 |
Oren D., Matias Y., Sagiv M. |
|
|
|
Lecture Notes in Computer Science |
27.04.2002 |
СТ |
Cleanness Checking of String Manipulations in C Programs via Integer Analysis |
2001 |
Dor N., Rodeh M., Sagiv M. |
|
|
|
Lecture Notes in Computer Science |
31.07.2001 |
СТ |
Interprocedural Shape Analysis for Recursive Programs |
2001 |
Rinetzky N., Sagiv M. |
|
|
|
Lecture Notes in Computer Science |
28.04.2001 |
СТ |
Putting Static Analysis to Work for Verification: A Case Study |
2000 |
Lev-Ami T., Reps T., Sagiv M., Wilhelm R. |
|
|
|
Software Engineering Notes |
14.12.2000 |
СТ |
TVLA: A System for Implementing Static Analyses |
2000 |
Lev-Ami T., Sagiv M. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
19.08.2000 |
СТ |
A Kleene Analysis of Mobile Ambients |
2000 |
Nielson F., Nielson H. R., Sagiv M. |
|
|
|
Lecture Notes in Computer Science |
25.04.2000 |
СТ |
Shape Analysis |
2000 |
Wilhelm R., Sagiv M., Reps T. |
|
|
|
Lecture Notes in Computer Science |
22.04.2000 |
СТ |
Automatic Removal of Array Memory Leaks in Java |
2000 |
Shaham R., Kolodner E. K., Sagiv M. |
|
|
|
Lecture Notes in Computer Science |
22.04.2000 |
СТ |
A Decidable Logic for Describing Linked Data Structures |
1999 |
Benedikt M., Reps T., Sagiv M. |
|
|
|
Lecture Notes in Computer Science |
07.04.1999 |
СТ |
Detecting Memory Errors via Static Pointer Analysis |
1998 |
Dor N., Rodeh M., Sagiv M. |
|
|
|
SIGPLAN Notices |
16.09.1998 |
СТ |
A Logic-Based Approach to Program Flow Analysis |
1998 |
Sagiv M., Francez N., Rodeh M., Wilheln R. |
|
|
|
Acta Informatica |
11.08.1998 |
СТ |
Solving Shape-Analysis Problems in Languages with Destructive Updating |
1998 |
Sagiv M., Reps T., Wilhelm R. |
|
|
|
ACM Trans. on Programming Languages and Systems |
30.07.1998 |
СТ |
Edge Profiling versus Path Profiling: The Showdown |
1998 |
Ball T., Mataga P., Sagiv M. |
|
|
|
Conf. Record of POPL 98: The 25th ACM SIGPLAN-SIGACT, Symp. on Principles of Programming Languages |
14.05.1998 |
СТ |
Building a Bridge between Pointer Aliases and Program Dependences |
1998 |
Ross J. L., Sagiv M. |
|
|
|
Lecture Notes in Computer Science |
17.04.1998 |
СТ |
Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation |
1995 |
Sagiv M., Reps T., Horwitz S. |
|
|
|
Lecture Notes in Computer Science |
20.06.1995 |