Results 31 to 40 of about 1,037,765 (269)
A longitudinal study of accommodative changes in biometry during incipient presbyopia [PDF]
, 2015 PURPOSE: To profile accommodative biometric changes longitudinally and to determine the influence of age-related ocular structural changes on the accommodative response prior to the onset of presbyopia.
Davies, Leon N. +2 more
core +1 more source
Quantifier-Free Interpolation of a Theory of Arrays [PDF]
Logical Methods in Computer Science, 2012 The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving ...
Roberto Bruttomesso +2 more
doaj +1 more source
Well Behaved Transition Systems [PDF]
Logical Methods in Computer Science, 2017 The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem.
Michael Blondin +2 more
doaj +1 more source
The Complexity of Model Checking Higher-Order Fixpoint Logic [PDF]
Logical Methods in Computer Science, 2007 Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that ...
Roland Axelsson +2 more
doaj +1 more source
Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism [PDF]
Logical Methods in Computer Science, 2017 We study a propositional variant of Hoare logic that can be used for reasoning about programs that exhibit both angelic and demonic nondeterminism. We work in an uninterpreted setting, where the meaning of the atomic actions is specified axiomatically ...
Konstantinos Mamouras
doaj +1 more source
Refining Inductive Types [PDF]
Logical Methods in Computer Science, 2012 Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of particular use in dependently typed programming are indexed types that refine data by computationally useful information.
Robert Atkey +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
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs [PDF]
ACM Transactions on Programming Languages and Systems, Volume 43
Issue 4 (2021) pp 1-134, 2019 We present TaDA Live, a concurrent separation logic for reasoning compositionally about the termination of blocking fine-grained concurrent programs. The crucial challenge is how to deal with abstract atomic blocking: that is, abstract atomic operations that have blocking behaviour arising from busy-waiting patterns as found in, for example, fine ...
arxiv +1 more source
The anatomy of the Gunn laser [PDF]
, 2008 A monopolar GaAs Fabry–Pérot cavity laser based on the Gunn effect is studied both experimentally and theoretically. The light emission occurs via the band-to-band recombination of impact-ionized excess carriers in the propagating space-charge (Gunn ...
Balkan, Hall, N. Balkan, S. Chung
core +1 more source
Communicating Stream X-Machines Systems are no more than X-Machines
Journal of universal computer science (Online), 1999 A version of the communicating stream X-machine model is proposed, which gives a precise representation of the operation of transferring data from one X-machine to another.
T. Balanescu +5 more
semanticscholar +1 more source