Sciweavers

TACAS
1997
Springer
87views Algorithms» more  TACAS 1997»
14 years 3 months ago
Integration in PVS: Tables, Types, and Model Checking
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
Sam Owre, John M. Rushby, Natarajan Shankar
TACAS
1997
Springer
146views Algorithms» more  TACAS 1997»
14 years 3 months ago
Compositional State Space Generation from Lotos Programs
This paper describes a compositional approach to generate the labeled transition system representing the behavior of a Lotos program by repeatedly alternating composition and reduc...
Jean-Pierre Krimm, Laurent Mounier
TACAS
1997
Springer
132views Algorithms» more  TACAS 1997»
14 years 3 months ago
Test Generation for Intelligent Networks Using Model Checking
We study the use of model checking techniques for the generation of test sequences. Given a formal model of the system to be tested, one can formulate test purposes. A model checke...
André Engels, Loe M. G. Feijs, Sjouke Mauw
TACAS
1997
Springer
72views Algorithms» more  TACAS 1997»
14 years 3 months ago
The Term Processor Generator Kimwitu
The Kimwitu system is a meta-tool that supports the construction of programs (tools) that operate on trees or terms. The system supports open multi-paradigm programming, in that i...
Peter van Eijk, Axel Belinfante, Henk Eertink, Hen...
TACAS
1997
Springer
197views Algorithms» more  TACAS 1997»
14 years 3 months ago
Design/CPN - A Computer Tool for Coloured Petri Nets
In this paper, we describe the computer tool Design CPN supporting editing, simulation, and state space analysis of Coloured Petri Nets. So far, approximately 40 man-years have bee...
Søren Christensen, Jens Bæk Jø...
TACAS
1997
Springer
105views Algorithms» more  TACAS 1997»
14 years 3 months ago
Graphs in METAFrame: The Unifying Power of Polymorphism
We present a highly polymorphic tool for the construction, synthesis, structuring, manipulation, investigation, and (symbolic) execution of graphs. The exibility of this tool, whic...
Michael von der Beeck, Volker Braun, Andreas Cla&s...
STOC
1996
ACM
78views Algorithms» more  STOC 1996»
14 years 3 months ago
Non-Expansive Hashing
Nathan Linial, Ori Sasson
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
14 years 3 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...