Results 1 to 10 of about 1,037,765 (269)
Palaeohispanica. Revista sobre lenguas y culturas de la Hispania Antigua, 2019 Eugenio R. Luján
semanticscholar +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 +2 more sources
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
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
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
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
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem [PDF]
Logical Methods in Computer Science, 2007 In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step algorithms.
Andreas Blass +3 more
doaj +1 more source
Algebraic Notions of Termination [PDF]
Logical Methods in Computer Science, 2011 Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation.
Desharnais Jules +2 more
doaj +1 more source
Psi-calculi: a framework for mobile processes with nominal data and logic [PDF]
Logical Methods in Computer Science, 2011 The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processes and their names can be statically scoped as in the standard pi-calculus.
Jesper Bengtson +3 more
doaj +1 more source