1805 search results - page 210 / 361 » A Theory of Closure Operators |
280
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
172
click to vote
RECOMB
2008
Springer
16 years 6 months ago
2008
Springer
In the past years, many combinatorial arguments have been made to support the theory that mammalian genome rearrangement scenarios rely heavily on breakpoint reuse. Different model...
159
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
166
click to vote
LATA
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...
168
click to vote
IEEEARES
2009
IEEE
16 years 1 months ago
2009
IEEE
—Alice and Bob notation is a popular way to describe security protocols: it is intuitive, succinct, and yet expressive. Several formal protocol specification languages are based...