Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Static Analysis: First International Static Analysis Symposium, SAS ' 94, Namur, Belgium, September 28 - 30, 1994. Proceedings > Boolean functions for dependency analysis: Algebraic properties and efficient representation
Static Analysis: First International Static Analysis Symposium, SAS ' 94, Namur, Belgium, September 28 - 30, 1994. Proceedings |
Baudouin LeCharlier
Springer Berlin Heidelberg
Static Analysis: First International Static Analysis Symposium, SAS ' 94, Namur, Belgium, September 28 - 30, 1994. Proceedings
Boolean functions for dependency analysis: Algebraic properties and efficient representation
Authors

Tania Armstrong; Kim Marriott; Peter Schachte; Harald Søndergaard

ARI Id

1664796670009_3259604

Access

Not Available Free

Pages

266-280

DOI

10.1007/3-540-58485-4_46

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-58485-4_46

Table of Contents of Book
Showing 1 to 20 of 31 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
The costs and benefits of abstract interpretation-driven Prolog optimization
Thomas W. Getzinger
1-25
Mode analysis of functional logic programs
Michael Hanus; Frank Zartmann
26-42
Directional type checking of logic programs
Alexander Aiken; T. K. Lakshman
43-60
A systematic construction of abstract domains
Dmitri Boulanger; Maurice Bruynooghe
61-77
Constraint-based type inference and parametric polymorphism
Ole Agesen
78-100
Efficient on-the-fly analysis of program behavior and static cache simulation
Frank Mueller; David B. Whalley
101-115
From processor timing specifications to static instruction scheduling
Ed Harcourt; Jon Mauney; Todd Cook
116-130
Stackability in the simply-typed call-by-value lambda calculus
Anindya Banerjee; David A. Schmidt
131-146
Generalized boxings, congruences and partial inlining
Jean Goubault
147-161
Selective thunkification
Paul Steckler; Mitchell Wand
162-178
About synchronous programming and abstract interpretation
Nicolas Halbwachs
179-192
Uniqueness and completeness analysis of array comprehensions
David Garza-Salazar; Wim Böhm
193-207
Extent analysis of data fields
Björn Lisper; Jean -Francois Collard
208-222
Verification of linear hybrid systems by means of convex approximations
Nicolas Halbwachs; Yann -Eric Proy; Pascal Raymond
223-237
Compile-time detection of uncaught exceptions in Standard ML programs
Kwangkeun Yi
238-254
Estimating the computational cost of logic programs
S. K. Debray; P. López García; M. Hermenegildo; N. -W. Lin
255-265
Boolean functions for dependency analysis: Algebraic properties and efficient representation
Tania Armstrong; Kim Marriott; Peter Schachte; Harald Søndergaard
266-280
Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop
Michael Codish; Bart Demoen
281-296
Extracting Non-strict independent and-parallelism using sharing and freeness information
Daniel Cabeza Gras; Manuel Hermenegildo
297-313
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 31 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings