10568 search results - page 319 / 2114 » Computer Intelligence and Formalization |
142
click to vote
FOSSACS
2006
Springer
15 years 7 months ago
2006
Springer
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
117
Voted
CORR
1998
Springer
15 years 3 months ago
1998
Springer
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
128
click to vote
SEFM
2007
IEEE
15 years 10 months ago
2007
IEEE
We give a formal account of a calculus for modeling service-based systems, suitable to describe both service composition (orchestration) and the protocol that services run when in...
117
click to vote
FM
2003
Springer
15 years 9 months ago
2003
Springer
Processor obsolescence is a serious maintenance problem for long-lived embedded control systems. A practical solution is to interpose an emulator program between the ‘legacy’ s...
171
click to vote
CRYPTO
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. We present EasyCrypt, an automated tool for elaborating security proofs of cryptographic systems from proof sketches—compact, formal representations of the essence of a...