Výsledky vyhledávání - I.2.2 Automatic Programming. Program Transformation

Dynamic generation of migratory interfaces

Autoři: Bandelloni R Mori G Paterno' F

Zdroj: Mobile HCI 2005. 7th International Conference on Human Computer Interaction with Mobile Devices and Services, pp. 83–90, Salzburg, 19-22 September 2005
info:cnr-pdr/source/autori:Bandelloni R.; Mori G.; Paterno' F./congresso_nome:Mobile HCI 2005. 7th International Conference on Human Computer Interaction with Mobile Devices and Services/congresso_luogo:Salzburg/congresso_data:19-22 September 2005/anno:2005/pagina_da:83/pagina_a:90/intervallo_pagine:83–90

Témata: H.5 Information interfaces and presentation, Ubiquitous environments, Migratory Interfaces, I.2.2 Automatic Programming. Program Transformation, Model-based design

Popis souboru: application/pdf

Přístupová URL adresa: http://www.cnr.it/prodotto/i/91186
https://publications.cnr.it/doc/91186
https://hdl.handle.net/20.500.14243/61356

Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism

Autoři: Pettorossi A Proietti M Renault S a další

Přispěvatelé: Pettorossi A Proietti M Renault S a další

Zdroj: Automatic Program Development ISBN: 9781402065842
Higher-order and symbolic computation
18 (2005): 121–210. doi:10.1007/s10990-005-7008-3
info:cnr-pdr/source/autori:Pettorossi, A.; Proietti, M.; Renault, S./titolo:Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism/doi:10.1007%2Fs10990-005-7008-3/rivista:Higher-order and symbolic computation (Print)/anno:2005/pagina_da:121/pagina_a:210/intervallo_pagine:121–210/volume:18
Automatic Program Development-A Tribute to Robert Paige, edited by Olivier Danvy, Fritz Henglein, Harry Mairson, Alberto Pettorossi, pp. 133–177, 2008
info:cnr-pdr/source/autori:Pettorossi, A.; Proietti, M.; Renault, S./titolo:Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism/titolo_volume:Automatic Program Development-A Tribute to Robert Paige/curatori_volume:Olivier Danvy, Fritz Henglein, Harry Mairson, Alberto Pettorossi/editore:/anno:2008

Témata: D.1.2, I.2.2, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer Science - Programming Languages, D.1.6, Automatic program derivation, Settore ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI, 0102 computer and information sciences, 02 engineering and technology, Logic programming, 01 natural sciences, Program specialization, Program transformation, Transformation rules and strategies, Logic in Computer Science (cs.LO), F.3.1, 0202 electrical engineering, electronic engineering, information engineering, Programming Languages (cs.PL)

Přístupová URL adresa: http://arxiv.org/abs/cs/0311044
https://publications.cnr.it/doc/153484
http://www.cnr.it/prodotto/i/153484
http://www.cnr.it/prodotto/i/170370
https://publications.cnr.it/doc/170370
http://www.cnr.it/prodotto/i/153428
https://publications.cnr.it/doc/153428
https://link.springer.com/10.1007/s10990-005-7008-3
https://core.ac.uk/display/53819477
https://rd.springer.com/chapter/10.1007/978-1-4020-6585-9_12
https://art.torvergata.it/handle/2108/32838
https://link.springer.com/chapter/10.1007/978-1-4020-6585-9_12
https://dblp.uni-trier.de/db/journals/lisp/lisp18.html#PettorossiPR05
https://hdl.handle.net/20.500.14243/154349

Logic program specialisation through partial deduction: Control issues

Autoři: Leuschel, Michael Bruynooghe, Maurice

Zdroj: Theory and Practice of Logic Programming. 2:461-515

Témata: FOS: Computer and information sciences, languages, Technology, PROLOG, partial evaluator, cs.PL, term rewriting-systems, 02 engineering and technology, termination analysis, D.1.6, D.1.2, I.2.2, F.4.1, I.2.3, Logic programming, 01 natural sciences, logic programming, specialization, generation, PARTIAL EVALUATOR, 0202 electrical engineering, electronic engineering, information engineering, 4602 Artificial intelligence, ORDER, 0803 Computer Software, well-founded semantics, Science & Technology - Other Topics, mercury, BINDING-TIME ANALYSIS, Logic, Computer Science - Artificial Intelligence, 0102 computer and information sciences, Computation Theory & Mathematics, Computer Science, Theory & Methods, TERMINATION ANALYSIS, 0801 Artificial Intelligence and Image Processing, partial evaluation, program specialisation, partial deduction, 0802 Computation Theory and Mathematics, 4613 Theory of computation, Science & Technology, Computer Science - Programming Languages, transformation, binding-time analysis, MIXED COMPUTATION, cs.AI, Computer Science, Software Engineering, TRANSFORMATION, Artificial Intelligence (cs.AI), Computer Science, SYSTEM, Programming Languages (cs.PL)

Popis souboru: application/xml; text

Přístupová URL adresa: https://lirias.kuleuven.be/bitstream/123456789/124878/3/37399.pdf
http://arxiv.org/abs/cs/0202012
https://eprints.soton.ac.uk/259186/

Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving

Autoři: Lucas Alba, Salvador Departamento de Sistemas Informáticos y Computación Escuela Técnica Superior de Ingeniería Informática a další

Přispěvatelé: Lucas Alba, Salvador Departamento de Sistemas Informáticos y Computación Escuela Técnica Superior de Ingeniería Informática a další

Zdroj: RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Universitat Politècnica de València (UPV)
instname
Electronic Proceedings in Theoretical Computer Science, Vol 200, Iss Proc. PROLE 2015, Pp 32-47 (2015)

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Program Termination, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Order-sorted first-order logic, QA1-939, 0202 electrical engineering, electronic engineering, information engineering, Linear algebra, I.2.2, I.2.3, Computer Science - Programming Languages, I.2.4, I.2.5, F.3.1, F.4.1, QA75.5-76.95, 16. Peace & justice, Logical models, Logic in Computer Science (cs.LO), Electronic computers. Computer science, LENGUAJES Y SISTEMAS INFORMATICOS, Mathematics, Programming Languages (cs.PL)

Popis souboru: application/pdf

Přístupová URL adresa: https://arxiv.org/pdf/1512.06943
http://arxiv.org/abs/1512.06943
https://riunet.upv.es/handle/10251/64921
https://doaj.org/article/406e4d861e244d3ab5860192e99c6581
https://m.riunet.upv.es/handle/10251/64921
http://ui.adsabs.harvard.edu/abs/2015arXiv151206943L/abstract
https://riunet.upv.es/handle/10251/64921
https://dblp.uni-trier.de/db/series/eptcs/eptcs200.html#Lucas15a
https://arxiv.org/pdf/1512.06943.pdf
https://www.arxiv.org/abs/1512.06943
https://hdl.handle.net/10251/64921
https://doi.org/10.4204/eptcs.200.3

Automated Termination Proofs for Haskell by Term Rewriting.

Autoři: Giesl, Jürgen Raffelsieper, Matthias Schneider-Kamp, Peter a další

Zdroj: ACM Transactions on Programming Languages & Systems; Mar2011, Vol. 33 Issue 2, p7-7:39, 39p

Témata: REWRITING systems (Computer science), DOCUMENT markup languages, HASKELL (Computer program language), POLYMORPHIC projection (Cartography), AUTOMATIC programming (Computer science), AUTOMATIC theorem proving, SOFTWARE verification, FUNCTIONAL programming (Computer science)

From Datalog Rules to Efficient Programs with Time and Space Guarantees.

Autoři: LIU, YANHONG A. STOLLER, SCOTT D.

Zdroj: ACM Transactions on Programming Languages & Systems; Aug2009, Vol. 31 Issue 6, p21-21:38, 38p, 2 Diagrams, 7 Charts, 3 Graphs

Témata: DATA structures, INDEXING, PROGRAM transformation, RECURSION theory, ALGORITHMS, COMPUTATIONAL complexity

Automated Termination Proofs for Logic Programs by Term Rewriting.

Autoři: Schneider-Kamp, Peter Giesl, Jürgen Serebrenik, Alexander a další

Zdroj: ACM Transactions on Computational Logic; Oct2009, Vol. 11 Issue 1, p2-2:52, 52p, 4 Charts

Témata: REWRITING systems (Computer science), COMPUTER software termination, LOGIC programming, MATHEMATICAL transformations, INFINITY (Mathematics)

Oracle-Guided Component-Based Program Synthesis.

Autoři: Jha, Susmit Gulwani, Sumit Seshia, Sanjit A. a další

Zdroj: ICSE: International Conference on Software Engineering; 2010, p215-224, 10p, 6 Diagrams, 3 Charts, 2 Graphs

Témata: MALWARE, COMPUTER software, COMPUTER programming

Korporace: ORACLE Corp.

Finding Bugs in Program Generators by Dynamic Analysis of Syntactic Language Constraints.

Autoři: Erdweg, Sebastian Vergu, Vlad Mezini, Mira a další

Zdroj: Aspect-oriented Software Development; 4/22/14, p17-20, 4p

Removing redundant arguments automatically

Autoři: María Alpuente Salvador Lucas Santiago Escobar

Zdroj: Theory and Practice of Logic Programming. 7:3-35

Témata: I.2.2, FOS: Computer and information sciences, Computer Science - Programming Languages, I.2.5, D.2.4, 0202 electrical engineering, electronic engineering, information engineering, F.3.3, 0102 computer and information sciences, 02 engineering and technology, F.3.1, 01 natural sciences, Programming Languages (cs.PL)

Přístupová URL adresa: http://arxiv.org/pdf/cs/0601039
http://arxiv.org/abs/cs/0601039

Logic-Based Program Synthesis and Transformation : 16th International Symposium, LOPSTR 2006, Venice, Italy, July 12-14, 2006, Revised Selected Papers

Autoři: Germán Puebla

Resource Type: eBook.

Témata: Logic programming--Congresses

Categories: COMPUTERS / Software Development & Engineering / General, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Science, COMPUTERS / Programming / General

Modular Specification and Dynamic Enforcement of Syntactic Language Constraints when Generating Code.

Autoři: Erdweg, Sebastian Vergu, Vlad Mezini, Mira a další

Zdroj: Aspect-oriented Software Development; 4/22/14, p241-252, 12p

Typing Linear Constraints.

Autoři: Ruggieri, Salvatore Mesnard, Fred

Zdroj: ACM Transactions on Programming Languages & Systems; Aug2010, Vol. 32 Issue 6, p21-21:42, 42p, 5 Black and White Photographs, 5 Charts, 2 Graphs

Témata: POLYHEDRA, DEFINITENESS (Linguistics), MATHEMATICAL variables, APPROXIMATION theory, LINEAR programming, LINEAR algebra, COMPUTATIONAL complexity, ELECTRONIC data processing, MACHINE theory, NP-complete problems

Logic Program Synthesis and Transformation : 7th International Workshop, LOPSTR ’97, Leuven, Belgium, July 10–12, 1997 Proceedings

Autoři: Norbert E. Fuchs

Resource Type: eBook.

Témata: Computer programming, Artificial intelligence, Computer science, Machine theory

Categories: COMPUTERS / Programming / General, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Science

Removing Redundant Arguments Automatically

Autoři: Alpuente, Maria Escobar, Santiago Lucas, Salvador

Témata: Computer Science - Programming Languages, D.2.4, F.3.1, F.3.3, I.2.2, I.2.5, text

URL: http://arxiv.org/abs/cs/0601039

Empirical Hardness Models: Methodology and a Case Study on Combinatorial Auctions.

Autoři: LEYTON-BROWN, KEVIN NUDELMAN, EUGENE SHOHAM, YOAV

Zdroj: Journal of the ACM; Jun2009, Vol. 56 Issue 4, p22:1-22:52, 52p, 2 Diagrams, 6 Charts, 27 Graphs

Témata: MACHINE learning, BENCHMARKING (Management), ARTIFICIAL intelligence, COMPUTATIONAL complexity, NP-complete problems, COMPUTATIONAL learning theory, EXPLANATION-based learning

Constructor-based Conditional Narrowing

Autoři: Sergio Antoy The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Sergio Antoy The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.pdx.edu/~antoy/homepage/./papers/ppdp01-A/paper.ps.gz.

Témata: Algorithms, Languages, Performance, Theory Keywords Functional Logic Programming Languages, Rewrite Systems, Narrowing

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8483

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8483
http://www.cs.pdx.edu/~antoy/homepage/./papers/ppdp01-A/paper.ps.gz

Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving

Autoři: Lucas, Salvador

Témata: Computer Science - Programming Languages, Computer Science - Logic in Computer Science, F.3.1, F.4.1, I.2.2, I.2.3, I.2.4, I.2.5, text

URL: http://arxiv.org/abs/1512.06943

Optimizing Synthesis with Metasketches.

Autoři: Bornholt, James Torlak, Emina Grossman, Dan a další

Zdroj: ACM / SIGPLAN Notices; Jan2016, Vol. 51 Issue 1, p775-788, 14p

Accuracy Versus Time: A Case Study with Summation Algorithms

Autoři: Matthieu Martel Laurent Thévenoux The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Matthieu Martel Laurent Thévenoux The Pennsylvania State University CiteSeerX Archives

Zdroj: http://perso.univ-perp.fr/mmartel/pasco10.pdf.

Témata: Categories and Subject Descriptors D.3.4 [Processors, Compilers, Optimization, G.1.0 [Mathematics of Computing, Numerical Analysis, Computer Arithmetic, I.2.2 [Automatic Programming, Program transformation. General Terms Algorithms, Design, Experimentation, Performance, Reliability. Keywords Parallelism, Summation, Floating-point numbers, Precision. This work was partly supported by the project

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.4432

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.4432
http://perso.univ-perp.fr/mmartel/pasco10.pdf