Sciweavers

276 search results - page 16 / 56
» Abstraction and Refinement for Local Reasoning
Sort
View
134
Voted
ENTCS
2008
120views more  ENTCS 2008»
15 years 1 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
EJC
2008
15 years 1 months ago
Locally constrained graph homomorphisms and equitable partitions
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
Jirí Fiala, Daniël Paulusma, Jan Arne ...
117
Voted
MOC
2010
14 years 8 months ago
Sharply local pointwise a posteriori error estimates for parabolic problems
Abstract. We prove pointwise a posteriori error estimates for semi- and fullydiscrete finite element methods for approximating the solution u to a parabolic model problem. Our esti...
Alan Demlow, Charalambos Makridakis
POPL
2010
ACM
15 years 11 months ago
Low-Level Liquid Types
We present Low-Level Liquid Types, a refinement type system for C based on Liquid Types. Low-Level Liquid Types combine refinement types with three key elements to automate verifi...
Ming Kawaguchi, Patrick Maxim Rondon, Ranjit Jhala
138
Voted
ARGMAS
2006
Springer
15 years 5 months ago
Specification and Complexity of Strategic-Based Reasoning Using Argumentation
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...
Mohamed Mbarki, Jamal Bentahar, Bernard Moulin