Sciweavers

35 search results - page 5 / 7
» Monotonic Abstraction in Parameterized Verification
Sort
View
APLAS
2001
ACM
13 years 11 months ago
Verifying the CPS Transformation in Isabelle/HOL
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
Yasuhiko Minamide, Koji Okuma
ICFP
2003
ACM
14 years 7 months ago
Verifying CPS transformations in Isabelle/HOL
We have verified several versions of the CPS transformation in Isabelle/HOL. In our verification we adopted first-order abstract syntax with variable names so that the formalizati...
Yasuhiko Minamide, Koji Okuma
CADE
2006
Springer
14 years 7 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
SOFSEM
2010
Springer
14 years 4 months ago
On the Complexity of the Highway Pricing Problem
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
Alexander Grigoriev, Joyce van Loon, Marc Uetz
CP
2008
Springer
13 years 9 months ago
CPBPV: A Constraint-Programming Framework for Bounded Program Verification
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
Hélène Collavizza, Michel Rueher, Pa...