2137 search results - page 150 / 428 » Proving Abstract Non-interference |
118
click to vote
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, s, stacks, etc. Gurevich's Abstract State Ma...
102
click to vote
COORDINATION
2010
Springer
15 years 3 months ago
2010
Springer
In the context of service-oriented computing, behavioural contracts are descriptions of the message-passing behaviour of services. They can be used to check properties of service c...
139
click to vote
AAECC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
127
click to vote
ENDM
2010
15 years 3 months ago
2010
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...