DAEDALUS |
Public documents produced by the DAEDALUS project
|
Correctness of Classical Compiler Optimizations using CTL.
In
Electronic Notes in Theoretical Computer Science, COCV'02 Compiler Optimization Meets Compiler Verification (J. Knoop and W. Zimmermann, Eds.), Volume 65, Issue 2, © Elsevier Science Publishers. April 2002.
http://www.diku.dk/forskning/topps/bibliography/2002.html#D-469
Program Generation, Termination, and Binding-time Analysis.
Invited talk at PLI 2002 conference cluster, Pittsburgh, PA, October 6-8, 2002.
In Proceedings of the ACM SIGPLAN/SIGSOFT Conference on
Generative Programming and Component Engineering (GPCE'02)
(Don Batory, Charles Consel, and Walid Taha, Eds.). LNCS, Volume 2487, ©
Springer.
http://www.diku.dk/forskning/topps/bibliography/2002.html#D-463
Program analysis
for implicit computational complexity
Implicit Computational Complexity, ICC'2002.
Copenhagen, Denmark, July 20—21, 2002
Pipeline Modeling for Timing Analysis.
In
Proceedings of the The
9th International Static Analysis Symposium SAS'02, Madrid,
Spain,
17—20 September 2002.
Lecture Notes
in Computer Science 2477, M. Hermenegildo, G. Puebla (Eds.),
pp. 294—309, ©
Springer.
Worst Case Execution Time Prediction.
In Proceedings of the WCET workshop of the EUROMICRO 2002 conference on
Real-Time Systems, Vienna, June 2002, to appear.
Program termination analysis in polynomial time..
In Proceedings of the ACM SIGPLAN/SIGSOFT Conference on
Generative Programming and Component Engineering (GPCE'02)
(Don Batory, Charles Consel, and Walid Taha, Eds.), Pittsburgh, PA, October 6-8, 2002. LNCS, Volume 2487, pp. 218—235, ©
Springer.
http://www.diku.dk/topps/bibliography/2002.html#D-472
Finiteness analysis in polynomial time..
In
Proceedings of the The 9th International Static Analysis Symposium SAS'02, Madrid, Spain,
17—20 September 2002.
Lecture Notes
in Computer Science 2477,
M. Hermenegildo, G. Puebla (Eds.),
pp. 493—508, ©
Springer.
http://www.diku.dk/topps/bibliography/2002.html#D-471
Program Termination Analysis and Termination of Offline Partial Evaluation..
PhD thesis. Department of Computer Science & Software Engineering,
University of Western Australia., August, 2002..
http://www.diku.dk/topps/bibliography/2002.html#D-475
Compactly representing first-order structures for static analysis.
In
Proceedings of the The 9th International Static Analysis Symposium SAS'02, Madrid, Spain,
17—20 September 2002.
Lecture Notes
in Computer Science 2477, M. Hermenegildo, G. Puebla (Eds.),
pp. 196—212, ©
Springer.
Deriving specialized program
analyses for certifying component-client conformance (Abstract
Static Analysis of the Numerical Stability of Loops. (ps.gz)
In
Proceedings of the The 9th International Static Analysis Symposium SAS'02, Madrid, Spain,
17—20 September 2002.
Lecture Notes
in Computer Science 2477, M. Hermenegildo, G. Puebla (Eds.),
pp. 133—150, ©
Springer.
Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties.
In
Proceedings of the The 9th International Static Analysis Symposium SAS'02, Madrid, Spain,
17—20 September 2002.
Lecture Notes
in Computer Science 2477, M. Hermenegildo, G. Puebla (Eds.),
pp. 428—443, ©
Springer.
A Few Graph-Based Relational Numerical Abstract Domains.
In
Proceedings of the The 9th International Static Analysis Symposium SAS'02, Madrid, Spain,
17—20 September 2002.
Lecture Notes
in Computer Science 2477, M. Hermenegildo, G. Puebla (Eds.),
pp. 117—132, ©
Springer.
Parametric shape
analysis via 3-valued logic.
In
TOPLAS 24(3):217—298, 2002, ACM Press.
Semantic minimization of
3-valued propositional formulae.
In Proc. IEEE Symp. on Logic in
Computer Science (LICS 2002), Federated Logic Conference (FLoC 2002),
Copenhagen, Denmark, July 22—25, 2002.
Polynomial Constants Are Decidable.
In
Proceedings of the The 9th International Static Analysis Symposium SAS'02, Madrid, Spain,
17—20 September 2002.
Lecture Notes
in Computer Science 2477, M. Hermenegildo, G. Puebla (Eds.),
pp. 4—19, ©
Springer.
Control flow graphs
for
real-time system analysis — reconstruction from binary executables
and
usage in ILP-based path analysis.
Ph.D., Saarland University, Saarbrücken, September 2002.
ILP-based Interprocedural Path Analysis.
In
Proceedings of the Second International
Workshop on Embedded Software, EMSOFT'02, Grenoble, France, October 7—9, 2002.
Lecture Notes
in Computer Science
2491, Sangiovanni-Vincentelli, A. & Sifakis, J. (Eds.) ©
Springer.
Refinement of static analyzes by abstract
interpretation.
Ph.D. thesis, École Polytechnique, Palaiseau, France, June 2002.
Nonuniform Alias Analysis of Recursive Data Structures and Arrays.
In
Proceedings of the The 9th International Static Analysis Symposium SAS'02, Madrid, Spain,
17—20 September 2002.
Lecture Notes
in Computer Science 2477, M. Hermenegildo, G. Puebla (Eds.),
pp. 36—51, ©
Springer.
Automatic Runtime Analysis for First Order Functional Programs.
Master's Thesis. DIKU, University of Copenhagen. September 2002.
http://www.diku.dk/forskning/topps/bibliography/2002.html#D-470
Footing Modular Static Analyses on Firm Ground.
École polytechnique, September 2002.
Precise Interprocedural Dependence Analysis of Parallel Programs.
Tech. Report, Trier 2002.
http://WWW.Informatik.Uni-Trier.DE/~seidl/DAEDALUS/nonatomic.ps
Property checking driven abstract interpretation-based static
analysis.
École polytechnique, September 2002.
Abstractions of expectation functions using Gaussian distributions.
École normale supérieure, September 2002.
Abstract Interpretation based certification of assembly code.
École normale supérieure, September 2002.
Automatic
Verification of Temporal Properties of Concurrent Heap-Manipulating
Programs using Evolution Logic.
TR-338/02, School of Computer Science, Tel Aviv University, July 2002.
(.ps.gz)
Interprocedural
Invariants.
Tech. Report, Trier 2002.
http://WWW.Informatik.Uni-Trier.DE/~seidl/DAEDALUS/invariants.ps
Dernière mise à jour / Last modified : Wednesday, 04-Jun-2003 12:39:58 CEST