1020 search results - page 172 / 204 » Tight Semantics for Logic Programs |
106
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
134
Voted
IEE
2008
15 years 2 months ago
2008
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
244
Voted
POPL
2003
ACM
16 years 2 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...
120
Voted
FLOPS
2008
Springer
15 years 4 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
143
click to vote
KBSE
2005
IEEE
15 years 8 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...