546 search results - page 35 / 110 » Substructural Operational Semantics as Ordered Logic Program... |
156
click to vote
TACS
2001
Springer
15 years 10 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
141
click to vote
TASE
2008
IEEE
16 years 9 days ago
2008
IEEE
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechan...
164
click to vote
ATAL
2009
Springer
16 years 15 days ago
2009
Springer
Several agent-oriented software engineering methodologies address the emerging challenges posed by the increasing need of adaptive software. A common denominator of such methodolo...
156
Voted
POPL
2010
ACM
16 years 3 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
164
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...