Sciweavers

769 search results - page 25 / 154
» Is Logic all in our Heads
Sort
View
PODC
1994
ACM
15 years 4 months ago
Open Systems in TLA
We describe a method for writing assumption/guarantee specifications of concurrent systems. We also provide a proof rule for reasoning about the composition of these systems. Spec...
Martín Abadi, Leslie Lamport
88
Voted
TABLEAUX
1998
Springer
15 years 5 months ago
Deleting Redundancy in Proof Reconstruction
We present a framework for eliminating redundancies during the reconstruction of sequent proofs from matrix proofs. We show that search-free proof reconstruction requires knowledge...
Stephan Schmitt, Christoph Kreitz
93
Voted
RELMICS
2000
Springer
15 years 4 months ago
Implication-with-possible-exceptions
Abstract. We introduce an implication-with-possible-exceptions and define validity of rules-withpossible-exceptions by means of the topological notion of a full subset. Our implica...
Nerman Jurrjus, Harrie C. M. de Swart
FPGA
2004
ACM
121views FPGA» more  FPGA 2004»
15 years 6 months ago
Highly pipelined asynchronous FPGAs
We present the design of a high-performance, highly pipelined asynchronous FPGA. We describe a very fine-grain pipelined logic block and routing interconnect architecture, and sh...
John Teifel, Rajit Manohar
106
Voted
LPAR
1999
Springer
15 years 5 months ago
A Partial Evaluation Framework for Curry Programs
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
Elvira Albert, María Alpuente, Michael Hanu...