2540 search results - page 207 / 508 » Abstract Logics as Dialgebras |
162
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
196
click to vote
ENTCS
2008
15 years 6 months ago
2008
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...
179
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
176
click to vote
ICDAR
2003
IEEE
15 years 12 months ago
2003
IEEE
er presents an approach to deriving an abstract geometric model of a table from a physical representation. The technique developed uses a graph of constraints between cells which ...
193
click to vote
VMCAI
2009
Springer
16 years 1 months ago
2009
Springer
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...