4047 search results - page 729 / 810 » Algebraic Model Checking |
LICS
2000
IEEE
15 years 6 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
117
Voted
SIGSOFT
2000
ACM
15 years 6 months ago
2000
ACM
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
102
Voted
CAV
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Any formalmethodor tool is almostcertainlymoreoftenapplied in situationswheretheoutcomeis failure(acounterexample)rather than success (a correctness proof). We present a ...
155
click to vote
DATE
1999
IEEE
15 years 6 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
117
click to vote
IDEAS
1999
IEEE
15 years 6 months ago
1999
IEEE
Data integration of several sources has gained considerable attentions with the recent popularity of the Web. In the real world, some information may be missing i.e., partial and ...