557 search results - page 77 / 112 » Automatic Abstraction for Verification of Timed Circuits and... |
184
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
135
click to vote
CONCURRENCY
2008
15 years 6 months ago
2008
Abstract. Database systems have been vital for all forms of data processing for a long time. In recent years, the amount of processed data has been growing dramatically, even in sm...
136
click to vote
SIGSOFT
2005
ACM
16 years 7 months ago
2005
ACM
One of the challenges for software architects is ensuring that an implemented system faithfully represents its architecture. We describe and demonstrate a tool, called DiscoTect, ...
154
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
173
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...