Results 131 to 140 of about 1,172 (171)

Computational aspects of feedback in neural circuits. [PDF]

PLoS Comput Biol, 2007
Maass W, Joshi P, Sontag ED.
europepmc   +1 more source

Analysis of the retina via suprafusion electroretinography. [PDF]

Biophys J, 1980
Bird JF, Flower RW, Mowbray GH.
europepmc   +1 more source

A Model of Consumer Demand with Anchoring and Price Effects on Purchase Behavior. [PDF]

Perspect Behav Sci
Corredor J, Jerez D, Cely-Acosta JS.
europepmc   +1 more source

Predicate abstraction for hyperliveness verification. [PDF]

Form Methods Syst Des
Beutner R, Finkbeiner B.
europepmc   +1 more source

Linearizability conditions of a time-reversible quartic-like system [PDF]

Journal of Mathematical Analysis and Applications, 2011
In this paper we study the linearizability problem of polynomial-like complex differential systems. We give a reduction of linearizability problem of such non-polynomial systems to the problem of polynomial systems.
Valery G. Romanovski, Weinian Zhang, Wentao Huang   +2 more
exaly   +2 more sources

Mechanically verified proof obligations for linearizability

ACM Transactions on Programming Languages and Systems, 2011
Concurrent objects are inherently complex to verify. In the late 80s and early 90s, Herlihy and Wing proposed linearizability as a correctness condition for concurrent objects, which, once proven, allows us to reason ...
Heike Wehrheim, John Derrick
exaly   +2 more sources

Proving linearizability with temporal logic [PDF]

Formal Aspects of Computing, 2011
Abstract Linearizability is a global correctness criterion for concurrent systems. One technique to prove linearizability is applying a composition theorem which reduces the proof of a property of the overall system to sufficient rely-guarantee conditions for single processes.
Wolfgang Reif, Bogdan Tofan, Gerhard Schellhorn   +2 more
exaly   +3 more sources