Travelled to:1 × Finland
1 × Germany
1 × Israel
1 × Italy
1 × Sweden
1 × The Netherlands
2 × Canada
2 × France
4 × USA
Collaborated with:S.Sagiv D.Bernstein N.Dor A.Itai N.Francez S.Rubin J.M.Jaffe R.Y.Pinter A.G.Konheim R.Wilhelm O.Edelstein
Talks about:analysi (4) schedul (3) data (3) parallel (2) instruct (2) arithmet (2) problem (2) static (2) memori (2) detect (2)
Person: Michael Rodeh
DBLP: Rodeh:Michael
Contributed to:
2003
20012000
1999
1998
19921991
1990
198919871985
198119781977Wrote 14 papers:
- PLDI-2003-DorRS #c #detection #named #towards
- CSSV: towards a realistic tool for statically detecting all buffer overflows in C (ND, MR, SS), pp. 155–167.
- SAS-2001-DorRS #analysis #c #integer #source code #string
- Cleanness Checking of String Manipulations in C Programs via Integer Analysis (ND, MR, SS), pp. 194–212.
- SAS-2000-DorRS
- Checking Cleanness in Linked Lists (ND, MR, SS), pp. 115–134.
- CC-1999-RubinBR #data type #recursion
- Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data Structures (SR, DB, MR), pp. 259–273.
- PASTE-1998-DorRS #analysis #detection #experience #fault #memory management #pointer
- Detecting Memory Errors via Static Pointer Analysis (Preliminary Experience) (ND, MR, SS), pp. 27–34.
- ESOP-1992-BernsteinRS #proving #safety
- Proving Safety of Speculative Load Instructions at Compile Time (DB, MR, SS), pp. 56–72.
- PLDI-1991-BernsteinR #scheduling
- Global Instruction Scheduling for Superscalar Machines (DB, MR), pp. 241–255.
- PLILP-1990-SagivFRW #analysis #approach #data flow #problem
- A Logic-Based Approach to Data Flow Analysis Problem (SS, NF, MR, RW), pp. 277–292.
- POPL-1989-SagivEFR #analysis #attribute grammar #data flow
- Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis (SS, OE, NF, MR), pp. 36–48.
- POPL-1987-BernsteinJR #parallel #scheduling
- Scheduling Arithmetic and Load Operations in Parallel with No Spilling (DB, JMJ, MR), pp. 263–273.
- POPL-1985-BernsteinPR #memory management #parallel #scheduling
- Optimal Scheduling of Arithmetic Operations in Parallel with Memory Accesses (DB, RYP, MR), pp. 325–333.
- ICALP-1981-ItaiKR #implementation
- A Sparse Table Implementation of Priority Queues (AI, AGK, MR), pp. 417–431.
- ICALP-1978-ItaiR #graph
- Covering a Graph by Circuits (AI, MR), pp. 289–299.
- ICALP-1977-ItaiR #problem
- Some Matching Problems (AI, MR), pp. 258–268.