Sciweavers

8132 search results - page 1240 / 1627
» Dependability, Abstraction, and Programming
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
15 years 6 months ago
Cut Elimination for a Logic with Induction and Co-induction
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
Alwen Tiu, Alberto Momigliano
CORR
2008
Springer
179views Education» more  CORR 2008»
15 years 6 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano
ENTCS
2008
120views more  ENTCS 2008»
15 years 6 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
IJBRA
2008
66views more  IJBRA 2008»
15 years 6 months ago
Integer programming-based approach to allocation of reporter genes for cell array analysis
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...
Morihiro Hayashida, Fuyan Sun, Sachiyo Aburatani, ...
CAL
2007
15 years 6 months ago
Dynamic Predication of Indirect Jumps
Abstract—Indirect jumps are used to implement increasinglycommon programming language constructs such as virtual function calls, switch-case statements, jump tables, and interfac...
José A. Joao, Onur Mutlu, Hyesoon Kim, Yale...
« Prev « First page 1240 / 1627 Last » Next »