Sciweavers

3658 search results - page 556 / 732
» The logic of proofs, semantically
Sort
View
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
15 years 10 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
WIFT
1998
IEEE
153views Hardware» more  WIFT 1998»
15 years 10 months ago
Reasoning with UML Class Diagrams
The Unified Modeling Language (UML) is likely to become an important industry standard language for modelling object-oriented systems. However, its use as a precise analysis tool ...
Andy S. Evans
AADEBUG
1993
Springer
15 years 10 months ago
Slicing Programs with Arbitrary Control-flow
Program slicing is a program transformation that is useful in program debugging, program maintenance, and other applications that involve understanding program behavior. Given a p...
Thomas Ball, Susan Horwitz
FSTTCS
1993
Springer
15 years 10 months ago
Essential Intersection Type Assignment
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculus; these are strict in the sense that they are the representatives of equivalen...
Steffen van Bakel
SIGSOFT
1993
ACM
15 years 10 months ago
Using Style to Understand Descriptions of Software Architecture
The software architecture of most systems is described informally and diagrammatically. In order for these descriptions to be meaningful at all, gures are understood by interpreti...
Gregory D. Abowd, Robert Allen, David Garlan