780 search results - page 110 / 156 » Compositional Quantitative Reasoning |
119
Voted
CAV
1998
Springer
15 years 5 months ago
1998
Springer
Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system veri cation. Re nement mappings (homomorphisms) have long bee...
118
Voted
PLILP
1998
Springer
15 years 4 months ago
1998
Springer
We report on the current status of the LMC project, which seeks to deploy the latest developments in logic-programming technology to advance the state of the art of system speci ca...
93
Voted
LICS
1996
IEEE
15 years 4 months ago
1996
IEEE
We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assume-guarantee)...
LICS
1997
IEEE
15 years 4 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
117
click to vote
AISC
2008
Springer
15 years 2 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...