Results 11 to 20 of about 887,077 (234)
Parameterised Multiparty Session Types [PDF]
Logical Methods in Computer Science, 2012 For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time.
Pierre-Malo Denielou +3 more
doaj +1 more source
Non-Obfuscated Unprovable Programs & Many Resultant Subtleties [PDF]
Logical Methods in Computer Science, 2016 The \emph{International Obfuscated C Code Contest} was a programming contest for the most creatively obfuscated yet succinct C code. By \emph{contrast}, an interest herein is in programs which are, \emph{in a sense}, \emph{easily} seen to be correct, but
John Case, Michael Ralston
doaj +1 more source
Logic Meets Algebra: the Case of Regular Languages [PDF]
Logical Methods in Computer Science, 2007 The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e.
Pascal Tesson, Denis Therien
doaj +1 more source
Linear Datalog and Bounded Path Duality of Relational Structures [PDF]
Logical Methods in Computer Science, 2005 In this paper we systematically investigate the connections between logics with a finite number of variables, structures of bounded pathwidth, and linear Datalog Programs.
Victor Dalmau
doaj +1 more source
Circular Proofs as Session-Typed Processes: A Local Validity Condition [PDF]
Logical Methods in Computer Science, 2022 Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus.
Farzaneh Derakhshan, Frank Pfenning
doaj +1 more source
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
Logical Methods in Computer Science, 2005 Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Joerg Flum, Martin Grohe
doaj +1 more source
Build your own clarithmetic II: Soundness [PDF]
Logical Methods in Computer Science, 2017 Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an algorithmic ...
Giorgi Japaridze
doaj +1 more source
Coarse abstractions make Zeno behaviours difficult to detect [PDF]
Logical Methods in Computer Science, 2013 An infinite run of a timed automaton is Zeno if it spans only a finite amount of time. Such runs are considered unfeasible and hence it is important to detect them, or dually, find runs that are non-Zeno.
Frédéric Herbreteau, B Srivathsan
doaj +1 more source
Derivation Lengths Classification of G\"odel's T Extending Howard's Assignment [PDF]
Logical Methods in Computer Science, 2012 Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of natural numbers ...
Gunnar Wilken, Andreas Weiermann
doaj +1 more source
On the locality of arb-invariant first-order formulas with modulo counting quantifiers [PDF]
Logical Methods in Computer Science, 2017 We study Gaifman locality and Hanf locality of an extension of first-order logic with modulo p counting quantifiers (FO+MOD_p, for short) with arbitrary numerical predicates.
Frederik Harwath, Nicole Schweikardt
doaj +1 more source