1814 search results - page 294 / 363 » Extended First-Order Logic |
143
click to vote
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
149
click to vote
VSTTE
2012
Springer
13 years 10 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
241
Voted
ICDE
2003
IEEE
16 years 4 months ago
2003
IEEE
Intuitively, data management and data integration tools should be well-suited for exchanging information in a semantically meaningful way. Unfortunately, they suffer from two sign...
151
click to vote
VLSID
2007
IEEE
16 years 3 months ago
2007
IEEE
In the past, Field Programmable Gate Array (FPGA) circuits only contained a limited amount of logic and operated at a low frequency. Few applications running on FPGAs consumed exc...
107
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...