Results 41 to 50 of about 1,037,765 (269)
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
Differential Equation Invariance Axiomatization [PDF]
J. ACM 67(1), Article 6, 2020, 66 pages, 2019 This article proves the completeness of an axiomatization for differential equation invariants described by Noetherian functions. First, the differential equation axioms of differential dynamic logic are shown to be complete for reasoning about analytic invariants.
arxiv +1 more source
New Microbes and New Infections, EarlyView., 2014 Abstract We describe a case of fungal keratitis due to Beauveria bassiana in a farmer with Fuchs' dystrophy, treated with amphotericin B. Surgery with penetrating keratoplasty was necessary to resolve the lesions. Susceptibility testing and molecular sequencing permitted the identification and treatment of this rare aetiological agent of invasive ...
M. Ligozzi +8 more
wiley +1 more source
International Journal of Adaptive Control and Signal Processing, EarlyView., 2023 Summary In this contribution, we propose a detailed study of interpolation‐based data‐driven methods that are of relevance in the model reduction and also in the systems and control communities. The data are given by samples of the transfer function of the underlying (unknown) model, that is, we analyze frequency‐response data.
Quirin Aumann, Ion Victor Gosea
wiley +1 more source
On the strength of proof-irrelevant type theories [PDF]
Logical Methods in Computer Science, 2008 We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlying a theorem prover.
Benjamin Werner
doaj +1 more source
QRB-Domains and the Probabilistic Powerdomain [PDF]
Logical Methods in Computer Science, 2012 Is there any Cartesian-closed category of continuous domains that would be closed under Jones and Plotkin's probabilistic powerdomain construction? This is a major open problem in the area of denotational semantics of probabilistic higher-order languages.
Jean Goubault-Larrecq
doaj +1 more source
Reasoning about Strategies: on the Satisfiability Problem [PDF]
Logical Methods in Computer Science, 2017 Strategy Logic (SL, for short) has been introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games.
Fabio Mogavero +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
Formalization of Abstract State Transition Systems for SAT [PDF]
Logical Methods in Computer Science, 2011 We present a formalization of modern SAT solvers and their properties in a form of abstract state transition systems. SAT solving procedures are described as transition relations over states that represent the values of the solver's global variables ...
Filip Maric, Predrag Janicic
doaj +1 more source