default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th LOPSTR 2016: Edinburgh, UK
- Manuel V. Hermenegildo, Pedro López-García:
Logic-Based Program Synthesis and Transformation - 26th International Symposium, LOPSTR 2016, Edinburgh, UK, September 6-8, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10184, Springer 2017, ISBN 978-3-319-63138-7
Program Transformation
- María Alpuente
, Angel Cuenca-Ortega, Santiago Escobar, José Meseguer:
Partial Evaluation of Order-Sorted Equational Programs Modulo Axioms. 3-20 - Elvira Albert, Nikolaos Bezirgiannis, Frank S. de Boer, Enrique Martin-Martin:
A Formal, Resource Consumption-Preserving Translation of Actors to Haskell. 21-37 - Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti:
Verification of Time-Aware Business Processes Using Constrained Horn Clauses. 38-55
Constraint Programming
- Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey, Guido Tack:
MiniZinc with Strings. 59-75 - Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte, Catuscia Palamidessi:
Slicing Concurrent Constraint Programs. 76-93
Compilation and Optimization
- Sergio Antoy, Andy Jost:
A New Functional-Logic Compiler for Curry: Sprite. 97-113 - Manuel Bichler, Michael Morak, Stefan Woltran:
lpopt: A Rule Optimization Tool for Answer Set Programming. 114-130 - Ginés Moreno, Jaime Penabad, José A. Riaza, Germán Vidal:
Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs. 131-147
Analysis and Verification
- Bin Fang, Mihaela Sighireanu:
Hierarchical Shape Abstraction for Analysis of Free List Memory Allocators. 151-167 - Ekaterina Komendantskaya, Patricia Johann, Martin Schmidt:
A Productivity Checker for Logic Programming. 168-186 - María Alpuente, Daniel Pardo, Alicia Villanueva:
Symbolic Abstract Contract Synthesis in a Rewriting Framework. 187-202
Testing
- Fred Mesnard, Étienne Payet, Germán Vidal:
On the Completeness of Selective Unification in Concolic Testing of Logic Programs. 205-221 - Michael Hanus:
CurryCheck: Checking Properties of Curry Programs. 222-239 - Paul Tarau:
A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms. 240-255
Semantics and Model Checking
- Naoki Nishida, Adrián Palacios, Germán Vidal:
A Reversible Semantics for Erlang. 259-274 - Anushri Jana, Uday P. Khedker, Advaita Datar, R. Venkatesh, Niyas C:
Scaling Bounded Model Checking by Transforming Programs with Arrays. 275-292 - Fernando Sáenz-Pérez:
Intuitionistic Logic Programming for SQL. 293-308
Types, Unification, and Logic
- Frantisek Farka, Ekaterina Komendantskaya, Kevin Hammond:
Coinductive Soundness of Corecursive Type Class Resolution. 311-327 - Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Unification of Higher Order Expressions with Recursive Let. 328-344 - Maciej Zielenkiewicz, Aleksy Schubert:
Automata Theory Approach to Predicate Intuitionistic Logic. 345-360
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-29 23:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
