Sciweavers

1864 search results - page 128 / 373
» Formal topology and domains
Sort
View
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
16 years 17 days ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...
ICSE
2010
IEEE-ACM
15 years 11 months ago
Eliminating dead-code from XQuery programs
One of the challenges in web software development is to help achieving a good level of quality in terms of code size and runtime performance, for increasingly popular domain speci...
Pierre Genevès, Nabil Layaïda
ECOOPW
1999
Springer
15 years 10 months ago
Managing Unanticipated Evolution of Software Architectures
Few existing approaches towards architectural evolution deal with unanticipated evolution. This is an important restriction, since a lot of architectural changes are very di cult ...
Kim Mens, Tom Mens, Bart Wouters, Roel Wuyts
DAGSTUHL
2003
15 years 7 months ago
Operational Semantics of Security Protocols
Based on a concise domain analysis we develop a formal semantics of security protocols. Its main virtue is that it is a generic model, in the sense that it is parameterized over e...
Cas J. F. Cremers, Sjouke Mauw
CACM
2005
74views more  CACM 2005»
15 years 6 months ago
Separate handles from names on the internet
Networked communications inherently depend on the ability of the sender of a message to indicate through some token how the message should be delivered to a particular recipient. ...
Michael J. O'Donnell