Results 21 to 30 of about 1,037,765 (269)
Expressiveness of Metric modalities for continuous time [PDF]
Logical Methods in Computer Science, 2007 We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by the previous modalities, over the real line, or over the positive reals.
Yoram Hirshfeld, Alexander Rabinovich
doaj +1 more source
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
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
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
Annals of Clinical and Translational Neurology, Volume 9, Issue 12, Page 1962-1973, December 2022., 2022 Abstract Objectives Early‐ and late‐onset Alzheimer's disease (EOAD and LOAD) share the same neuropathological traits but show distinct cognitive features. We aimed to explore baseline and longitudinal outcomes of global and domain‐specific cognitive function in a well characterized cohort of patients with a biomarker‐based diagnosis.
Adrià Tort‐Merino +16 more
wiley +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
Effects of losartan treatment on cardiac autonomic control during volume loading in patients with DCM [PDF]
, 2000 This study evaluated the effect of angiotensin II receptor blockade on cardiac autonomic control adaptation and urine output in response to acute isotonic volume load in patients with idiopathic dilated cardiomyopathy (DCM) and asymptomatic to mildly ...
C. Apicella +7 more
core +1 more source
Proof-irrelevant model of CC with predicative induction and judgmental equality [PDF]
Logical Methods in Computer Science, 2011 We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's trace encoding
Gyesik Lee, Benjamin Werner
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
A lower bound on web services composition [PDF]
Logical Methods in Computer Science, 2008 A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web services; where the construction is understood as a simulation of the ...
Anca Muscholl, Igor Walukiewicz
doaj +1 more source