611 search results - page 83 / 123 » Yuri, Logic, and Computer Science |
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
TLCA
2005
Springer
15 years 3 months ago
2005
Springer
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
STACS
2001
Springer
15 years 2 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
111
click to vote
JFP
2007
14 years 9 months ago
2007
Software engineering courses offer one of many opportunities for providing students with a significant experience in declarative programming. This report discusses some results fr...