Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages (Englisch)
- Neue Suche nach: Karrenberg, Ralf
- Neue Suche nach: Košta, Marek
- Neue Suche nach: Sturm, Thomas
- Neue Suche nach: Karrenberg, Ralf
- Neue Suche nach: Košta, Marek
- Neue Suche nach: Sturm, Thomas
In:
Frontiers of Combining Systems
3
;
56-70
;
2013
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages
-
Beteiligte:
-
Erschienen in:Frontiers of Combining Systems , 3 ; 56-70Lecture Notes in Computer Science ; 8152, 3 ; 56-70
-
Verlag:
- Neue Suche nach: Springer Berlin Heidelberg
-
Erscheinungsort:Berlin, Heidelberg
-
Erscheinungsdatum:01.01.2013
-
Format / Umfang:15 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
MetiTarski’s Menagerie of Cooperating SystemsPaulson, Lawrence C. et al. | 2013
- 7
-
Combining Superposition and Induction: A Practical RealizationKersani, Abdelkader / Peltier, Nicolas et al. | 2013
- 23
-
Definability of Accelerated Relations in a Theory of Arrays and Its ApplicationsAlberti, Francesco / Ghilardi, Silvio / Sharygina, Natasha et al. | 2013
- 40
-
Verification of Composed Array-Based Systems with Applications to Security-Aware WorkflowsBertolissi, Clara / Ranise, Silvio et al. | 2013
- 56
-
Presburger Arithmetic in Memory Access Optimization for Data-Parallel LanguagesKarrenberg, Ralf / Košta, Marek / Sturm, Thomas et al. | 2013
- 71
-
Roughening the $\mathcal{EL}$ EnvelopePeñaloza, Rafael / Zou, Tingting et al. | 2013
- 87
-
Uniform Interpolation of $\mathcal{ALC}$ -Ontologies Using FixpointsKoopmann, Patrick / Schmidt, Renate A. et al. | 2013
- 103
-
Abduction in Logic Programming as Second-Order Quantifier EliminationWernhard, Christoph et al. | 2013
- 120
-
Witness Runs for Counter MachinesBarrett, Clark / Demri, Stéphane / Deters, Morgan et al. | 2013
- 151
-
Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear OrdersBalbiani, Philippe / Mikulás, Szabolcs et al. | 2013
- 165
-
Temporal Query Answering in the Description Logic DL-LiteBorgwardt, Stefan / Lippmann, Marcel / Thost, Veronika et al. | 2013
- 181
-
Verification of Golog Programs over Description Logic ActionsBaader, Franz / Zarrieß, Benjamin et al. | 2013
- 197
-
Specification and Verification of Linear Dynamical Systems: Advances and ChallengesOuaknine, Joël et al. | 2013
- 198
-
Obtaining Finite Local Theory Axiomatizations via SaturationHorbach, Matthias / Sofronie-Stokkermans, Viorica et al. | 2013
- 214
-
Non-cyclic Sorts for First-Order SatisfiabilityKorovin, Konstantin et al. | 2013
- 229
-
Detection of First Order Axiomatic TheoriesBurel, Guillaume / Cruanes, Simon et al. | 2013
- 245
-
Mechanizing the Metatheory of SledgehammerBlanchette, Jasmin Christian / Popescu, Andrei et al. | 2013
- 261
-
From Resolution and DPLL to Solving Arithmetic ConstraintsKorovin, Konstantin et al. | 2013
- 263
-
Tableaux for Relation-Changing Modal LogicsAreces, Carlos / Fervari, Raul / Hoffmann, Guillaume et al. | 2013
- 279
-
Computing Minimal Models Modulo Subset-Simulation for Modal LogicsPapacchini, Fabio / Schmidt, Renate A. et al. | 2013
- 295
-
Hybrid Unification in the Description Logic $\mathcal{EL}$Baader, Franz / Fernández Gil, Oliver / Morawska, Barbara et al. | 2013
- 311
-
Disproving Confluence of Term Rewriting Systems by Interpretation and OrderingAoto, Takahito et al. | 2013
- 327
-
On Forward Closure and the Finite Variant PropertyBouchard, Christopher / Gero, Kimberly A. / Lynch, Christopher / Narendran, Paliath et al. | 2013
- 343
-
Term Rewriting with Logical ConstraintsKop, Cynthia / Nishida, Naoki et al. | 2013