3658 search results - page 560 / 732 » The logic of proofs, semantically |
163
click to vote
ENTCS
2006
15 years 6 months ago
2006
We propose a formal method to validate the reliability of a web application, by modeling interactions among its constituent objects. Modeling exploits the recent "Multiple Le...
175
click to vote
CADE
2010
Springer
15 years 5 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
165
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
156
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
195
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...