Sciweavers

3044 search results - page 119 / 609
» Linear logical approximations
Sort
View
ICFP
2003
ACM
14 years 9 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
CORR
1999
Springer
75views Education» more  CORR 1999»
13 years 8 months ago
A System of Interaction and Structure
This paper introduces a logical system, called BV , which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challe...
Alessio Guglielmi
MOVEP
2000
167views Hardware» more  MOVEP 2000»
14 years 17 days ago
Model Checking: A Tutorial Overview
We survey principles of model checking techniques for the automatic analysis of reactive systems. The use of model checking is exemplified by an analysis of the Needham-Schroeder p...
Stephan Merz
TCS
1998
13 years 8 months ago
Proving Possibility Properties
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
Leslie Lamport
COCOON
2001
Springer
14 years 1 months ago
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer