Sciweavers

3799 search results - page 330 / 760
» An Engineering Approach to Formal Methods
Sort
View
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
15 years 11 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
FM
1997
Springer
174views Formal Methods» more  FM 1997»
15 years 11 months ago
A Proof Obligation Generator for VDM-SL
In this paper an extension of the IFAD VDM-SL Toolbox with a proof obligation generator is described. Static type checking in VDM is undecidable in general and therefore the type c...
Bernhard K. Aichernig, Peter Gorm Larsen
179
Voted
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 11 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
AGTIVE
2007
Springer
15 years 10 months ago
Generating Domain-Specific Model Editors with Complex Editing Commands
Abstract. Domain specific modeling languages are of increasing importance for the development of software and other systems. Meta tools are needed to support rapid development of d...
Gabriele Taentzer, André Crema, René...
FORMATS
2007
Springer
15 years 10 months ago
CSL Model Checking Algorithms for Infinite-State Structured Markov Chains
Jackson queueing networks (JQNs) are a very general class of queueing networks that find their application in a variety of settings. The state space of the continuous-time Markov c...
Anne Remke, Boudewijn R. Haverkort