437 search results - page 83 / 88 » Proving Termination by Divergence |
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper deals with the tracking problem for constrained linear systems using a model predictive control (MPC) law. As it is well known, MPC provides a control law suitable f...
CASES
2004
ACM
14 years 1 months ago
2004
ACM
+ With more applications being deployed on embedded platforms, software protection becomes increasingly important. This problem is crucial on embedded systems like financial transa...
AGTIVE
2003
Springer
14 years 1 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
PKC
2009
Springer
14 years 12 days ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...