Sciweavers

9626 search results - page 54 / 1926
» Invariant Based Programming
Sort
View
ACSC
2004
IEEE
15 years 8 months ago
Strength Reduction for Loop-Invariant Types
Types are fundamental for enforcing levels of abstraction in modern high-level programming languages and their lower-level representations. However, some type-related features suc...
Phung Hua Nguyen, Jingling Xue
CHARME
2001
Springer
105views Hardware» more  CHARME 2001»
15 years 9 months ago
Net Reductions for LTL Model-Checking
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...
Javier Esparza, Claus Schröter
FUIN
2008
56views more  FUIN 2008»
15 years 4 months ago
Specification and Verification of Invariants by Exploiting Layers in OO Designs
Abstract. The layering that is present in many OO designs is not accounted for in current interpretations of invariants. We propose to make layers explicit in specifications and in...
Ronald Middelkoop, Cornelis Huizing, Ruurd Kuiper,...
ESOP
2007
Springer
15 years 8 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan
FAC
2007
121views more  FAC 2007»
15 years 4 months ago
On assertion-based encapsulation for object invariants and simulations
In object-oriented programming, reentrant method invocations and shared references make it difficult to achieve adequate encapsulation for sound modular reasoning. This tutorial p...
David A. Naumann