Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
28 | Isabel Oitavem |
Implicit Characterizations of Pspace. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Theory in Computer Science ![In: Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings, pp. 170-190, 2001, Springer, 3-540-42752-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
implicit characterizations, computational complexity, term rewriting, Pspace |
28 | Matthias Baaz, Alexander Leitsch |
Comparing the Complexity of Cut-Elimination Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Theory in Computer Science ![In: Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings, pp. 49-67, 2001, Springer, 3-540-42752-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Gordon D. Plotkin, Colin Stirling, Mads Tofte (eds.) |
Proof, Language, and Interaction, Essays in Honour of Robin Milner ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![The MIT Press, 978-0-262-16188-6 The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Didier Galmiche (eds.) |
Proceedings of the Workshop on Type-Theoretic Languages: Proof Search and Semantics 2000, held in conjunction with CADE-17 Conference, Pittsburgh, PA, USA, June 20-21, 2000 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Type-Theoretic Languages: Proof Search and Semantics ![Elsevier The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Gordon D. Plotkin, Colin Stirling, Mads Tofte |
A brief scientific biography of Robin Milner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 1-18, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | C. A. R. Hoare, Jifeng He 0001, Augusto Sampaio |
Algebraic derivation of an operational semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 77-98, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Pierre-Louis Curien, Gordon D. Plotkin, Glynn Winskel |
Bistructures, bidomains, and linear logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 21-54, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Gérard P. Huet, Amokrane Saïbi |
Constructive category theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 239-276, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Jaco de Bakker, Franck van Breugel |
From Banach to Milner: metric semantics for second order communication and concurrency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 99-132, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Gérard Boudol, Cosimo Laneve |
lambda-calculus, multiplicities, and the pi-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 659-690, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Davide Sangiorgi |
Lazy functions and mobile processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 691-720, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Robert Harper 0001, Christopher A. Stone |
A type-theoretic interpretation of standard ML. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 341-388, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Sergey Berezin, Edmund M. Clarke, Somesh Jha, Will Marrero |
Model checking algorithms for the µ-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 309-338, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Joachim Parrow |
Trios in concert. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 623-638, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | William Ferreira 0001, Matthew Hennessy, Alan Jeffrey |
Combining the typed lambda-calculus with CCS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 511-534, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Yoram Hirshfeld, Faron Moller |
On the star height of unary regular behaviours. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 497-510, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Robert L. Constable, Paul B. Jackson, Pavel Naumov, Juan C. Uribe |
Constructively formalizing automata theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 213-238, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Fabio Gadducci, Ugo Montanari |
The tile model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 133-166, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Mike Gordon |
From LCF to HOL: a short history. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 169-186, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Gérard Berry |
The foundations of Esterel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 425-454, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Uffe Engberg, Mogens Nielsen |
A calculus of communicating systems with label passing - ten years after. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 599-622, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Xinxin Liu 0008, David Walker 0008 |
Concurrent objects as mobile processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 639-658, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Eugene W. Stark, Scott A. Smolka |
A complete axiom system for finite-state probabilistic processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 571-596, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Benjamin C. Pierce, David N. Turner |
Pict: a programming language based on the Pi-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 455-494, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Samson Abramsky |
Axioms for definability and full completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 55-76, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Jos C. M. Baeten, Jan A. Bergstra, Michel A. Reniers |
Discrete time process algebra with silent step. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 535-570, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Lawrence C. Paulson |
A fixedpoint approach to (co)inductive and (co)datatype definitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 187-212, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Pierre Collette, Cliff B. Jones |
Enhancing the tractability of rely/guarantee specifications in the development of interfering operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 277-308, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Mads Tofte, Lars Birkedal |
Unification and polymorphism in region inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof, Language, and Interaction ![In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 389-424, 2000, The MIT Press, 978-0-262-16188-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
28 | Aleksey Nogin |
Writing Constructive Proofs Yielding Efficient Extracted Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Type-Theoretic Languages: Proof Search and Semantics ![In: Proceedings of the Workshop on Type-Theoretic Languages: Proof Search and Semantics 2000, held in conjunction with CADE-17 Conference, Pittsburgh, PA, USA, June 20-21, 2000, pp. 1-17, 2000, Elsevier. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Didier Galmiche |
Preface. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Type-Theoretic Languages: Proof Search and Semantics ![In: Proceedings of the Workshop on Type-Theoretic Languages: Proof Search and Semantics 2000, held in conjunction with CADE-17 Conference, Pittsburgh, PA, USA, June 20-21, 2000, pp. 1-2, 2000, Elsevier. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | James Harland, David J. Pym, Michael Winikoff |
Forward and Backward Chaining in Linear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Type-Theoretic Languages: Proof Search and Semantics ![In: Proceedings of the Workshop on Type-Theoretic Languages: Proof Search and Semantics 2000, held in conjunction with CADE-17 Conference, Pittsburgh, PA, USA, June 20-21, 2000, pp. 1-16, 2000, Elsevier. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger (eds.) |
Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997) ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![Springer, 3-540-64201-3 The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Paul Beame, Samuel R. Buss (eds.) |
Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![DIMACS/AMS, 978-0-8218-0577-0 The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Didier Galmiche (eds.) |
Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), Lindau, Germany, July 5, 1998 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Search in Type-Theoretic Languages@CADE ![Elsevier The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP BibTeX RDF |
|
28 | Paul Mukherjee, John S. Fitzgerald |
The Ammunition Control System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof in VDM ![In: Proof in VDM: Case Studies, pp. 31-64, 1998, Springer, 978-3-540-76186-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Noemie Slaats, Bart Van Assche, Albert Hoogewijs |
Shared Memory Synchronization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof in VDM ![In: Proof in VDM: Case Studies, pp. 123-156, 1998, Springer, 978-3-540-76186-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Sten Agerholm, Juan Bicarregui, Savi Maharaj |
On the Verification of VDM Specification and Refinement with PVS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof in VDM ![In: Proof in VDM: Case Studies, pp. 157-189, 1998, Springer, 978-3-540-76186-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Peter Lindsay |
Specification and Validation of a Network Security Policy Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof in VDM ![In: Proof in VDM: Case Studies, pp. 65-93, 1998, Springer, 978-3-540-76186-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | David J. Pym |
Logic Programming with Bunched Implications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Search in Type-Theoretic Languages@CADE ![In: Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), Lindau, Germany, July 5, 1998, pp. 1-24, 1998, Elsevier. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Michael Franssen |
Embedding First-Order Tableaux into a Pure Type System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Search in Type-Theoretic Languages@CADE ![In: Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), Lindau, Germany, July 5, 1998, pp. 1-23, 1998, Elsevier. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Frank Pfenning, Carsten Schürmann |
Algorithms for Equality and Unification in the Presence of Notational Definitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Search in Type-Theoretic Languages@CADE ![In: Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), Lindau, Germany, July 5, 1998, pp. 1-13, 1998, Elsevier. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Didier Galmiche |
Preface. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Search in Type-Theoretic Languages@CADE ![In: Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), Lindau, Germany, July 5, 1998, pp. 1-2, 1998, Elsevier. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Luís Pinto 0001, Roy Dyckhoff |
Sequent Calculi for the Normal Terms of the - and - Calculi. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Search in Type-Theoretic Languages@CADE ![In: Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), Lindau, Germany, July 5, 1998, pp. 1-14, 1998, Elsevier. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Dominique Larchey-Wendling, Didier Galmiche |
Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Search in Type-Theoretic Languages@CADE ![In: Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), Lindau, Germany, July 5, 1998, pp. 1-18, 1998, Elsevier. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Sebastian Seibert, Thomas Wilke |
Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 179-212, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Thomas Jansen 0001 |
Introduction to the Theory of Complexity and Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 5-28, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Martin Mundhenk, Anna Slobodová |
Optimal Non-approximability of MAXCLIQUE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 235-248, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Katja Wolf |
Dense Instances of Hard Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 299-312, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Thomas Hofmeister, Martin Hühne |
Semidefinite Programming and Its Applications to Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 263-298, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Artur Andrzejak 0001 |
Introduction to Randomized Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 29-40, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Claus Rick, Hein Röhrig |
Deriving Non-approximability Results by Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 213-234, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Detlef Sieling |
Derandomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 41-62, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Peter Clote, Anton Setzer |
On PHP st-connectivity, and odd charged graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 93-117, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Samuel R. Buss |
Lower bounds on Nullstellensatz proofs via designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 59-71, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Paul Beame, Søren Riis |
More on the relative strength of counting principles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 13-35, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | François Pitt |
A quantifier-free theory based on a string algebra for NC1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 229-252, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Alexis Maciel, Toniann Pitassi |
Towards lower bounds for bounded-depth Frege proofs with modular connectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 195-227, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Jeremy Avigad |
Plausibly hard combinatorial tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 1-12, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan |
Descriptive complexity and the W hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 119-134, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Stephen Cook |
Relating the provable collapse of P to NC1 and the power of logical theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 73-91, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Dan E. Willard |
Self-reflection principles and NP-hardness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 297-320, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Stasys Jukna |
Exponential lower bounds for semantic resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 163-172, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Jan Johannsen |
Equational calculi and constant depth propositional proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 149-162, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Xudong Fu |
Lower bounds on sizes of cutting plane proofs for modular coloring principles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 135-148, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Barbara Kauffmann |
Bounded arithmetic: Comparison of Buss' witnessing method and Sieg's Herbrand analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 173-193, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Stephen J. Bellantoni |
Ranking arithmetic proofs by implicit ramification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 37-57, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Roy Dyckhoff, Lars-Henrik Eriksson, Alberto Momigliano, Mario Ornaghi (eds.) |
ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994 ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | Per Kreuger |
A-Sufficient Substitutions in mixed Contents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | Lars Hallnäs, Per Kreuger |
Partial Inductive Definitions (Tutorial). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | Peter J. Robinson 0001, John Staples, Anthony S. K. Cheng |
Theorem Proving Applications for QU-Prolog. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | Didier Galmiche |
Canonical Proofs for Linear Logic Programming Frameworks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | Jonas Barklund, Stefania Costantini, Pierangelo Dell'Acqua, Gaetano Aurelio Lanzarone |
Integrating Reflection into SLD-Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | I. Stephan |
An SLOU Prolog Interpreter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | Göran Falkman, Lars Hallnäs, Olof Torgersson |
Program Separation in GCLA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | Francesca Arcelli, Ferrante Formato |
Higher-Order Implementation of Program Transformations using Algebraic Specification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | Matteo Baldoni, Laura Giordano 0001, Alberto Martelli |
A Modal Extension of Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | R. S. Kemp, Graem A. Ringwood |
Reynold and Heyling Models of Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | Roy Dyckhoff, Luís Pinto 0001 |
Uniform Proofs and Natural Deduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | Iliano Cervesato |
Lollipops Taste of Vanilla too. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming ![In: ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
28 | Alberto Coen-Porisini, Richard A. Kemmerer, Dino Mandrioli |
A Formal Framework for ASTRAL Intralevel Proof Obligations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(8), pp. 548-561, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
intralevel proof obligations, formal software development, mathematical correctness, ASLAN, TRIO, real-time systems, real-time systems, verification, formal specification, formal specification, formal methods, finite state machines, program verification, specification languages, state machines, formal specification language, formal proof, timing requirements, ASTRAL |
28 | A. Wolinsky |
A simple proof of Lewin's ordered-retrieval theorem for associative memories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 11(7), pp. 488-490, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
access frequency proof, column digit values, column sensing arrangement, digit value readout, digit value variety, digit variety readout, memory access frequency, ordered information retrieval, ordered lists, ordered retrieval efficiency, ordered retrieval theorem, retrieval theorem proof, associative memories, content-addressed memories, memory access |
27 | Paul Valiant |
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008., pp. 1-18, 2008, Springer, 978-3-540-78523-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Chuck C. Liang, Dale Miller 0001 |
Focusing and Polarization in Intuitionistic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 451-465, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Ralph D. Jeffords, Constance L. Heitmeyer |
A strategy for efficiently verifying requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESEC / SIGSOFT FSE ![In: Proceedings of the 11th ACM SIGSOFT Symposium on Foundations of Software Engineering 2003 held jointly with 9th European Software Engineering Conference, ESEC/FSE 2003, Helsinki, Finland, September 1-5, 2003, pp. 28-37, 2003, ACM, 978-1-58113-743-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
model checking, formal methods, software tools, invariants, requirements specification, compositional verification |
27 | Bruce Spencer, Joseph Douglas Horton |
Support Ordered Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-17, 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000, Proceedings, pp. 385-400, 2000, Springer, 3-540-67664-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Peter B. Andrews |
Transforming Matings into Natural Deduction Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 5th Conference on Automated Deduction, Les Arcs, France, July 8-11, 1980, Proceedings, pp. 281-292, 1980, Springer, 3-540-10009-1. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
27 | Reynald Affeldt, Miki Tanaka, Nicolas Marti |
Formal Proof of Provable Security by Game-Playing in a Proof Assistant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ProvSec ![In: Provable Security, First International Conference, ProvSec 2007, Wollongong, Australia, November 1-2, 2007, Proceedings, pp. 151-168, 2007, Springer, 978-3-540-75669-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Julian Richardson |
A Semantics for Proof Plans with Applications to Interactive Proof Planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings, pp. 337-351, 2002, Springer, 3-540-00010-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Marco Meoni |
Interactive Parallel Analysis on the ALICE Grid with the PROOF Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (1) ![In: Computational Science - ICCS 2009, 9th International Conference, Baton Rouge, LA, USA, May 25-27, 2009, Proceedings, Part I, pp. 114-122, 2009, Springer, 978-3-642-01969-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
interactive parallel distributed processing, task colocation, Grid, PROOF, ALICE, resource availability, data movement |
27 | Kriangsak Damchoom, Michael J. Butler, Jean-Raymond Abrial |
Modelling and Proof of a Tree-Structured File System in Event-B and Rodin. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering, 10th International Conference on Formal Engineering Methods, ICFEM 2008, Kitakyushu-City, Japan, October 27-31, 2008. Proceedings, pp. 25-44, 2008, Springer, 978-3-540-88193-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Rodin tool, Refinement, File system, Tree structure, Proof, Event-B |
27 | Olivier Laurent 0001, Roberto Maieli |
Cut Elimination for Monomial MALL Proof Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 486-497, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Linear Logic, Cut Elimination, Proof Net |
27 | Hirohiko Kushida, Mitsu Okada |
A proof-theoretic study of the correspondence of hybrid logic and classical logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 16(1), pp. 35-61, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Proof theory, Hybrid logic, Classical logic |
27 | Andrzej S. Murawski, C.-H. Luke Ong |
Fast verification of MLL proof nets via IMLL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(3), pp. 473-498, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Multiplicative linear logic, disjoint union find, essential nets, dominator trees, proof nets |
27 | Zhicheng Wen, Huaikou Miao, Hongwei Zeng |
Generating Proof Obligation to Verify Object-Z Specification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSEA ![In: Proceedings of the International Conference on Software Engineering Advances (ICSEA 2006), October 28 - November 2, 2006, Papeete, Tahiti, French Polynesia, pp. 38, 2006, IEEE Computer Society, 0-7695-2703-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
formal specification, Object-Z, proof obligation |
27 | Stefano Baratella, Andrea Masini |
An approach to infinitary temporal proof theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(8), pp. 965-990, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Modal logic, Proof theory, Sequent calculus, Cut elimination, Infinitary logic |
27 | Masahiro Hamano |
Softness of MALL proof-structures and a correctness criterion with Mix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(6), pp. 751-794, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Multiplicative Additive Proof-Nets, Linear Logic, Sequentialization |
27 | Kazuhiro Ogata 0001, Kokichi Futatsugi |
Proof Scores in the OTS/CafeOBJ Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMOODS ![In: Formal Methods for Open Object-Based Distributed Systems, 6th IFIP WG 6.1 International Conference, FMOODS 2003, Paris, France, November 19.21, 2003, Proceedings, pp. 170-184, 2003, Springer, 3-540-20491-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
observational transition system, proof scores, the NSLPK authentication protocol, verification, Algebraic specification, CafeOBJ |
27 | Kenji Terada, Makoto Yokoo |
False-name-proof multi-unit auction protocol utilizing greedy allocation based on approximate evaluation values. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: The Second International Joint Conference on Autonomous Agents & Multiagent Systems, AAMAS 2003, July 14-18, 2003, Melbourne, Victoria, Australia, Proceedings, pp. 337-344, 2003, ACM, 1-58113-683-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
false-name-proof, multi-unit auction, mechanism design |
27 | Andrew Bernard, Peter Lee 0001 |
Temporal Logic for Proof-Carrying Code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings, pp. 31-46, 2002, Springer, 3-540-43931-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
temporal logic, Proof-carrying code |