Sciweavers

159 search results - page 18 / 32
» Type Equivalence Checking in Persistent Object Systems
Sort
View
ENTCS
2008
92views more  ENTCS 2008»
13 years 8 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
FSTTCS
2010
Springer
13 years 6 months ago
Generalizing the powerset construction, coalgebraically
a is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behav...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...
ECOOP
2007
Springer
14 years 16 days ago
Validity Invariants and Effects
Object invariants describe the consistency of object states, and are crucial for reasoning about the correctness of object-oriented programs. However, reasoning about object invari...
Yi Lu 0003, John Potter, Jingling Xue
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 2 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
COCOON
2005
Springer
14 years 2 months ago
On Sequential and 1-Deterministic P Systems
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe...