Abstract is missing.
- Verification by abstract interpretation, soundness and abstract inductionPatrick Cousot. 1-4 [doi]
- Automatic amortized analysisMartin Hofmann. 5 [doi]
- ReactiveML, ten years laterLouis Mandel, Cédric Pasteur, Marc Pouzet. 6-17 [doi]
- Proof checking and logic programmingDale Miller. 18 [doi]
- Enhancing the specification and verification techniques of multiparty sessions in SOCAbeer S. Al-Humaimeedy, Maribel Fernández. 19-30 [doi]
- On modeling planning problems in tabled logic programmingRoman Barták, Agostino Dovier, Neng-Fa Zhou. 31-42 [doi]
- Computation in focused intuitionistic logicTaus Brock-Nannestad, Nicolas Guenot, Daniel Gustafsson. 43-54 [doi]
- Debugging of wrong and missing answers for datalog programs with constraint handling rulesRafael Caballero, Yolanda García-Ruiz, Fernando Sáenz-Pérez. 55-66 [doi]
- Declarative interpretations of session-based concurrencyMauricio Cano, Camilo Rueda, Hugo A. López, Jorge A. Pérez. 67-78 [doi]
- Automated verification of safety properties of declarative networking programsChen Chen, Lay Kuan Loh, Limin Jia, Wenchao Zhou, Boon Thau Loo. 79-90 [doi]
- Semantics-based generation of verification conditions by program specializationEmanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti. 91-102 [doi]
- A devil's advocate against termination of direct recursionThom W. Frühwirth. 103-113 [doi]
- A refined operational semantics for ACT-R: investigating the relations between different ACT-R formalizationsDaniel Gall, Thom W. Frühwirth. 114-124 [doi]
- Static analysis of cloud elasticityAbel Garcia, Cosimo Laneve, Michael Lienhardt. 125-136 [doi]
- Concolic testing for functional languagesAggelos Giantsios, Nikolaos S. Papaspyrou, Konstantinos F. Sagonas. 137-148 [doi]
- Jthread, a deadlock-free mutex libraryJohan Grande, Gérard Boudol, Manuel Serrano. 149-160 [doi]
- An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logicStefan Haar, Salim Perchy, Camilo Rueda, Frank D. Valencia. 161-172 [doi]
- Search by constraint propagationThierry Martinez, François Fages, Sylvain Soliman. 173-183 [doi]
- Lasp: a language for distributed, coordination-free programmingChristopher Meiklejohn, Peter Van Roy. 184-195 [doi]
- From monoids to near-semirings: the essence of MonadPlus and alternativeExequiel Rivas, Mauro Jaskelioff, Tom Schrijvers. 196-207 [doi]
- Expressing preferences in logic programming using an infinite-valued logicPanos Rondogiannis, Antonis Troumpoukis. 208-219 [doi]
- Improvements in a functional core language with call-by-need operational semanticsManfred Schmidt-Schauß, David Sabel. 220-231 [doi]
- Detecting concurrency bugs in higher-order programs through abstract interpretationQuentin Stievenart, Jens Nicolay, Wolfgang De Meuter, Coen De Roover. 232-243 [doi]
- On a uniform representation of combinators, arithmetic, lambda terms and typesPaul Tarau. 244-255 [doi]