238 search results - page 20 / 48 » Compositional Proof Methods for Concurrency: A Semantic Appr... |
JOT
2008
14 years 9 months ago
2008
Complex software systems possess concurrent and reactive behaviors requiring precise specifications prior to development. Lamport's transition axiom method is a formal specif...
CC
2010
Springer
15 years 4 months ago
2010
Springer
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
APAL
2002
14 years 9 months ago
2002
A notion called Herbrand saturation is shown to provide the modeltheoretic analogue of a proof-theoretic method, Herbrand analysis, yielding uniform model-theoretic proofs of a nu...
DSRT
2009
IEEE
15 years 1 months ago
2009
IEEE
Base Object Model (BOM) is a component-based standard designed to support reusability and Composability. Reusability helps in reducing time and cost of the development of a simula...
ISORC
2005
IEEE
15 years 3 months ago
2005
IEEE
Web Services emerge as a new paradigm for distributed computing. Model checking is an important verification method to ensure the trustworthiness of composite WS. abstraction and...