2282 search results - page 118 / 457 » Active property checking |
125
click to vote
LMCS
2007
15 years 4 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
209
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
144
click to vote
CADE
2007
Springer
16 years 4 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...
163
click to vote
ICST
2009
IEEE
15 years 11 months ago
2009
IEEE
It is challenging to test applications and functions for which the correct output for arbitrary input cannot be known in advance, e.g. some computational science or machine learni...
139
click to vote
CGO
2008
IEEE
15 years 11 months ago
2008
IEEE
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...