923 search results - page 106 / 185 » Proving the value of formal methods |
173
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
177
click to vote
OTM
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we will concentrate on the conceptual modeling and semantics of service delegation and alignment in information systems. In delegation, one typically has the situatio...
165
click to vote
ENTCS
2002
15 years 6 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
169
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
Programs represented in Static Single Assignment (SSA) form contain phi instructions (or functions) whose operational semantics are to merge values coming from distinct control flo...
177
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...