Sciweavers

546 search results - page 35 / 110
» Substructural Operational Semantics as Ordered Logic Program...
Sort
View
TACS
2001
Springer
14 years 22 hour ago
A Logic Programming Language Based on Binding Algebras
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...
Makoto Hamana
TASE
2008
IEEE
14 years 2 months ago
Verifying BPEL-Like Programs with Hoare Logic
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...
Chenguang Luo, Shengchao Qin, Zongyan Qiu
ATAL
2009
Springer
14 years 2 months ago
Operational semantics of goal models in adaptive agents
Several agent-oriented software engineering methodologies address the emerging challenges posed by the increasing need of adaptive software. A common denominator of such methodolo...
Mirko Morandini, Loris Penserini, Anna Perini
POPL
2010
ACM
14 years 5 months ago
Counterexample-Guided Focus
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...
Andreas Podelski, Thomas Wies
CADE
2006
Springer
14 years 8 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
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 ...
Robert L. Constable, Wojciech Moczydlowski