446 search results - page 81 / 90 » Automating Theories in Intuitionistic Logic |
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
GIS
2008
ACM
14 years 8 months ago
2008
ACM
It has been pointed out repeatedly that spatial operations must be extended to include support for 3D and moving objects. The attempt to code by hand each spatial operation for ea...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...