Sciweavers

3552 search results - page 94 / 711
» Proof theory in the abstract
Sort
View
POPL
2012
ACM
14 years 1 months ago
Static and user-extensible proof checking
Despite recent successes, large-scale proof development within proof assistants remains an arcane art that is extremely timeconsuming. We argue that this can be attributed to two ...
Antonis Stampoulis, Zhong Shao
ESOP
2004
Springer
15 years 11 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
IAT
2008
IEEE
16 years 23 days ago
Beyond Quasi-linear Utility: Strategy/False-Name-Proof Multi-unit Auction Protocols
We develop strategy/false-name-proof multi-unit auction protocols for non-quasi-linear utilities. One almost universal assumption in auction theory literature is that each bidder ...
Yuko Sakurai, Yasumasa Saito, Atsushi Iwasaki, Mak...
AISC
1998
Springer
15 years 10 months ago
Instantiation of Existentially Quantified Variables in Inductive Specification Proofs
Abstract. We present an automatic approach for instantiating existentially quantified variables in inductive specifications proofs. Our approach uses first-order meta-variables in ...
Brigitte Pientka, Christoph Kreitz
SCHOLARPEDIA
2008
73views more  SCHOLARPEDIA 2008»
15 years 5 months ago
Sharkovsky ordering
ABSTRACT. We give a proof of the Sharkovsky Theorem that is selfcontained, short and direct and that illuminates the doubling structure of the Sharkovsky ordering.
Aleksandr Nikolayevich Sharkovsky