4573 search results - page 799 / 915 » Automated Reasoning |
134
click to vote
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
130
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
112
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
131
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
109
click to vote
TPHOL
2009
IEEE
15 years 9 months ago
2009
IEEE
Optical systems are becoming increasingly important as they tend to resolve many bottlenecks in the present age communications and electronics. Some common examples include their u...