Sciweavers

852 search results - page 65 / 171
» entcs 2010
Sort
View
ENTCS
2006
114views more  ENTCS 2006»
14 years 11 months ago
Towards Efficient, Typed LR Parsers
The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, us...
François Pottier, Yann Régis-Gianas
ENTCS
2006
125views more  ENTCS 2006»
14 years 11 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere
ENTCS
2006
131views more  ENTCS 2006»
14 years 11 months ago
Development Separation in Lambda-Calculus
We present a proof technique in -calculus that can facilitate inductive reasoning on -terms by separating certain -developments from other -reductions. We give proofs based on thi...
Hongwei Xi
ENTCS
2006
137views more  ENTCS 2006»
14 years 11 months ago
Automated Security Protocol Analysis With the AVISPA Tool
The AVISPA Tool is a push-button tool for the Automated Validation of Internet Security Protocols and Applications. It provides a modular and expressive formal language for specif...
Luca Viganò
ENTCS
2006
145views more  ENTCS 2006»
14 years 11 months ago
Cooperation-based Invariants for OO Languages
In general, invariants may depend on the state of other objects. The approach introduced in this paper allows this for objects of mutually visible classes, in a way that supports ...
Ronald Middelkoop, Cornelis Huizing, Ruurd Kuiper,...