Sciweavers

15885 search results - page 2894 / 3177
» Strategic Software Engineering
Sort
View
FOSSACS
2009
Springer
15 years 11 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
FOSSACS
2009
Springer
15 years 11 months ago
Bisimulation for Demonic Schedulers
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
Konstantinos Chatzikokolakis, Gethin Norman, David...
FOSSACS
2009
Springer
15 years 11 months ago
Reactive Systems, Barbed Semantics, and the Mobile Ambients
Reactive systems, proposed by Leifer and Milner, represent a meta-framework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics...
Filippo Bonchi, Fabio Gadducci, Giacoma Valentina ...
FOSSACS
2009
Springer
15 years 11 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
15 years 11 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
« Prev « First page 2894 / 3177 Last » Next »