HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors
Volume •Abstracts •Preface •Authors •Keywords •BibTex Entries

SCSS 2014. 6th International Symposium on Symbolic Computation in Software Science

Editors: Temur Kutsia and Andrei Voronkov
EPiC Series in Computing•Volume 30
7 articles•76 pages•Published: December 4, 2014

Papers

νZ - Maximal Satisfaction with Z3
Nikolaj Bjorner and Anh-Dung Phan
Pages 1-9
Meaning Formulas for Syntax-Based Mathematical Algorithms
William Farmer
Pages 10-11
Towards an amortized type system for JavaScript
Daniel Franzen and David Aspinall
Pages 12-26
Machine Learning of Coq Proof Guidance: First Experiments
Cezary Kaliszyk, Lionel Mamane and Josef Urban
Pages 27-34
PDT Logic for Stream Reasoning in Multi-agent Systems
Karsten Martiny and Ralf Moeller
Pages 35-46
A refutation procedure for proving satisfiability of constraint specifications on XML documents
Marisa Navarro and Fernando Orejas
Pages 47-61
Parametric Strategy Iteration
Helmut Seidl, Thomas Martin Gawlitza and Martin Schwarz
Pages 62-76

Keyphrases

abstract interpretation, amortized analysis, constraint, Coq, doxastic logic, epistemic logic, formal mathematics, interactive theorem proving, JavaScript type system, machine learning, mobile applications, parametric program analysis, probabilistic logic, proof advice, Refutation procedure, resource bounds, resource usage, strategy iteration, Stream Reasoning, temporal logic, type system, type theory, XML document, XPath pattern
Copyright © 2012-2023 easychair.org. All rights reserved.