Linearisability is a key correctness criterion for concurrent data structures, ensuring that each history of the concurrent object under consideration is consistent with respect to a …
EN Zalta, U Nodelman, C Allen… - See http://plato. stanford …, 2002 - academia.edu
After an introductory section, this article will focus on four questions: How should the Kyoto School be defined? What is meant by its central philosophical concept of “absolute …
Following the Stanford Encyclopedia of Philosophy,“the term temporal logic has been broadly used to cover all approaches to the representation of temporal information within a …
In this book leading scholars from every relevant field report on all aspects of compositionality, the notion that the meaning of an expression can be derived from its parts …
We propose a framework for component-based modeling using an abstract layered model for components. A component is the superposition of two models: a behavior model and an …
Abstract Design by Contract (DbC) promotes reliable software development through elaboration of type signatures for sequential programs with logical predicates. This paper …
X Feng - Proceedings of the 36th annual ACM SIGPLAN …, 2009 - dl.acm.org
Rely-Guarantee reasoning is a well-known method for verification of shared-variable concurrent programs. However, it is difficult for users to define rely/guarantee conditions …
D Giannakopoulou, CS Pasareanu… - … 17th IEEE International …, 2002 - ieeexplore.ieee.org
Model checking is an automated technique that can be used to determine whether a system satisfies certain required properties. The typical approach to verifying properties of software …
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling …