115 search results - page 19 / 23 » On contraction and the modal fragment |
AINA
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract — Governing business compliance with regulations, laws, best practices, contracts, and the like is not an easy task, and so far there are only limited software products ...
POPL
2003
ACM
14 years 9 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
CADE
2004
Springer
14 years 9 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
POPL
2009
ACM
14 years 9 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
BIRTHDAY
2009
Springer
14 years 3 months ago
2009
Springer
In previous work, we proposed a modal fragment of the situation calculus called ES, which fully captures Reiter’s basic action theories. ES also has epistemic features, includin...