FAC
2010
13 years 1 months ago
2010
Separation logic allows simple proofs of concurrent algorithms which use blocking mechanisms such as semaphores. It can even deal with non-blocking algorithms. With the addition of...
FAC
2010
13 years 1 months ago
2010
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
FAC
2010
13 years 1 months ago
2010
Code and design smells are recurring design problems in software systems that must be identified to avoid their possible negative consequences on development and maintenance. Conse...
FAC
2010
13 years 1 months ago
2010
FAC
2010
13 years 1 months ago
2010
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
FAC
2010
13 years 1 months ago
2010
Inspired by the properties of the refinement development of the Mondex Electronic Purse, we view an isolated atomic action as a family of transitions with a common before-state, an...
FAC
2010
13 years 3 months ago
2010
FAC
2010
13 years 3 months ago
2010
: © Algebra and logic for access control Matthew Collinson, David Pym HP Laboratories HPL-2008-75R1 Access control, process algebra, bunched Logic; systems modelling The access co...
FAC
2010
13 years 3 months ago
2010
We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language in the form of gr...
FAC
2010
13 years 3 months ago
2010
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...