Results 201 to 210 of about 2,046,692 (239)

Macrophage RSAD2 Couples mtDNA Synthesis With a Self‐Amplifying Inflammatory Circuit to Orchestrate Tissue Repair

Advanced Science, EarlyView.
Macrophage RSAD2 dually regulates CMPK2—the rate‐limiting enzyme for mitochondrial DNA synthesis—by suppressing its ubiquitination and promoting its phosphorylation via Csnk2a2 recruitment. This amplifies mtDNA production, which simultaneously activates a cGAS‐STING‐IRF3‐RSAD2 feedforward loop and the NLRP3 inflammasome, driving a self‐sustaining ...
Haomiao Yuan, Shukui Du, Chunfei Li, Xinjie Li, Shuyang Mu, Anran Qu, Hengxu Yan, Chongchong Xu, Jinnong Yang, Jingkai Sun, Yijun Wang, Jiayang Xiao, Fuyuan Zhang, Linlin Wang, Tiegang Li, Rui Zhao, Dawei Guan   +16 more
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Proof versus formalization

BIT, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A Formal Proof Generator from Semi-formal Proof Documents

2017
We present the CafeInMaude Proof Assistant (CiMPA) and the CafeInMaude Proof Generator (CiMPG), two complementary extensions of CafeInMaude, a CafeOBJ interpreter implemented in Maude. CiMPA is a proof assistant for inductive properties of CafeOBJ specifications, and CiMPG generates formal proofs that can be fed into CiMPA from semi-formal proof ...
Adrián Riesco 0001, Kazuhiro Ogata 0001
openaire   +1 more source

A Formal Proof of Pick’s Theorem

Mathematical Structures in Computer Science, 2010
Pick's Theorem relates the area of a simple polygon with vertices at integer lattice points to the number of lattice points in its inside and boundary. We describe a formal proof of this theorem using the HOL Light theorem prover. As sometimes happens for highly geometrical proofs, the formalisation turned out to be more work than initially expected ...
openaire   +3 more sources

On Formal Proofs

2008
We address two questions: what is the use of formal proofs? how do we proceed from a formal proof to a computation?
openaire   +2 more sources

Readable Formal Proofs

2008
The need to integrate the processes of programming and program verification requires notations for formal proofs that are easily readable. We discuss this problem in the context of Hoare logic and separation logic. It has long been the custom to describe formal proofs in these logics informally by means of "annotated specifications" or "proof ...
openaire   +2 more sources

Formalization and proof of secrecy properties

Proceedings of the 12th IEEE Computer Security Foundations Workshop, 2003
After looking at the security literature, you will find secrecy is formalized in different ways, depending on the application. Applications have threat models that influence our choice of secrecy properties. A property may be reasonable in one context and completely unsatisfactory in another if other threats exist.
openaire   +3 more sources

Formal and Informal Proofs

1991
It is a great pleasure to take part in this tribute to Woody Bledsoe in celebration of his seventieth birthday. In his 1985 Presidential Address to the American Association for Artificial Intelligence [2], Bledsoe describes the vision which came to him in a dream a quarter of a century earlier, in 1960, a vision in which he saw the future wonders which
openaire   +2 more sources

Cooperative Repositories for Formal Proofs

2007
We present a new framework for the online development of formalized mathematics. This framework allows wiki-style collaboration while providing users with a rendered and browsable version of their work. We describe a prototype based on Coq, its web interface as implemented by the second author, and a modified version of the MediaWiki code-base.
Pierre Corbineau, Cezary Kaliszyk
openaire   +1 more source

A Formal Proof of Sylow's Theorem

Journal of Automated Reasoning, 1999
The theorem of Sylow is proved in Isabelle HOL. We follow the proof by Wielandt that is more general than the original and uses a nontrivial combinatorial identity. The mathematical proof is explained in some detail, leading on to the mechanization of group theory and the necessary combinatorics in Isabelle. We present the mechanization of the proof in
Florian Kammüller, Lawrence C. Paulson
openaire   +2 more sources