[HTML][HTML] Innovations in computational type theory using Nuprl

SF Allen, M Bickford, RL Constable, R Eaton… - Journal of Applied …, 2006 - Elsevier
For twenty years the Nuprl (“new pearl”) system has been used to develop software systems
and formal theories of computational mathematics. It has also been used to explore and …

A survey on theorem provers in formal methods

MS Nawaz, M Malik, Y Li, M Sun, M Lali - arXiv preprint arXiv:1912.03028, 2019 - arxiv.org
Mechanical reasoning is a key area of research that lies at the crossroads of mathematical
logic and artificial intelligence. The main aim to develop mechanical reasoning systems …

MetaPRL–a modular logical environment

J Hickey, A Nogin, RL Constable, BE Aydemir… - Theorem Proving in …, 2003 - Springer
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell
PRL group. While initially created at Cornell, MetaPRL is currently a collaborative project …

[PDF][PDF] Runtime service composition via logic-based program synthesis

S Lämmermann - 2002 - diva-portal.org
Dynamic composition of services from components at runtime can help to provide flexible
service infrastructures, but requires advanced composition techniques. To address this …

Protocol switching: Exploiting meta-properties

X Liu, R van Renesse, M Bickford… - Proceedings 21st …, 2001 - ieeexplore.ieee.org
As we see a growing variety of network and application behaviors, it becomes more
important that protocols adapt to their surroundings. Building adaptive protocols is …

Speculative linearizability

R Guerraoui, V Kuncak, G Losa - ACM Sigplan Notices, 2012 - dl.acm.org
Linearizability is a key design methodology for reasoning about implementations of
concurrent abstract data types in both shared memory and message passing systems. It …

A logic of events

M Bickford, RL Constable - 2003 - ecommons.cornell.edu
There is a well-established theory and practice for creating correct-by-construction functional
programs by extracting them from constructive proofs of assertions of the form" For all x: A …

Building reliable, high-performance networks with the Nuprl proof development system

C Kreitz - Journal of Functional Programming, 2004 - cambridge.org
Proof systems for expressive type theories provide a foundation for the verification and
synthesis of programs. But despite their successful application to numerous programming …

[PDF][PDF] A causal logic of events in formalized computational type theory

M Bickford, RL Constable - 2005 - ecommons.cornell.edu
We provide a logic for distributed computing that has the explanatory and technical power of
constructive logics of computation. Inparticular, we establish a proof technology that …

Knowledge-based synthesis of distributed systems using event structures

M Bickford, R Constable, J Halpern… - Logical Methods in …, 2011 - lmcs.episciences.org
To produce a program guaranteed to satisfy a given specification one can synthesize it from
a formal constructive proof that a computation satisfying that specification exists. This …