We gratefully acknowledge support from
the Simons Foundation
and member institutions

Logic in Computer Science

Authors and titles for recent submissions

[ total of 29 entries: 1-25 | 26-29 ]
[ showing 25 entries per page: fewer | more | all ]

Mon, 19 Feb 2018

[1]  arXiv:1802.05935 [pdf, ps, other]
Title: Decidability for Entailments of Symbolic Heaps with Arrays
Comments: A submission for the postproceedings of the Continuity, Computability, Constructivity 2017
Subjects: Logic in Computer Science (cs.LO)
[2]  arXiv:1802.05862 [html]
Title: Proceedings Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation
Authors: Horatiu Cirstea (LORIA, Université de Lorraine, France), David Sabel (Goethe-University Frankfurt am Main, Germany)
Journal-ref: EPTCS 265, 2018
Subjects: Logic in Computer Science (cs.LO); Programming Languages (cs.PL)

Fri, 16 Feb 2018

[3]  arXiv:1802.05629 [pdf, ps, other]
Title: Models of Type Theory Based on Moore Paths
Comments: This is a revised and expanded version of a paper with the same name that appeared in the proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)
Subjects: Logic in Computer Science (cs.LO)
[4]  arXiv:1802.05616 [pdf, ps, other]
Title: Model Generation for Quantified Formulas: A Taint-Based Approach
Authors: Benjamin Farinier (1), Sébastien Bardin (1), Richard Bonichon (1), Marie-Laure Potet (2) ((1) LSL, (2) VERIMAG - IMAG)
Subjects: Logic in Computer Science (cs.LO)
[5]  arXiv:1802.05559 [pdf, ps, other]
Title: Fine-Grained Complexity of Safety Verification
Subjects: Logic in Computer Science (cs.LO); Distributed, Parallel, and Cluster Computing (cs.DC); Data Structures and Algorithms (cs.DS)
[6]  arXiv:1802.05494 [pdf, ps, other]
Title: Non-idempotent types for classical calculi in natural deduction style
Comments: 43 pages
Subjects: Logic in Computer Science (cs.LO)

Thu, 15 Feb 2018

[7]  arXiv:1802.05266 [pdf, ps, other]
Title: Circular (Yet Sound) Proofs
Comments: 3 figures
Subjects: Logic in Computer Science (cs.LO)
[8]  arXiv:1802.05159 [pdf, other]
Title: SAT solving techniques: a bibliography
Authors: Louis Abraham
Subjects: Logic in Computer Science (cs.LO)
[9]  arXiv:1802.05143 [pdf, ps, other]
Title: On completeness and parametricity in the realizability semantics of System F
Authors: Paolo Pistone
Subjects: Logic in Computer Science (cs.LO); Logic (math.LO)
[10]  arXiv:1802.04982 [pdf, other]
Title: Craig Interpolation and Access Interpolation with Clausal First-Order Tableaux
Subjects: Logic in Computer Science (cs.LO)
[11]  arXiv:1802.04970 [pdf, other]
Title: Abstract Family-based Model Checking using Modal Featured Transition Systems: Preservation of CTL* (Extended Version)
Subjects: Logic in Computer Science (cs.LO); Programming Languages (cs.PL); Software Engineering (cs.SE)
[12]  arXiv:1802.04954 [pdf, other]
Title: A sound and complete definition of linearizability on weak memory models
Comments: 22 pages, including appendix
Subjects: Logic in Computer Science (cs.LO)

Wed, 14 Feb 2018

[13]  arXiv:1802.04739 [pdf, other]
Title: Query learning of derived $ω$-tree languages in polynomial time
Subjects: Logic in Computer Science (cs.LO)
[14]  arXiv:1802.04704 [pdf, ps, other]
Title: Proof systems: from nestings to sequents and back
Authors: Elaine Pimentel
Comments: Extended version of the paper submitted to IJCAR-18
Subjects: Logic in Computer Science (cs.LO)
[15]  arXiv:1802.04695 [pdf, other]
Title: A Concurrent Constraint Programming Interpretation of Access Permissions
Comments: This paper is under consideration for publication in Theory and Practice of Logic Programming (TPLP)
Subjects: Logic in Computer Science (cs.LO)
[16]  arXiv:1802.04512 [pdf, ps, other]
Title: The principle of point-free continuity
Comments: 24 pages
Subjects: Logic in Computer Science (cs.LO); Logic (math.LO)
[17]  arXiv:1802.04406 [pdf, ps, other]
Title: A wide-spectrum language for verification of programs on weak memory models
Subjects: Programming Languages (cs.PL); Logic in Computer Science (cs.LO)
[18]  arXiv:1802.04315 [pdf, ps, other]
Title: Higher Groups in Homotopy Type Theory
Subjects: Logic in Computer Science (cs.LO); Algebraic Topology (math.AT); Logic (math.LO)
[19]  arXiv:1802.04698 (cross-list from cs.DM) [pdf, other]
Title: Subtyping for Hierarchical, Reconfigurable Petri Nets
Authors: Julia Padberg
Subjects: Discrete Mathematics (cs.DM); Logic in Computer Science (cs.LO)
[20]  arXiv:1802.04428 (cross-list from cs.PL) [pdf, other]
Title: Reconciling Enumerative and Symbolic Search in Syntax-Guided Synthesis
Subjects: Programming Languages (cs.PL); Logic in Computer Science (cs.LO)

Tue, 13 Feb 2018 (showing first 5 of 9 entries)

[21]  arXiv:1802.04067 [pdf, ps, other]
Title: Alternating Nonzero Automata
Subjects: Logic in Computer Science (cs.LO); Formal Languages and Automata Theory (cs.FL)
[22]  arXiv:1802.03993 [pdf, ps, other]
Title: Symmetries of Quantified Boolean Formulas
Subjects: Logic in Computer Science (cs.LO); Symbolic Computation (cs.SC)
[23]  arXiv:1802.03828 [pdf, other]
Title: New Models for Generating Hard Random Boolean Formulas and Disjunctive Logic Programs
Comments: 37 pages, 24 figures
Subjects: Logic in Computer Science (cs.LO)
[24]  arXiv:1802.03775 [pdf, other]
Title: An Algebraic Framework for Runtime Verification
Subjects: Logic in Computer Science (cs.LO)
[25]  arXiv:1802.03744 [pdf, ps, other]
Title: Denotational semantics for guarded dependent type theory
Subjects: Logic in Computer Science (cs.LO)
[ total of 29 entries: 1-25 | 26-29 ]
[ showing 25 entries per page: fewer | more | all ]

Disable MathJax (What is MathJax?)