270 search results - page 3 / 54 » Call Invariants |
CONCUR
2004
Springer
13 years 10 months ago
2004
Springer
Systems (extended abstract) Simona Orzan and Tim A.C. Willemse Department of Mathematics and Computer Science, Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, T...
MLQ
2002
13 years 4 months ago
2002
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
CSR
2008
Springer
13 years 6 months ago
2008
Springer
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
ICPR
2004
IEEE
14 years 6 months ago
2004
IEEE
ENTCS
2006
13 years 4 months ago
2006
In general, invariants may depend on the state of other objects. The approach introduced in this paper allows this for objects of mutually visible classes, in a way that supports ...