See this document in CiteSeerX!

Interprocedural Analysis of Modular Arithmetic  (Make Corrections)  
Markus Müller-Olm, Helmut Seidl



  Home/Search   Context   Related

 
View or download:
ls5www.cs.unidortmun...trdo789.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ls5www.cs.unidortmund.de...pubs (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We consider integer arithmetic modulo a power of 2 as provided by mainstream programming languages like C or Java. The diculty here is that the ring Zm of integers modulo m = 2 , w > 1, may have zero divisors and thus cannot be embedded into a eld. Not withstanding that, we present precise intra- and inter-procedural algorithms for inferring for every program point u, all ane relations between program variables valid at u. Our algorithms run in time linear in the program size and polynomial ... (Update)

Active bibliography (related documents):   More   All
0.6:   Testing Herbrand Equalities and Beyond - Müller-Olm, Rüthing, Seidl   (Correct)
0.6:   Interprocedural Analysis (Almost) for Free - Müller-Olm, Seidl, Steffen   (Correct)
0.5:   Computing Polynomial Program Invariants - Müller-Olm, Seidl   (Correct)

Similar documents based on text:   More   All
0.5:   Precise Interprocedural Analysis through Linear Algebra - Müller-Olm, Seidl (2003)   (Correct)
0.2:   Precise Interprocedural Dependence Analysis of Parallel Programs - Müller-Olm (2004)   (Correct)
0.2:   Implementation of the ROSE Algebra: Efficient Algorithms for.. - Güting, al.   (Correct)

BibTeX entry:   (Update)

@misc{ ller-olm-interprocedural,
  author = "Markus Müller-Olm and Helmut Seidl",
  title = "Interprocedural Analysis of Modular Arithmetic",
  url = "citeseer.ist.psu.edu/698725.html" }
Citations (may not include all citations):
250   Automatic Discovery of Linear Restraints among Variables of .. - Cousot, Halbwachs - 1978
153   The Java Language Speci cation (context) - Gosling, Joy et al. - 1996
61   Countable Nondeterminism and Random Assignment (context) - Apt, Plotkin - 1986
23   Weighted Pushdown Systems and their Application to Interproc.. (context) - Reps, Schwoon et al. - 2003
18   erencing of Computable Expressions (context) - Paige, Koenig - 1982
17   Constructive Design of a Hierarchy of Semantics of a Transit.. - Cousot - 1997
13   Ane Relationships Among Variables of a Program (context) - Karr - 1976
10   Precise Interprocedural Analysis through Linear Algebra (context) - uller-Olm, Seidl - 2004
5   erential Approach to Recursive Query Evaluation (context) - Balbin, Ramamohanarao et al. - 1987
4   Computing Polynomial Program Invariants (context) - uller-Olm, Seidl - 2004
3   A Note on Karr's Algorithm (context) - uller-Olm, Seidl - 2004
2   Discovering Ane Equalities Using Random Interpretation (context) - Gulwani, Necula - 2003
1   eri cation des Systemes a Compteurs: Approximation et Acc.. (context) - Leroux - 2003
1   erences: An Ef- cient New Fixpoint Algorithm for Distributiv.. (context) - Fecht, Seidl - 1998

Documents on the same site (http://ls5-www.cs.uni-dortmund.de/~mmo/pubs/pubs.html):   More
A Modal Fixpoint Logic with Chop - Müller-Olm (1999)   (Correct)
On the Complexity of Constant Propagation - Müller-Olm, Rüthing   (Correct)
Compilation and Synthesis for Real-Time Embedded Controllers - Fränzle, Müller-Olm (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC