3658 search results - page 479 / 732 » The logic of proofs, semantically |
123
click to vote
ENTCS
2006
15 years 6 months ago
2006
We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of ...
173
click to vote
IANDC
2010
15 years 5 months ago
2010
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
156
click to vote
JLP
2011
14 years 9 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
208
click to vote
APLAS
2011
ACM
14 years 6 months ago
2011
ACM
Modern multi-core microprocessors implement weak memory consistency models; programming for these architectures is a challenge. This paper solves a problem open for ten years, and ...
216
click to vote
ECOWS
2007
Springer
16 years 24 days ago
2007
Springer
Execution monitoring of complex web service process models is critical for effective management and control of web services based systems. During the composite process model execu...