276 search results - page 14 / 56 » Abstraction and Refinement for Local Reasoning |
114
click to vote
FMCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...
70
Voted
SIGSOFT
2005
ACM
15 years 10 months ago
2005
ACM
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
ICPR
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--In this paper we propose a new multi-view semisupervised learning algorithm called Local Co-Training (LCT). The proposed algorithm employs a set of local models with vect...
LICS
1994
IEEE
15 years 1 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...