Sciweavers

10072 search results - page 88 / 2015
» Composition of Model Programs
Sort
View
AGP
1996
IEEE
15 years 6 months ago
Modular Analysis of Suspension Free cc Programs
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
Enea Zaffanella
ATVA
2008
Springer
148views Hardware» more  ATVA 2008»
15 years 4 months ago
Decidable Compositions of O-Minimal Automata
We identify a new class of decidable hybrid automata: namely, parallel compositions of semi-algebraic o-minimal automata. The class we consider is fundamental to hierarchical model...
Alberto Casagrande, Pietro Corvaja, Carla Piazza, ...
MM
2003
ACM
190views Multimedia» more  MM 2003»
15 years 7 months ago
Human + agent: creating recombinant information
combinFormation is a tool that enables browsing and collecting information elements in a generative space. By generative, we mean that the tool is an agent that automatically retr...
Andruid Kerne, Vikram Sundaram, Jin Wang, Madhur K...
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
15 years 8 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
LOPSTR
2001
Springer
15 years 6 months ago
On Deforesting Parameters of Accumulating Maps
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
Kazuhiko Kakehi, Robert Glück, Yoshihiko Futa...