219 search results - page 40 / 44 » Bond-Free Languages: Formalizations, Maximality and Construc... |
LPNMR
1990
Springer
13 years 11 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
TLDI
2005
ACM
14 years 1 months ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
ESOP
2004
Springer
14 years 1 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
IFL
2007
Springer
14 years 1 months ago
2007
Springer
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
CAISE
2001
Springer
14 years 3 days ago
2001
Springer
The UML lacks precise and formal foundations for several constructs such as transition guards or method bodies, for which it resorts to semantic loopholes in the form of “uninter...