Results 1 to 10 of about 1,142,282 (251)
Palaeohispanica. Revista sobre lenguas y culturas de la Hispania Antigua, 2019 Eugenio R. Luján
openaire +3 more sources
Modalities in homotopy type theory [PDF]
Logical Methods in Computer Science, 2020 Univalent homotopy type theory (HoTT) may be seen as a language for the category of $\infty$-groupoids. It is being developed as a new foundation for mathematics and as an internal language for (elementary) higher toposes.
Egbert Rijke +2 more
doaj +1 more source
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems [PDF]
Logical Methods in Computer Science, 2012 We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity.
Takahito Aoto, Yoshihito Toyama
doaj +1 more source
Logical Methods in Computer Science, 2017 We propose a type system for a calculus of contracting processes. Processes can establish sessions by stipulating contracts, and then can interact either by keeping the promises made, or not.
Massimo Bartoletti +3 more
doaj +1 more source
Independence and concurrent separation logic [PDF]
Logical Methods in Computer Science, 2008 A compositional Petri net-based semantics is given to a simple language allowing pointer manipulation and parallelism. The model is then applied to give a notion of validity to the judgements made by concurrent separation logic that emphasizes the ...
Jonathan Hayman, Glynn Winskel
doaj +1 more source
Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs [PDF]
Logical Methods in Computer Science, 2012 We consider the problem of computing numerical invariants of programs, for instance bounds on the values of numerical program variables. More specifically, we study the problem of performing static analysis by abstract interpretation using template ...
Thomas Martin Gawlitza, David Monniaux
doaj +1 more source
Two for the Price of One: Lifting Separation Logic Assertions [PDF]
Logical Methods in Computer Science, 2012 Recently, data abstraction has been studied in the context of separation logic, with noticeable practical successes: the developed logics have enabled clean proofs of tricky challenging programs, such as subject-observer patterns, and they have become ...
Jacob Thamsborg +2 more
doaj +1 more source
First-Order and Temporal Logics for Nested Words [PDF]
Logical Methods in Computer Science, 2008 Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure of parse trees and other tree-structured data, such as XML.
Rajeev Alur +5 more
doaj +1 more source
Reasoning about Data Repetitions with Counter Systems [PDF]
Logical Methods in Computer Science, 2016 We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or past.
Stephane Demri +2 more
doaj +1 more source
Typing Copyless Message Passing [PDF]
Logical Methods in Computer Science, 2012 We present a calculus that models a form of process interaction based on copyless message passing, in the style of Singularity OS. The calculus is equipped with a type system ensuring that well-typed processes are free from memory faults, memory leaks ...
Viviana Bono, Luca Padovani
doaj +1 more source