Sciweavers

1173 search results - page 133 / 235
» Program Derivation Using Analogy
Sort
View
128
Voted
APLAS
2007
ACM
15 years 9 months ago
Timed, Distributed, Probabilistic, Typed Processes
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
Martin Berger, Nobuko Yoshida
ESOP
2006
Springer
15 years 8 months ago
Bisimulations for Untyped Imperative Objects
We present a sound and complete method for reasoning about contextual equivalence in the untyped, imperative object calculus of Abadi and Cardelli [1]. Our method is based on bisim...
Vasileios Koutavas, Mitchell Wand
145
Voted
APLAS
2010
ACM
15 years 5 months ago
Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...
Soonho Kong, Yungbum Jung, Cristina David, Bow-Yaw...
ENTCS
2007
109views more  ENTCS 2007»
15 years 5 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
148
Voted
ANOR
2011
158views more  ANOR 2011»
15 years 2 days ago
Hybrid scatter tabu search for unconstrained global optimization
Abstract The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances ...
Abraham Duarte, Rafael Martí, Fred Glover, ...