Sciweavers

3333 search results - page 39 / 667
» Abstract Proof Search
Sort
View
TIME
2007
IEEE
15 years 8 months ago
Automated Natural Deduction for Propositional Linear-Time Temporal Logic
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin
FM
2009
Springer
98views Formal Methods» more  FM 2009»
15 years 9 months ago
Recursive Abstractions for Parameterized Systems
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
Joxan Jaffar, Andrew E. Santosa
CONCUR
2003
Springer
15 years 7 months ago
Full Abstraction for HOPLA
traction for HOPLA Mikkel Nygaard1 and Glynn Winskel2 1 BRICS , University of Aarhus 2 Computer Laboratory, University of Cambridge A fully abstract denotational semantics for the ...
Mikkel Nygaard, Glynn Winskel
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
15 years 6 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
142
Voted
CORR
2012
Springer
191views Education» more  CORR 2012»
13 years 10 months ago
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)
erate (Extended Abstract) Patrick Bindjeme1† and James Allen Fill1 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Bal...
Patrick Bindjeme, James Allen Fill