3323 search results - page 452 / 665 » Computational Semantics with Functional Programming |
179
click to vote
SIGSOFT
2008
ACM
16 years 7 months ago
2008
ACM
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relat...
148
click to vote
CONCUR
2007
Springer
16 years 22 days ago
2007
Springer
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
171
click to vote
DCOSS
2007
Springer
16 years 22 days ago
2007
Springer
Macroprogramming—the technique of specifying the behavior of the system, as opposed to the constituent nodes—provides application developers with high level abstractions that a...
167
click to vote
FCT
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
153
click to vote
RTSS
2005
IEEE
16 years 4 days ago
2005
IEEE
nt a new concurrency control abstraction for real-time systems called preemptible atomic regions (PARs). PARs a transactional mechanism that improves upon lock-based mutual exclus...