Sciweavers

738 search results - page 115 / 148
» Formal Methods: for All or for Chosen
Sort
View
SEFM
2007
IEEE
14 years 2 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
IFL
2007
Springer
141views Formal Methods» more  IFL 2007»
14 years 2 months ago
Partial Parsing: Combining Choice with Commitment
Abstract. Parser combinators, often monadic, are a venerable and widelyused solution to read data from some external format. However, the capability to return a partial parse has, ...
Malcolm Wallace
ATAL
2005
Springer
14 years 2 months ago
Towards a theory of "local to global" in distributed multi-agent systems (I)
There is a growing need for a theory of “local to global” in distributed multi-agent systems, one which is able systematically to describe and analyze a variety of problems. T...
Daniel Yamins
CIS
2005
Springer
14 years 2 months ago
A New Conceptual Framework Within Information Privacy: Meta Privacy
When considering information security and privacy issues most of the attention has previously focussed on data protection and the privacy of personally identifiable information (PI...
Geoff Skinner, Song Han, Elizabeth Chang
FORMATS
2005
Springer
14 years 2 months ago
Quantifying Similarities Between Timed Systems
We define quantitative similarity functions between timed transition systems that measure the degree of closeness of two systems as a real, in contrast to the traditional boolean ...
Thomas A. Henzinger, Rupak Majumdar, Vinayak S. Pr...