Results 81 to 90 of about 1,037,765 (269)
FEBS Open Bio, EarlyView.The C. elegans tetraspanin‐7 (tsp‐7) is a homologue of human CD63, which is a negative regulator of autophagy. The C. elegans strain, tm5761, has a dysfunctional (knockout) tsp‐7 gene. When compared to the wild‐type strain, the tm5761 strain shows increased: life‐ and health‐span; thermotolerance, and stress‐induced locomotion.
Brogan Jones +2 more
wiley +1 more source
Logic Meets Algebra: the Case of Regular Languages [PDF]
Logical Methods in Computer Science, 2007 The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e.
Pascal Tesson, Denis Therien
doaj +1 more source
Dynamical Systems Method for ill-posed equations with monotone operators
, 2004 Consider an operator equation (*) $B(u)-f=0$ in a real Hilbert space. Let us call this equation ill-posed if the operator $B'(u)$ is not boundedly invertible, and well-posed otherwise.
A.G. Ramm, Ramm, Ramm
core +3 more sources
Enriched MU-Calculi Module Checking [PDF]
Logical Methods in Computer Science, 2008 The model checking problem for open systems has been intensively studied in the literature, for both finite-state (module checking) and infinite-state (pushdown module checking) systems, with respect to Ctl and Ctl*. In this paper, we further investigate
Alessandro Ferrante +2 more
doaj +1 more source
EXPTIME Tableaux for the Coalgebraic mu-Calculus [PDF]
Logical Methods in Computer Science, 2011 The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic.
Corina Cirstea +2 more
doaj +1 more source
Call-by-value Termination in the Untyped lambda-calculus [PDF]
Logical Methods in Computer Science, 2008 A fully-automated algorithm is developed able to show that evaluation of a given untyped lambda-expression will terminate under CBV (call-by-value).
Neil D. Jones, Nina Bohr
doaj +1 more source
P‐3.1: Optical see‐through near‐eye 3D display based on holographic lens 4f system [PDF]
, 2021 Min-Yang He +4 more
openalex +1 more source
General Bindings and Alpha-Equivalence in Nominal Isabelle [PDF]
Logical Methods in Computer Science, 2012 Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi involving named bound variables (as opposed to de-Bruijn indices).
Christian Urban, Cezary Kaliszyk
doaj +1 more source
2LS: Heap Analysis and Memory Safety (Competition Contribution) [PDF]
arXiv, 2019 2LS is a framework for analysis of sequential C programs that can verify and refute program assertions and termination. The 2LS framework is built upon the CPROVER infrastructure and implements template-based synthesis techniques, e.g. to find invariants and ranking functions, and incremental loop unwinding techniques to find counterexamples and k ...
arxiv
Identity, Power, and Hiring in a Feminized Profession [PDF]
, 1985 published or submitted for ...
Ivy, Barbara A.
core