Results 21 to 30 of about 1,142,282 (251)
Non-Deterministic Kleene Coalgebras [PDF]
Logical Methods in Computer Science, 2010 In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems.
Alexandra Silva +2 more
doaj +1 more source
Playing with Repetitions in Data Words Using Energy Games [PDF]
Logical Methods in Computer Science, 2020 We introduce two-player games which build words over infinite alphabets, and we study the problem of checking the existence of winning strategies. These games are played by two players, who take turns in choosing valuations for variables ranging over an ...
Diego Figueira +2 more
doaj +1 more source
Nonlinear Dirac Equations [PDF]
, 2009 We construct nonlinear extensions of Dirac's relativistic electron equation that preserve its other desirable properties such as locality, separability, conservation of probability and Poincar\'e invariance.
Ng, Wei-Khim, Parwani, Rajesh R.
core +4 more sources
Permission-Based Separation Logic for Message-Passing Concurrency [PDF]
Logical Methods in Computer Science, 2011 We develop local reasoning techniques for message passing concurrent programs based on ideas from separation logics and resource usage analysis. We extend processes with permission- resources and define a reduction semantics for this extended language ...
Adrian Francalanza +2 more
doaj +1 more source
Forward Analysis for WSTS, Part III: Karp-Miller Trees [PDF]
Logical Methods in Computer Science, 2020 This paper is a sequel of "Forward Analysis for WSTS, Part I: Completions" [STACS 2009, LZI Intl. Proc. in Informatics 3, 433-444] and "Forward Analysis for WSTS, Part II: Complete WSTS" [Logical Methods in Computer Science 8(3), 2012].
Michael Blondin +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
Fast wavelength-tunable ultra-violet laser source for confocal Fura-2AM imaging [PDF]
, 2007 We report a novel wavelength-flexible laser source for three-dimensional ultra-violet imaging. Based on supercontinuum generation in photonic crystal fiber, the resultant broadband laser source extended from A = 331 nm into the visible region of the ...
Esposito, E., Harris, J., McConnell, G.
core +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
The QCD equation of state with asqtad staggered fermions [PDF]
, 2006 We report on our result for the equation of state (EOS) with a Symanzik improved gauge action and the asqtad improved staggered fermion action at $N_t=4$ and 6.
Bernard, C. +9 more
core +2 more sources