Sciweavers

4617 search results - page 692 / 924
» Automation of Diagrammatic Reasoning
Sort
View
LICS
2009
IEEE
16 years 1 months ago
Clipping: A Semantics-Directed Syntactic Approximation
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
Dan R. Ghica, Adam Bakewell
LICS
2009
IEEE
16 years 1 months ago
An Algebra for Kripke Polynomial Coalgebras
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...
LICS
2009
IEEE
16 years 1 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
Oliver Friedmann
TPHOL
2009
IEEE
16 years 1 months ago
VCC: A Practical System for Verifying Concurrent C
VCC is an industrial-strength verification environment for low-level concurrent system code written in C. VCC takes a program (annotated with function contracts, state assertions,...
Ernie Cohen, Markus Dahlweid, Mark A. Hillebrand, ...
TFM
2009
Springer
136views Formal Methods» more  TFM 2009»
16 years 1 months ago
On Teaching Formal Methods: Behavior Models and Code Analysis
Abstract. Teaching formal methods is a challenging task for several reasons. First, both the state-of-the-art knowledge and the tools are rapidly evolving. Second, there are no com...
Jan Kofron, Pavel Parizek, Ondrej Sery